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

Trend · papers per month

106212317423 · Jun 202019922001200920172026
48 results for Information 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 the link between entropy and market efficiency using fractal properties.

problem Determining market efficiency using entropy-based measures and fractal properties.
method Theoretical expression for market information using fractional Brownian motion and Lamperti transform. Multiscale method to interpret entropy and market information.
result A Hurst exponent close to 1/2 can lead to high informativeness of time series due to stationarity.

We consider strictly stationary heavy tailed time series whose finite-dimensional exponent measures are concentrated on axes, and hence their extremal properties cannot be tackled using classical multivariate regular variation that is suitable for time series with extremal dependence. We recover relevant information ab…

2013-07-05abs ↗pdf ↗

Optimal batch size minimizes training time for neural networks.

problem Minimizing training time for two-layer neural networks with SGD.
method Characterized optimal batch size as a function of target hardness (information exponents). Used Correlation loss SGD to overcome limitations.
result Optimal batch size minimizes training time without changing total sample complexity.

Neural network learns low-dimensional polynomials with SGD near information-theoretic limit.

problem Learning a single-index target function with gradient descent.
method Two-layer neural network optimized by SGD on squared loss.
result Sample and runtime complexity of nT=Θ(d ⁣ ⁣polylogd)n \simeq T = Θ(d\!\cdot\! \mathrm{polylog} d) for polynomial single-index models, matching information theoretic limit up to polylogarithmic factors.

New learning rate approach reveals phase transitions in SGD performance.

problem Understanding feature learning dynamics in neural networks.
method Characterizing the relationship between learning rate(s) and sample complexity for gradient-based algorithms.
result Phase transition from information exponent to generative exponent regime with different learning rates.

This work improves online SGD's sample complexity for multi-index models by considering higher-order terms.

problem Suboptimal sample complexity for learning multi-index models using online SGD.
method Focus on both second- and higher-order terms to improve sample complexity.
result Online SGD achieves ildeO(dPL1) ilde{O}(d P^{L-1}) samples for multi-index models.

We study the behaviour of a Hilbert geometry when going to infinity along a geodesic line. We prove that all the information is contained in the shape of the boundary at the endpoint of this geodesic line and have to introduce a regularity property of convex functions to make this link precise. The point of view is a d…

2011-05-31abs ↗pdf ↗

We assume the market price to diffuse in a hierarchical comb of barriers, the heights of which represent the importance of new information entering the market. We find fat tails with the desired exponent for the price change distribution, and effective multifractality for intermediate times.

2002-05-04abs ↗pdf ↗

In many machine learning applications, crowdsourcing has become the primary means for label collection. In this paper, we study the optimal error rate for aggregating labels provided by a set of non-expert workers. Under the classic Dawid-Skene model, we establish matching upper and lower bounds with an exact exponent …

2016-05-25abs ↗pdf ↗

Active-LATHE boosts error exponent for learning homogeneous trees.

problem Learning homogeneous trees from i.i.d. data with active sampling.
method Design and analysis of Active Learning Algorithm for Trees with Homogeneous Edge (Active-LATHE).
result Active-LATHE boosts the error exponent by at least 40% for ρ0.8ρ \geq 0.8.

Study a market with uncertain informed traders, finding price impact depends on both asset value and informed trader count distribution.

problem Uncertain participation of informed traders in a market with limit orders.
method Characterized equilibrium by a fixed point integral equation, analyzed large order asymptotics, solved numerically.
result Equilibrium price impact depends on both asset value and distribution of informed traders, not just expected number of informed traders.

Online SGD achieves consistent estimation in high-dimensional non-convex inference tasks.

problem Consistent estimation in high-dimensional non-convex optimization problems.
method Online stochastic gradient descent (SGD) on non-convex losses.
result Nearly sharp thresholds for sample complexity in high-dimensional settings.

A measure called relative cluster entropy distinguishes between correlated and uncorrelated sequences.

problem Distinguishing between sequences with different correlation degrees.
method Minimum relative entropy principle applied to cluster partitions of power-law correlated sequences.
result Optimal Hurst exponents are selected for market price series, indicating non-markovianity.

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 ↗

New convergence bounds for online learning with heavy-tailed noise.

problem Learning on streaming data with heavy-tailed noise.
method Nonlinear stochastic gradient descent (SGD) for non-convex and strongly convex costs.
result Strong convergence rates for various nonlinearities and noise distributions.

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.

We consider the problem of determining the Lévy exponent in a Lévy model for asset prices given the price data of derivatives. The model, formulated under the real-world measure P\mathbb P, consists of a pricing kernel {πt}t0\{π_t\}_{t\geq0} together with one or more non-dividend-paying risky assets driven by the same Lév…

2018-11-17abs ↗pdf ↗

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.