Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

3673109145 · May 202619922001200920172026
48 results for free decompression

Method reconstructs hidden Markov chains from insurance data.

problem Recovering hidden Markov chains from incomplete insurance data.
method Neural architecture to explicitly provide transition probabilities.
result Neural model successfully validates decompression of insurance information.

Proposes a method to train neural networks directly on compressed text data.

problem Training neural networks on compressed text data without decompression.
method Introduces composer modules to encode symbols from grammar compression rules into vector representations.
result Demonstrates that the proposed method can achieve both memory and computational efficiency while maintaining moderate performance.

High-quality image synthesis with diffusion models, achieving state-of-the-art FID score.

problem Generating high-quality images from latent variables.
method Training diffusion probabilistic models with a weighted variational bound, inspired by denoising score matching and Langevin dynamics.
result State-of-the-art FID score of 3.17 on CIFAR10 dataset.

Pruning is an efficient model compression technique to remove redundancy in the connectivity of deep neural networks (DNNs). Computations using sparse matrices obtained by pruning parameters, however, exhibit vastly different parallelism depending on the index representation scheme. As a result, fine-grained pruning ha…

2019-05-14abs ↗pdf ↗

This paper puts forth a novel bi-linear modeling framework for data recovery via manifold-learning and sparse-approximation arguments and considers its application to dynamic magnetic-resonance imaging (dMRI). Each temporal-domain MR image is viewed as a point that lies onto or close to a smooth manifold, and landmark …

2018-12-27abs ↗pdf ↗

Deep learning accelerates Monte Carlo SDE simulations with large time steps.

problem Accurate simulation of SDEs with large time steps.
method Polynomial chaos expansion with neural network learned stochastic collocation points.
result Data-driven scheme achieves strong convergence in Monte Carlo simulations.

Object detection in still images has drawn a lot of attention over past few years, and with the advent of Deep Learning impressive performances have been achieved with numerous industrial applications. Most of these deep learning models rely on RGB images to localize and identify objects in the image. However in some a…

2019-04-16abs ↗pdf ↗

Paper introduces a new adaptive gradient method with gradient compression for distributed training.

problem Communication overhead in distributed machine learning systems.
method Adaptive gradient method with gradient compression, scalable system BytePS-Compress.
result Convergence rate of O(1/T)\mathcal{O}(1/\sqrt{T}) for non-convex problems.

Transformers for binary decisions are sensitive to evidence order, leading to unreliable outcomes.

problem Order sensitivity in Transformers for binary decisions leads to unreliable outcomes.
method Formalized an expectation-realization gap and developed QMV and EDFL bounds.
result Uniform permutation mixtures reduce dispersion and improve reliability.

Manually authoring transition animations for a complete locomotion system can be a tedious and time-consuming task, especially for large games that allow complex and constrained locomotion movements, where the number of transitions grows exponentially with the number of states. In this paper, we present a novel approac…

2018-10-04abs ↗pdf ↗

Proves incoherence of free-by-free and surface-by-free groups, solving two problems.

problem Proving incoherence of free-by-free and surface-by-free groups.
method Semidirect product construction and virtual algebraic fibering analysis.
result Proves incoherence of free-by-free and surface-by-free groups, answering a question posed by J. Hillman.

We show that the complex of free factors of a free group of rank n > 1 is homotopy equivalent to a wedge of spheres of dimension n-2. We also prove that for n > 1, the complement of (unreduced) Outer space in the free splitting complex is homotopy equivalent to the complex of free factor systems and moreover is (n-2)-c…

2018-10-22abs ↗pdf ↗

The notion of free link is a generalized notion of virtual link. In the present paper we define the group of free braids, prove the Alexander theorem that all free links can be obtained as closures of free braids and prove a Markov theorem, which gives necessary and sufficient conditions for two free braids to have the…

2011-12-17abs ↗pdf ↗

We investigate cobordisms of free knots. Free knots and links are also called homotopy classes of Gauss words and phrases. We define a new strong invariant of free knots which allows to detect free knots not cobordant to the trivial one.

2009-04-18abs ↗pdf ↗

A Seifert surface F for a knot K is free if the complement of F is a handlebody (i.e., has free fundamental group). The free genus of K is the minimum genus among all free Seifert surfaces for K. In this paper we show that there exist families of hyperbolic knots with arbitrarily large volume, which each have free genu…

1998-09-24abs ↗pdf ↗

We develop the notion of Brakke flow with free-boundary in a barrier surface. Unlike the classical free-boundary mean curvature flow, the free-boundary Brakke flow must "pop" upon tangential contact with the barrier. We prove a compactness theorem for free-boundary Brakke flows, define a Gaussian monotonicity formula v…

2016-02-11abs ↗pdf ↗

The paper classifies fixed subgroups of endomorphisms in free-abelian times surface groups.

problem Characterizing fixed subgroups of endomorphisms in specific group structures.
method Study of endomorphisms, classification of fixed subgroups, and equivalent conditions for end-fixed subgroups.
result Complete classification of fixed subgroups in free-abelian times surface groups.

The study shows that certain groups can be uniquely identified by their finite abelian summands.

problem Identifying groups based on their finite abelian summands.
method Analyzing hyperbolic groups as graphs of free groups with cyclic edge groups.
result Free products of free and surface groups are profinitely rigid.

We define risk-free portfolios using three gauge invariant differential operators that require such portfolios to be insensitive to price changes, to be self-financing, and to produce a zero real return so there are no risk-free profits. This definition identifies the risk-free rate as the return of an infinitely diver…

2016-05-11abs ↗pdf ↗

We examine free orientation-reversing group actions on orientable handlebodies, and free actions on nonorientable handlebodies. A classification theorem is obtained, giving the equivalence classes and weak equivalence classes of free actions in terms of algebraic invariants that involve Nielsen equivalence. This is app…

2004-11-28abs ↗pdf ↗

The paper defines conditions for a free-by-free group to be hyperbolic.

problem Conditions for a free-by-free group to be relatively hyperbolic.
method Necessary and sufficient conditions involving exponentially growing automorphisms and invariant subgroup systems.
result A subgroup system can be used to construct peripheral subgroups making the extension hyperbolic.

Conditions for hyperbolic and relatively hyperbolic extensions of free groups using automorphisms with fixed points.

problem Conditions for hyperbolic and relatively hyperbolic extensions of free groups.
method Using dynamics of outer automorphisms on the complex of free factors and investigating the geometry of the extension group.
result Conditions for hyperbolic and relatively hyperbolic extensions of free groups using automorphisms with fixed points.

We show how to derive hyperbolicity of the free factor complex of FNF_N from the Handel-Mosher proof of hyperbolicity of the free splitting complex of FNF_N, thus obtaining an alternative proof of a theorem of Bestvina-Feighn. We also show that under the natural map ττ from the free splitting complex to free factor co…

2012-06-16abs ↗pdf ↗

ScheduleFree+ improves large language model training without schedules or learning rates.

problem Scaling up Schedule-Free Learning to large language models.
method Learning-rate-free and schedule-free method for training large language models.
result ScheduleFree+ outperforms SOTA schedules by 31% at 1000 tokens per parameter.

Proves a connectivity conjecture for free groups, showing homotopy type of spheres.

problem Establishing a connectivity conjecture for free groups.
method Provided homotopy-equivalent models of the common basis complex using free factors and sphere systems.
result The common basis complex of a free group of rank n has the homotopy type of a wedge of spheres of dimension 2n-3.

We define a notion of free product for coarse spaces that generalizes the corresponding notion of a free product for groups. We show that free products preserve coarse properties such as coarse property C, finite coarse decomposition complexity, and coarse property A. We also give an upper bound estimate on the dimensi…

2019-05-16abs ↗pdf ↗

In this paper we first state the classification of the prolongations of complex free fundamental graded Lie algebras. Next we introduce the notion of free pseudo-product fundamental graded Lie algebras and study the prolongations of complex free pseudo-product fundamental graded Lie algebras. Furthermore we investigate…

2012-06-27abs ↗pdf ↗

The free factor complex of rank 4+ fails a combinatorial isoperimetric inequality.

problem Failure of combinatorial isoperimetric inequality in the free factor complex.
method Construction of a coarsely Lipschitz function from the upward link of a free factor to integers.
result A loop in the free factor complex requires linearly growing number of 2-simplices to fill.