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

88176263351 · May 202619922001200920172026
48 results for statistical theorems

The paper proves formulas and theorems for statistical de Rham Hodge operators on manifolds with boundary.

problem Formulating Lichnerowicz type formulas and Kastler-Kalau-Walze theorems for statistical de Rham Hodge operators.
method Developed Lichnerowicz type formulas and proved Kastler-Kalau-Walze type theorems for statistical de Rham Hodge operators on compact manifolds with boundary.
result Proved Lichnerowicz type formulas and Kastler-Kalau-Walze type theorems for statistical de Rham Hodge operators on compact manifolds with boundary.

Chentsov's theorem characterizes the Fisher information metric on statistical models as essentially the only Riemannian metric that is invariant under sufficient statistics. This implies that each statistical model is naturally equipped with a geometry, so Chentsov's theorem explains why many statistical properties can…

2017-01-31abs ↗pdf ↗

Geodesic connectedness proved for statistical manifolds with divisible cubic forms.

problem Geodesic connectedness of affine connections on statistical manifolds with divisible cubic forms.
method Analogy with Hopf-Rinow theorem in Riemannian geometry, establishing geodesic completeness.
result Geodesic connectedness established for statistical manifolds with divisible cubic forms.

The main aim of this paper is to extend Bochner's technique to statistical structures. Other topics related to this technique are also introduced to the theory of statistical structures. It deals, in particular, with Hodge's theory, Bochner-Weitzenbock and Simon's type formulas. Moreover, a few global and local theorem…

2015-04-23abs ↗pdf ↗

We clarify measurability assumptions in the agnostic PAC learning theorem.

problem Measurability assumptions in the Fundamental Theorem of Statistical Learning.
method Measure-theoretic scrutiny of existing proofs to extract minimal assumptions.
result Sound statement and detailed proof of the Fundamental Theorem in the agnostic setting.

Abstract mathematical formulas for statistical structures and curvatures.

problem Developing formulas for statistical structures and curvatures.
method Proving new formulas and theorems for statistical structures and curvatures.
result Generalized formulas for statistical structures and curvatures.

Study on lightlike submanifolds in statistical manifold geometry.

problem Characterizing contact CR and SCR-lightlike submanifolds.
method Developed characterization theorems on integrability and geodesicity.
result Obtained results on geometry of contact CR and SCR-lightlike submanifolds.

Promotes spectral functionals to noncommutative fields and proves a theorem.

problem Spectral functionals on noncommutative fields and manifolds with boundary.
method Carries out promotion to spectral functionals, associates with noncommutative residue, and proves theorem.
result Proves Dabrowski-Sitarz-Zalecki type theorem for statistical de Rham Hodge operators on manifolds with boundary.

We prove the eventological HH-theorem that complements the Boltzmann H-theorem from statistical mechanics and serves as a mathematical excuse (mathematically no less convincing than the Boltzmann H-theorem for the second law of thermodynamics) for what can be called "the second law of eventology", which justifies the …

2018-09-19abs ↗pdf ↗

This paper strengthens the central limit theorem for order statistics using relative entropy.

problem Establishing a stronger mode of convergence for central limit behavior of order statistics.
method Using relative entropy to ensure a stronger mode of convergence for central limit behavior of order statistics.
result An order O(1/n)O(1/\sqrt{n}) rate of convergence is established under mild conditions.

Study smooth linear statistics on random covers of hyperbolic surfaces, showing central limit and variance results.

problem Analyzing fluctuations and energy variance of random covers of compact hyperbolic surfaces.
method Examining fluctuations in a small energy window around a fixed energy level, considering the variance of a typical surface, using a double limit where nn and LL go to infinity.
result Distribution of fluctuations tends to a Gaussian with variance of GOE/GUE, and energy variance of a typical random nn-cover is that of GOE/GUE.

The study proves a central limit theorem for Gaussian holomorphic sections on Kähler manifolds.

problem Understanding statistical properties of zeros of random holomorphic sections.
method Proves a central limit theorem for smooth linear statistics of zero divisors of Gaussian sections in line bundles over Kähler manifolds.
result Derives first-order asymptotics and upper decay estimates for Bergman kernels.

This paper is a study of almost contact statistical manifolds. Especially this study is focused on almost cosymplectic statistical manifolds. We obtained basic properties of such manifolds. It is proved a characterization theorem and a corollary for the almost cosymplectic statistical manifold with Kaehler leaves. We a…

2018-01-30abs ↗pdf ↗

Study on statistical inference for nonlinear stochastic approximation with Markovian data.

problem Statistical inference for nonlinear stochastic approximation algorithms with Markovian data.
method Established a functional central limit theorem for the partial-sum process of the target parameter estimate, providing asymptotic pivotal statistics for constructing confidence intervals.
result Valid and efficient asymptotic inference method for nonlinear stochastic approximation algorithms with Markovian data.

Study improves understanding of why agentic theorem provers succeed.

problem Understanding which components of agentic theorem provers improve proof success.
method Statistical provability theory and finite-horizon reachability MDP model.
result Bounds provability gap and explains components' effectiveness.

Differential privacy is a statistical concept that can be explained through hypothesis testing.

problem Formalizing differential privacy as a statistical concept.
method Using David Blackwell's informativeness theorem, the paper shows differential privacy can be understood through hypothesis testing.
result The definition of ff-differential privacy provides a unified framework for analyzing privacy bounds.

Unified framework for statistical inference in gradient boosting regression.

problem Challenges in statistical inference and uncertainty quantification for gradient boosting.
method Integrates dropout or parallel training with regularization for CLT in boosting.
result Increasing dropout rate and parallel trees enhances signal recovery and performance.

In this paper, we consider formal series associated with events, profiles derived from events, and statistical models that make predictions about events. We prove theorems about realizations for these formal series using the language and tools of Hopf algebras.

2009-01-18abs ↗pdf ↗

This paper analyzes Local SGD for federated learning, achieving both statistical and communication efficiency.

problem Statistical estimation and inference in federated learning with decentralized data.
method Local SGD, a multi-round estimation procedure using intermittent communication.
result Local SGD achieves both statistical efficiency and communication efficiency.

High-dimensional U-statistics show surprising phase transitions, impacting kernel-based tests.

problem Understanding phase transitions in high-dimensional U-statistics.
method Proved a convergence theorem for U-statistics of degree two in high dimensions.
result High-dimensional U-statistics can have non-Gaussian limits with larger variance and asymmetry.

New integral theorems improve density function estimations.

problem Improving density function estimations.
method Integrals based on cyclic functions and Riemann sums, Fourier integral theorem, Monte Carlo methods, variational approach, Cauchy residue theorem.
result Optimal cyclic functions minimize square integrals, improving density estimations.

The rectified flow method is analyzed for its statistical properties.

problem Theoretical support for rectified flow methods is lacking.
method Empirical analysis of rectified flow's statistical properties using regression and density estimation.
result Convergence rates for rectified flow estimators are faster than for nonparametric regression and density estimation.

New method for zeroth-order stochastic gradient algorithms provides confidence intervals.

problem Lack of inferential capabilities for zeroth-order stochastic gradient algorithms.
method Established central limit theorem and provided online estimators for asymptotic covariance matrix.
result Asymptotically valid confidence sets for parameter estimation and prediction.

The paper derives statistics of multi-factor functions from their Fourier transforms.

problem Deriving statistics of multi-factor functions from Fourier transforms.
method Developed an m-Coefficient/Index Annihilation Theorem to analyze the moments of a function from its Fourier transform.
result The mth moment of a function becomes a series of terms, each with precisely m Fourier coefficients, and the indices sum to zero.

The paper uses Fourier integral theorem for estimating multivariate distributions.

problem Estimating multivariate distributions and conditional distribution functions.
method Natural Monte Carlo and fully nonparametric estimators based on Fourier integral theorem.
result Explicit Monte Carlo estimators without estimated covariance matrix.

We consider the question of learning in general topological vector spaces. By exploiting known (or parametrized) covariance structures, our Main Theorem demonstrates that any continuous linear map corresponds to a certain isomorphism of embedded Hilbert spaces. By inverting this isomorphism and extending continuously, …

2014-05-01abs ↗pdf ↗

Stochastic gradient descent in continuous time (SGDCT) provides a computationally efficient method for the statistical learning of continuous-time models, which are widely used in science, engineering, and finance. The SGDCT algorithm follows a (noisy) descent direction along a continuous stream of data. The parameter …

2017-10-11abs ↗pdf ↗

Geometric regularisation improves statistical models by avoiding degeneracy loci.

problem Non-identifiability, singular information, and moment indeterminacy in statistical models.
method Develops the geometric regularisation of distribution-kernel pairs (T,φ)(T, \varphi) using Whitney, Thom, and Mather theorems.
result Finite-dimensional weak transversality theorem for generic kernels, avoiding degeneracy strata of high codimension.

Paper examines constant stepsize in LSA for Markovian data inference.

problem Improving statistical inference with constant stepsize in LSA for Markovian data.
method Established CLT, used averaged LSA iterates, applied Richardson-Romberg extrapolation.
result Constant stepsize leads to better CI coverage, especially with limited data.

Develops a new trading strategy for statistical arbitrage with path-dependent signals.

problem Optimal execution in statistical arbitrage strategies with dynamic predictive signals.
method Signature-based framework modeling alpha and trading speed as linear functionals of truncated signature of market path.
result Fitted policy achieves higher return on turnover compared to a z-score benchmark.

The paper proposes a method to infer Q-values online with Q-Learning.

problem High variance and instability in reinforcement learning algorithms.
method Adapting FCLT for a modified Q-learning approach and constructing confidence intervals.
result The proposed method provides more stable and reliable inference of Q-values.

New approach to quantify posterior concentration rates using Wasserstein dynamics.

problem Quantifying the speed of posterior distribution concentration in Bayesian statistics.
method Combining local Lipschitz-continuity with dynamic formulation of Wasserstein distance.
result Optimal posterior contraction rates in finite and infinite-dimensional models.

Paper proves a Central Limit Theorem for Random Forest Permutation Importance Measure.

problem Lack of theoretical analysis of Random Forest Permutation Importance Measure (RFPIM).
method Formal proof using U-Statistics theory, deviating from conventional Random Forest model.
result Established a Central Limit Theorem for RFPIM.