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,694 papers · 148 categories

Trend · papers per month

6121824 · May 202619922001200920172026
48 results for leap exponent

Two-layer networks learn faster with batch reuse, overcoming information and leap exponents.

problem Limitations of gradient flow and single-pass GD in learning multi-index target functions.
method Multi-pass gradient descent that reuses batches, analyzed using Dynamical Mean-Field Theory.
result Two-time-step overlap with target subspace for non-staircase functions, overcoming information and leap exponents.

Study efficient estimation of hidden subspaces in Gaussian Multi-index models.

problem Estimating hidden subspaces in Gaussian Multi-index models with low-dimensional projections.
method Introduced the generative leap exponent and developed an agnostic sequential estimation procedure using spectral U-statistics.
result Achieved optimal sample complexity of $n=Θ(d^{1 \vee \k/2})$ for efficient estimation.

SGD learns neural networks with a complexity measure called leap.

problem Time complexity of SGD learning on neural networks.
method Introduced a complexity measure called leap, proved conjecture for Gaussian data, and showed saddle-to-saddle dynamics.
result Proved a conjecture about the time complexity of learning functions with low-dimensional support.

LEAPS samples discrete distributions via CTMCs and locally equivariant networks.

problem Sampling from discrete distributions with known normalization.
method Continuous-time Markov chain, locally equivariant functions, attention layers, convolutional networks.
result LEAPS minimizes the variance of importance weights, improving sampling efficiency.

Graph edges, along with their labels, can represent information of fundamental importance, such as links between web pages, friendship between users, the rating given by users to other users or items, and much more. We introduce LEAP, a trainable, general framework for predicting the presence and properties of edges on…

2019-03-11abs ↗pdf ↗

The paper analyzes sampling efficiency of discrete diffusion models, providing sharp and adaptive guarantees.

problem Theoretical foundations of discrete diffusion models, especially sampling efficiency.
method Continuous-time Markov chain (CTMC) formulation, ττ-leaping-based samplers, effective total correlation.
result The ττ-leaping algorithm achieves an iteration complexity of order ildeO(d/ε) ilde O(d/\varepsilon) for uniform discrete diffusion, improving existing bounds by a factor of dd.

Randomly biased data makes complex models as easy to learn as simple ones.

problem Learning complex models like multi-index and sparse Boolean functions.
method Introducing a small random shift in the first moment of the data distribution.
result Randomly biased data makes Gaussian single index models and sparse Boolean functions as easy to learn as linear functions.

We propose a novel neural network embedding approach to model power transmission grids, in which high voltage lines are disconnected and reconnected with one-another from time to time, either accidentally or willfully. We call our architeture LEAP net, for Latent Encoding of Atypical Perturbation. Our method implements…

2019-08-22abs ↗pdf ↗

In complex transfer learning scenarios new tasks might not be tightly linked to previous tasks. Approaches that transfer information contained only in the final parameters of a source model will therefore struggle. Instead, transfer learning at a higher level of abstraction is needed. We propose Leap, a framework that …

2018-12-03abs ↗pdf ↗

Corrected samplers reduce discretization error in discrete flow models without additional computational cost.

problem Discretization error in samplers for discrete flow models.
method Established non-asymptotic error bounds for samplers, proposed time-corrected and location-corrected samplers.
result Location-corrected sampler has lower complexity and better generation quality.

Building deep reinforcement learning agents that can generalize and adapt to unseen environments remains a fundamental challenge for AI. This paper describes progresses on this challenge in the context of man-made environments, which are visually diverse but contain intrinsic semantic regularities. We propose a hybrid …

2018-09-28abs ↗pdf ↗

Data repetition improves SGD's learning of high-dimensional functions.

problem Learning pertinent features in multi-index models with high-dimensional noisy data.
method Investigation of two-layer shallow neural networks trained with gradient-based algorithms, focusing on data repetition.
result Data repetition significantly improves the computational efficiency of SGD, learning all directions with at most O(dlogd)O(d \log d) steps.

LEAP identifies latent causal variables from temporal data.

problem Recovering time-delayed latent causal variables from general temporal data.
method Proposes LEAP, a framework that extends VAEs with constraints for temporally causal latent processes.
result Successfully identifies temporally causal latent processes from observed variables under various dependency structures.

This work analyzes discrete diffusion models using stochastic integrals, providing error bounds and insights.

problem Error analysis for discrete diffusion models remains less understood.
method Proposes a comprehensive framework based on Lévy-type stochastic integrals.
result Obtains the first error bound for the ττ-leaping scheme in KL divergence.

New method improves inference for discrete diffusion models, achieving better quality and efficiency.

problem High dimensionality of discrete diffusion models causes inference challenges.
method Developed high-order numerical inference schemes for discrete diffusion models.
result Second-order accuracy of the θθ-Trapezoidal method in KL divergence.

In this report, an automated bartender system was developed for making orders in a bar using hand gestures. The gesture recognition of the system was developed using Machine Learning techniques, where the model was trained to classify gestures using collected data. The final model used in the system reached an average …

2017-05-16abs ↗pdf ↗

Kurdyka-Lojasiewicz (KL) exponent plays an important role in estimating the convergence rate of many contemporary first-order methods. In particular, a KL exponent of 12\frac12 for a suitable potential function is related to local linear convergence. Nevertheless, KL exponent is in general extremely hard to estimate. I…

2019-02-10abs ↗pdf ↗

We consider the problem of impulse response estimation of stable linear single-input single-output systems. It is a well-studied problem where flexible non-parametric models recently offered a leap in performance compared to the classical finite-dimensional model structures. Inspired by this development and the success…

2018-01-25abs ↗pdf ↗

In this paper, we show how the sampling properties of the Hurst exponent methods of estimation change with the presence of heavy tails. We run extensive Monte Carlo simulations to find out how rescaled range analysis (R/S), multifractal detrended fluctuation analysis (MF-DFA), detrending moving average (DMA) and genera…

2012-01-23abs ↗pdf ↗

Study of deep neural networks using finite-time Lyapunov exponents.

problem Understanding the geometric structures in input space formed by deep neural networks.
method Analogy with dynamical systems, computing finite-time Lyapunov exponents.
result Ridges of large positive exponents divide input space into regions associated with different classes.

Study proves boundedness of operators in variable exponent Morrey spaces.

problem Boundedness of operators in global Morrey-type spaces with variable exponents.
method Analysis of Hardy-Littlewood maximal operator and potential type operator in variable exponent Morrey spaces.
result Boundedness of the Hardy-Littlewood maximal operator and potential type operator in global Morrey-type spaces with variable exponents.

Proves critical exponent for ΘΘ-positive representations in discrete subgroups.

problem Determining the critical exponent for ΘΘ-positive representations.
method Analyzes discrete subgroups ΓPSL(2,R)Γ\subset \mathsf{PSL}(2,\mathbb{R}) and their geometric properties.
result Equality of critical exponent holds if and only if ΓΓ is a lattice for geometrically finite ΓΓ.

Constructs free semigroups with critical exponents close to but less than ambient groups.

problem Creating free semigroups with critical exponents close to but less than ambient groups.
method Constructing finitely generated free subsemigroups with specific properties.
result Free semigroups with critical exponents arbitrarily close to but strictly less than ambient groups.

We study the asymptotic behavior of the Lyapunov exponent in a meromorphic family of random products of matrices in SL(2, C), as the parameter converges to a pole. We show that the blow-up of the Lyapunov exponent is governed by a quantity which can be interpreted as the non-Archimedean Lyapunov exponent of the family.…

2018-03-20abs ↗pdf ↗

New bounds on geodesic dimension and curvature exponent in Carnot groups.

problem Characterizing geodesic dimension and curvature exponent in Carnot groups.
method Characterization and lower bound calculation for geodesic dimension and curvature exponent.
result Found an example where curvature exponent is greater than geodesic dimension.

Study approximates top Lyapunov exponents for surface mapping classes.

problem Approximating topological Lyapunov exponents for surface mapping classes.
method Periodic approximation and joint spectral radius extension.
result Top Lyapunov exponents can be approximated by periodic orbits.

Study on curvature exponent of sub-Finsler Heisenberg groups, proving N_min ≥ 5.

problem Determining the curvature exponent of sub-Finsler Heisenberg groups.
method Analyzing the measure contraction property and constructing sub-Finsler structures.
result Proved that curvature exponent N_min ≥ 5, with equality if sub-Riemannian.

We study the relationship between the Lyapunov exponents of the geodesic flow of a closed negatively curved manifold and the geometry of the manifold. We show that if each periodic orbit of the geodesic flow has exactly one Lyapunov exponent on the unstable bundle then the manifold has constant negative curvature. We a…

2015-01-24abs ↗pdf ↗

In previous work, the author fully classified orbit closures in genus three with maximally many (four) zero Lyapunov exponents of the Kontsevich-Zorich cocycle. In this paper, we prove that there are no higher dimensional orbit closures in genus three with any zero Lyapunov exponents. Furthermore, if a Teichmüller curv…

2014-09-18abs ↗pdf ↗

In the presence of a layer of metaprobabilities (from uncertainty concerning the parameters), the asymptotic tail exponent corresponds to the lowest possible tail exponent regardless of its probability. The problem explains "Black Swan" effects, i.e., why measurements tend to chronically underestimate tail contribution…

2012-10-06abs ↗pdf ↗

Study critical exponents on hyperbolic surfaces with long boundaries using Weil-Petersson measures.

problem Analyzing critical exponents on hyperbolic surfaces with long boundaries.
method Using spine graph construction and comparing normalized Weil-Petersson and Kontsevich measures.
result Asymptotic convergence-in-mean result of normalized Weil-Petersson measures to normalized Kontsevich measures.

Optimizes trading returns using Hurst exponent and Q-learning.

problem Maximizing returns from momentum and mean reversion strategies.
method Classifies assets using Hurst exponent and uses Q-learning to improve trading algorithms.
result Trading with Hurst exponent can achieve higher returns but at higher risk.

We study the Bouchaud-Mézard model on a regular random network. By assuming adiabaticity and independency, and utilizing the generalized central limit theorem and the Tauberian theorem, we derive an equation that determines the exponent of the probability distribution function of the wealth as xx\rightarrow \infty. Th…

2013-07-18abs ↗pdf ↗

mfBm models and forecasts volatility with different Hurst exponents and correlations.

problem Modeling and forecasting volatility with varying Hurst exponents and correlations.
method Multivariate fractional Brownian motion (mfBm) with component-wise Hurst exponents, novel estimation method, time-reversibility test.
result mfBm reduces forecasting errors compared to a one-dimensional model and outperforms HAR model.