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

Trend · papers per month

1.6%3.3%4.9%6.5% · May 202619922001200920172026
48 results for finite-sample deviation

The paper provides a finite-sample deviation bound for stable autoregressive processes.

problem Deviation bounds for least squares estimators in Gaussian AR(n) processes.
method Utilizes martingale concentration inequalities and tail-bound for χ² distributed variables.
result Problem-dependent finite-time bound on the deviation probability of AR(n) process parameters.

The paper improves generative models to avoid replicating observed examples.

problem Improving generative models to avoid replicating observed examples.
method Theoretical insights into the Wasserstein GAN, constrained to left-invertible push-forward maps, generating distributions that avoid replication and significantly deviate from the empirical distribution.
result Left-invertibility achieves this without compromising statistical optimality.

Paper provides finite-sample guarantees for Wasserstein DRO without dimensionality curse.

problem Tackles empirical success of Wasserstein DRO in operations and ML with performance guarantees.
method Develops non-asymptotic framework for analyzing out-of-sample performance and generalization bound.
result First finite-sample guarantee for generic Wasserstein DRO problems without curse of dimensionality.

New method predicts state evolution for non-first-order algorithms on nonconvex problems.

problem Analyzing nonconvex optimization problems with random data.
method Developed a state evolution for a broader class of algorithms including first-order and saddle point updates.
result Established rigorous state evolution predictions and finite-sample guarantees for non-first-order methods.

Study on discrepancy principle for learning algorithms in nonparametric regression.

problem Determining optimal iteration number in nonparametric regression with unknown optimal iteration.
method Investigates discrepancy principle and modified principles for kernelized spectral filters, using deviation inequalities and change-of-norm arguments.
result Classical discrepancy principle is adaptive for slow rates, while modified principles are adaptive for faster rates.

Paper improves variational inference for complex models.

problem Improving statistical accuracy of variational inference in high-dimensional models.
method Developed a general framework for MFVI and proposed a partially grouped VI algorithm.
result Proposed algorithm works and outperforms vanilla MFVI in mixed membership stochastic blockmodel.

The paper improves PCS approximation for ranking and selection under limited simulation budgets.

problem Improving finite sample performance in Ranking and Selection.
method Develops a Bahadur-Rao type expansion for PCS, proposes a novel FCBA policy.
result FCBA policy achieves superior PCS performance compared to traditional methods.

Rank-statistic method approximates ff-divergences without density-ratio estimation.

problem Approximating ff-divergences without explicit density-ratio estimation.
method Mapping distribution rank histograms to discrete ff-divergence and averaging over random projections.
result The rank-statistic estimator is a lower bound of the true ff-divergence and converges under mild conditions.

Improved conformal prediction for better conditional coverage of classifier predictions.

problem Achieving exact conditional coverage in finite samples for prediction sets.
method Developed a variant of conformal prediction targeting coverage conditional on confidence and trust score.
result Empirically improved conditional coverage properties compared to standard conformal prediction.

The study provides a theory for causal machine learning with generalization bounds.

problem Lack of theoretical guarantees for causal machine learning algorithms.
method Introduces a novel change-of-measure inequality to bound model loss.
result Tight bounds on model loss in terms of treatment propensities deviation.

Improved concentration inequalities for sub-Weibull variables enhance statistical and machine learning applications.

problem Improving concentration inequalities for sub-Weibull random variables.
method Developed new concentration inequalities for sums of independent sub-Weibull random variables, including a new sub-Weibull parameter.
result New concentration inequalities with sharper constants and a mixture of sub-Gaussian and sub-Weibull tails.

Unified stopping rules ensure accurate policies in contextual learning.

problem Stopping data collection to ensure accurate policies in personalized decision problems.
method Developed unified stopping rules based on GLR statistics for pairwise action comparisons.
result Unified stopping rules achieve target precision with fewer samples than benchmarks.

Gradient descent converges to a small neighborhood of the true parameter in logistic regression with Gaussian design.

problem Estimating the parameter in logistic regression with Gaussian design.
method Gradient descent with small stepsize and large stepsize, using approximate invertibility condition and eigenvalue analysis.
result Gradient descent achieves an 2\ell_2 error of order O(θ25d/n)O(\sqrt{\|θ^*\|_2^5d/n}).

KRCD detects unobserved confounders in nonlinear observational data.

problem Detecting unobserved confounders in nonlinear observational studies.
method Kernel Regression Confounder Detection (KRCD) using reproducing kernel Hilbert spaces.
result KRCD outperforms existing methods and achieves superior computational efficiency.

Study large deviations for hypoelliptic diffusion on sub-Riemannian manifolds.

problem Large deviations for hypoelliptic diffusion measures on sub-Riemannian manifolds.
method Rough path theory and manifold-valued Malliavin calculus.
result Proved a large deviation principle for pinned hypoelliptic diffusion measures.

This paper analyzes momentum Q-learning with finite-sample guarantees.

problem Improving Q-learning performance with momentum schemes.
method Proposes MomentumQ algorithm integrating Nesterov and Polyak's momentum schemes, analyzes convergence for function approximations.
result Establishes finite-sample convergence rates for MomentumQ, demonstrating better performance than vanilla Q-learning.

We provide a unifying treatment of pathwise moderate deviations for models commonly used in financial applications, and for related integrated functionals. Suitable scaling allows us to transfer these results into small-time, large-time and tail asymptotics for diffusions, as well as for option prices and realised vari…

2018-03-12abs ↗pdf ↗

Study on financial systems using perturbed unimodal maps with heteroscedastic noise.

problem Analyzing systemic risk in financial systems using mathematical models.
method Investigation of one-dimensional unimodal maps perturbed by heteroscedastic noise, proving stability, convergence, and Lyapunov exponent continuity.
result Continuous dependence of average Lyapunov exponent on Markov chain parameters, and Gumbel's law for extreme values.

Importance sampling has become an important tool for the computation of tail-based risk measures. Since such quantities are often determined mainly by rare events standard Monte Carlo can be inefficient and importance sampling provides a way to speed up computations. This paper considers moderate deviations for the wei…

2013-06-27abs ↗pdf ↗

Estimates class prior for unlabeled data using kernel embedding.

problem Estimating class prior in PU learning scenario where only positive and full population samples are available.
method Direct estimator based on distribution matching and kernel embedding in Reproducing Kernel Hilbert Space.
result Asymptotic consistency and explicit deviation bound for the estimator.

Connections between Lie derivatives and the deviation equation has been investigated in spaces with affine connection. The deviation equations of the geodesics as well as deviation equations of non-geodesics trajectories have been obtained on this base. This is done via imposing certain conditions on the Lie derivative…

2005-12-01abs ↗pdf ↗

Deviation inequalities and limit laws for random walks on metric spaces.

problem Understanding random walks on metric spaces with contracting isometries.
method Adapting Gouëzel's pivotal time construction to establish deviation inequalities.
result Exponential bounds and limit laws for random walks on mapping class groups and CAT(0) spaces.

Let MM be a smooth manifold and S\mathcal{S} a semi-spray defined on a sub-bundle C\mathcal{C} of the tangent bundle TMTM. In this work it is proved that the only non-trivial kk-jet approximation to the exact geodesic deviation equation of S\mathcal{S}, linear on the deviation functions and invariant under an spec…

2013-01-27abs ↗pdf ↗

Paper analyzes Greedy-GQ for reinforcement learning with Markovian noise.

problem Analyzing Greedy-GQ for reinforcement learning with Markovian noise.
method Develops finite-sample analysis for Greedy-GQ with linear function approximation under Markovian noise.
result Provides theoretical justification for choosing stepsizes for faster convergence.

Large deviations theory applied to policy gradient methods.

problem Understanding convergence of policy gradient methods in reinforcement learning.
method Large deviation rate function and contraction principle from large deviations theory.
result Convergence properties of policy gradient methods can be extended to various policy parametrizations.

Study examines large deviations in random walks on hyperbolic spaces.

problem Large deviations in random walks on Gromov-hyperbolic spaces.
method Established large deviations results for distance and translation length of random walks.
result Deduced a special case of a conjecture regarding spectral radii of random matrix products.