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

6481,2971,9452,593 · Jun 202019922001200920172026
48 results for Law of Large Numbers

Counterexamples show failure of uniform laws of large numbers for subdifferentials.

problem Failure of uniform laws of large numbers for subdifferentials under natural assumptions.
method Univariate and bivariate random Lipschitz and convex functions with smooth pieces.
result Counterexamples demonstrate failure of uniform laws of large numbers for subdifferentials.

Study laws of large numbers in online classification, determining optimal regret bounds.

problem Understanding how sequential sampling affects online learning and classification.
method Characterized online learnable classes and determined optimal regret bounds using Littlestone's dimension.
result Optimal regret bounds in online learning are determined, resolving open questions.

This note presents a kind of the strong law of large numbers for an insurance risk caused by a single catastrophic event rather than by an accumulation of independent and identically distributed risks. We derive this result by a large diversification effect resulting from optimal allocation of the risk to many reinsure…

2016-01-13abs ↗pdf ↗

The study explores generalized divergences and exponential families with a focus on sufficient conditions and laws of large numbers.

problem Generalization of Kullback-Leibler divergence and exponential families.
method Investigation of (h,τ)(h,τ)-divergence and (h,τ)(h,τ)-exponential families, definition of (h,τ)(h,τ)-dependence, proof of law of large numbers.
result Sufficient condition for (h,τ)(h,τ)-divergence to induce Hessian structure on (h,τ)(h,τ)-exponential family, proof of law of large numbers.

Study on Volterra Cox-Ingersoll-Ross process, proving asymptotic independence and ergodicity.

problem Analyzing the Volterra Cox-Ingersoll-Ross process and its properties.
method Fine asymptotic analysis of Volterra Riccati equation, affine transformation formula.
result Proves asymptotic independence and ergodicity of the process.

The paper analyzes Bayesian neural networks trained with VI, proving a law of large numbers for different schemes.

problem Training Bayesian neural networks with variational inference.
method Analyzes three training schemes: exact estimation, Bayes by Backprop, and Minimal VI.
result All training schemes converge to the same mean-field limit.

Study uses VIX for zero-coupon Treasury rates, proving long-term stability and returns.

problem Modeling zero-coupon Treasury rates with VIX for volatility.
method Multivariate autoregressive stochastic volatility model, proving stability and Law of Large Numbers.
result VIX accurately models zero-coupon Treasury rates and returns.

Empirical study finds IT project costs follow a power-law distribution, exposing risk underestimation.

problem IT project cost overruns are underestimated due to normal distribution assumptions.
method Analyzed 5,392 IT projects to examine cost overruns following a power-law distribution.
result IT project cost overruns follow a power-law distribution with a fat tail of extreme overruns.

New neural scaling law found for simple quadratic function.

problem Neural scaling laws and their predictions for model performance.
method Analysis of neural networks, lottery ticket ensembling, statistical interpretation.
result Found a new scaling law (α=1α=1) for a simple quadratic function, contradicting previous theories.

We prove a law of large numbers for the volumes of families of random hyperbolic mapping tori and Heegaard splittings providing a sharp answer to a conjecture of Dunfield and Thurston.

2019-05-13abs ↗pdf ↗

This work proves that large models can be compressed significantly without losing performance.

problem Achieving comparable performance with smaller models and less data.
method Developed a universal compression theory for neural networks and datasets.
result Proved that a generic permutation-invariant function can be compressed into a function of polylogarithmic size with vanishing error.

Randomly glued tetrahedra form connected 3-manifolds with a single boundary.

problem Understanding the properties of random three-manifolds formed by truncated tetrahedra.
method Asymptotic analysis of random glued manifolds, proving laws of large numbers, and bounding various topological and geometric properties.
result The random manifolds are connected, have a single boundary component, and admit a unique hyperbolic metric with a uniform spectral gap.

This work investigates power laws in deep neural network ensembles and predicts their performance.

problem Understanding the performance of deep neural network ensembles and their optimal structure.
method Investigated the behavior of negative log-likelihood (CNLL) of a deep ensemble as a function of ensemble size and member network size, identifying power law dependencies.
result One large network may perform worse than an ensemble of several medium-size networks, known as a memory split.

Study on Haantjes tensors for superintegrable systems, focusing on vanishing properties.

problem Understanding the vanishing of Haantjes tensors in superintegrable systems.
method Investigating Killing tensor fields associated with second-order superintegrable systems.
result Characterization of Haantjes-zero Killing tensor fields.

Improved scaling laws in linear regression using data reuse.

problem Sustainability of neural scaling laws when running out of new data.
method Data reuse in multi-pass stochastic gradient descent (multi-pass SGD) for MM-dimensional linear models trained on NN data with sketched features.
result Multi-pass SGD achieves a test error of Θ(M1b+L(1b)/a)Θ(M^{1-b} + L^{(1-b)/a}) with L>NL>N, improving scaling laws in data-constrained regimes.

This work extends the scaling law to multiple and kernel regression, challenging traditional machine learning principles.

problem Challenging traditional machine learning wisdom with scaling law in large practical models.
method Demonstrates the scaling law in multiple and kernel regression settings.
result The scaling law extends to multiple and kernel regression, providing deeper insights into LLMs.

Space exploration technology advances exponentially, consistent with Moore's and Wright's laws.

problem Predicting the advancement of space exploration technology.
method Analysis of Moore's and Wright's laws applied to space exploration technology.
result Spacecraft technology advances exponentially, consistent with Moore's and Wright's laws.

Ensembles of random-feature models can't outperform a single large model.

problem Finding the optimal balance between model size and ensemble size.
method Deterministic equivalent risk estimates and scaling laws analysis.
result Ensembles of random-feature models achieve near-optimal performance only under specific conditions.

We derive scaling laws for optimizing neural networks in hardware.

problem Optimizing the large parameter space of neural networks in hardware.
method Analytical derivation of scaling laws for Coordinate Descent optimization.
result Convergence is exponential and scales linearly with the number of neurons.

Let S=Γ\HS=Γ\backslash \mathbb{H} be a hyperbolic surface of finite topological type, such that the Fuchsian group ΓPSL2(R)Γ\le \operatorname{PSL}_2(\mathbb{R}) is non-elementary, and consider any generating set S\mathfrak S of ΓΓ. When sampling by an nn-step random walk in π1(S)Γπ_1(S) \cong Γ with each step given by an element…

2018-07-10abs ↗pdf ↗

Employing profits data of Japanese companies in 2002 and 2003, we confirm that Pareto's law and the Pareto index are derived from the law of detailed balance and Gibrat's law. The last two laws are observed beyond the region where Pareto's law holds. By classifying companies into job categories, we find that companies …

2005-06-08abs ↗pdf ↗

Unified theory for neural scaling laws in hierarchically compositional data.

problem Understanding neural scaling laws in hierarchically compositional data.
method Probabilistic context-free grammars and power-law distributed production rules.
result Unified learning curve behavior for classification and next-token prediction tasks.

Following the work of Okuyama, Takayasu and Takayasu [Okuyama, Takayasu and Takayasu 1999] we analyze huge databases of Japanese companies' financial figures and confirm that the Zipf's law, a power law distribution with the exponent -1, has been maintained over 30 years in the income distribution of Japanese companies…

2003-08-19abs ↗pdf ↗

We develop a dynamic point process model of correlated default timing in a portfolio of firms, and analyze typical default profiles in the limit as the size of the pool grows. In our model, a firm defaults at a stochastic intensity that is influenced by an idiosyncratic risk process, a systematic risk process common to…

2011-04-10abs ↗pdf ↗

Based on empirical financial time-series, we show that the "silence-breaking" probability follows a super-universal power law: the probability of observing a large movement is inversely proportional to the length of the on-going low-variability period. Such a scaling law has been previously predicted theoretically [R. …

2008-12-24abs ↗pdf ↗

The paper examines the unexpected losses and risk ratios for co-monotonic alternatives in large portfolios.

problem Understanding the unexpected losses and risk ratios for large portfolios with co-monotonic alternatives.
method Analyzes the asymptotic behavior of unexpected losses and risk ratios for co-monotonic alternatives using monotone cash-additive risk measures and Choquet insurance premia.
result Unexpected losses of large weighted portfolios are of order o(nλn)o(n\overlineλ_n), where λn\overlineλ_n is the average weight.

We suggest an analytical approach for Pareto-Zipf law, where we assume random multiplicative noise and fragmentation processes for the growth of the number of citizens of each city and the number of the cities, respectively.

2008-02-27abs ↗pdf ↗

The study improves bounds on the number of closed geodesics and logarithmic improvements in the Weyl law.

problem Estimating the number of closed geodesics and improving logarithmic bounds in the Weyl law.
method Study of non-degeneracy properties of nearly closed orbits for predominant sets of metrics.
result Logarithmic improvements in the Weyl law and exponential bounds on the number of closed geodesics.