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

8.3%16.7%25.0%33.3% · Jul 199219922001200920172026
48 results for deviation bounds

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.

In this paper, we study the risk bounds for samples independently drawn from an infinitely divisible (ID) distribution. In particular, based on a martingale method, we develop two deviation inequalities for a sequence of random variables of an ID distribution with zero Gaussian component. By applying the deviation ineq…

2012-02-14abs ↗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.

Researchers introduce a method to assess the safety of interpretable machine learning models.

problem Ensuring safety in machine learning models that are easy to understand.
method Introduce maximum deviation as an optimization problem to find the largest deviation from a safe reference model.
result Interpretability helps in assessing the safety of machine learning models.

Uniform deviation bounds limit the difference between a model's expected loss and its loss on an empirical sample uniformly for all models in a learning problem. As such, they are a critical component to empirical risk minimization. In this paper, we provide a novel framework to obtain uniform deviation bounds for loss…

2017-02-27abs ↗pdf ↗

This article provides a new toolbox to derive sparse recovery guarantees from small deviations on extreme singular values or extreme eigenvalues obtained in Random Matrix Theory. This work is based on Restricted Isometry Constants (RICs) which are a pivotal notion in Compressed Sensing and High-Dimensional Statistics a…

2016-04-05abs ↗pdf ↗

Novel concentration inequalities are obtained for the missing mass, i.e. the total probability mass of the outcomes not observed in the sample. We derive distribution-free deviation bounds with sublinear exponents in deviation size for missing mass and improve the results of Berend and Kontorovich (2013) and Yari Saeed…

2015-03-20abs ↗pdf ↗

Large deviation principle for deep neural networks with ReLU activation.

problem Understanding the behavior of deep neural networks with ReLU activation.
method Proving a large deviation principle for networks with Gaussian weights and ReLU activation functions.
result Simplified expressions and power-series expansions for the ReLU case.

Study on U-statistics with heavy-tailed samples, providing tail bounds and LDP.

problem Deviation of U-statistics with heavy-tailed samples.
method Exponential tail bounds and Large Deviation Principle (LDP) for U-statistics.
result Obtained an exponential upper bound for U-statistics tail decay, showing two regions of decay.

The paper provides a new uniform tail bound for empirical processes.

problem Developing a uniform tail bound for empirical processes indexed by a class of functions.
method Introducing a deflation step to the standard generic chaining argument, and using a natural seminorm based on Cramér functions.
result Established a new uniform tail bound for empirical processes.

The paper improves inequalities for nearly spherical sets using quermassintegrals.

problem Improving inequalities for nearly spherical sets.
method Establishing quantitative Alexandrov-Fenchel inequalities for quermassintegrals.
result Lower bounds on the (k,m)(k,m)-isoperimetric deficit found using spherical deviation and asymmetry.

Sharp bounds for Dirichlet sums lead to improved Bayesian algorithm analysis.

problem Improving Bayesian algorithm performance through precise deviation bounds.
method Novel integral representation of Dirichlet sum density, Gaussian approximation, complex analysis.
result Significantly sharpened regret bounds for Multinomial Thompson Sampling.

We prove a Weyl-type fractal upper bound for the spectrum of the damped wave equation, on a negatively curved compact manifold. It is known that most of the eigenvalues have an imaginary part close to the average of the damping function. We count the number of eigenvalues in a given horizontal strip deviating from this…

2009-04-10abs ↗pdf ↗

This paper achieves optimal regret bounds for locally private linear contextual bandit.

problem Designing locally private linear contextual bandit algorithms with optimal regret bounds.
method New algorithmic and analytical ideas, including mean absolute deviation analysis and layered principal component regression.
result Achieves an ildeO(T) ilde O(\sqrt{T}) regret upper bound for locally private linear contextual bandit.

Improved bounds for Monte Carlo Rademacher Averages using self-bounding functions.

problem Proving sharper concentration bounds for MCERA.
method Deriving new bounds through self-bounding functions and concentration of measure.
result Novel bounds depend on data-dependent quantities, improving over standard methods.

We study two-layer belief networks of binary random variables in which the conditional probabilities Pr[childlparents] depend monotonically on weighted sums of the parents. In large networks where exact probabilistic inference is intractable, we show how to compute upper and lower bounds on many probabilities of intere…

2013-01-30abs ↗pdf ↗

The paper provides bounds for high-dimensional U-statistics with novel order-explicit inequalities.

problem Bounding the deviation of high-dimensional U-statistics from their Hájek projections.
method Develops novel order-explicit moment inequalities for higher-order Hoeffding components.
result The maximum deviation of a high-dimensional U-statistic from its Hájek projection is of order Op(φbn1log2(dn))O_p(φb n^{-1}\log^2(dn)).

Random walks on hyperbolic spaces follow predictable large deviation principles.

problem Understanding the behavior of random walks on hyperbolic spaces.
method Large deviation principles for displacement and translation distances.
result Translation and displacement distances satisfy large deviation principles with the same rate function.

We study utility indifference prices and optimal purchasing quantities for a non-traded contingent claim in an incomplete semi-martingale market with vanishing hedging errors. We make connections with the theory of large deviations. We concentrate on sequences of semi-complete markets where in the nthn^{th} market, the …

2014-10-01abs ↗pdf ↗

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.

Suppose kk centers are fit to mm points by heuristically minimizing the kk-means cost; what is the corresponding fit over the source distribution? This question is resolved here for distributions with p4p\geq 4 bounded moments; in particular, the difference between the sample cost and distribution cost decays with $…

2013-11-08abs ↗pdf ↗

This paper introduces a new bound to explain generalization in over-parameterized models.

problem Understanding why some over-parameterized models generalize well while others do not.
method PAC-Chernoff bounds and smoothness measures based on large deviation theory.
result Interpolators with smoother structures generalize better, according to the new theoretical framework.

Optimal adaptive experiment for choosing best treatment with binary outcomes.

problem Choosing the best treatment from binary options in an adaptive experiment.
method Adaptive experiment with two phases: treatment allocation and choice. Neyman allocation method used.
result Neyman allocation is minimax and Bayes optimal, matching lower bounds for regret.

We analyze cross-correlations between price fluctuations of different stocks using methods of random matrix theory (RMT). Using two large databases, we calculate cross-correlation matrices C of returns constructed from (i) 30-min returns of 1000 US stocks for the 2-yr period 1994--95 (ii) 30-min returns of 881 US stock…

2001-08-01abs ↗pdf ↗

Sharp large deviations and Gibbs conditioning for portfolio credit risk models.

problem Analyzing the risk of default in financial portfolios with dependent factors.
method Sharp large deviation estimates and conditional Bahadur-Rao estimates for threshold models with diverging latent factors.
result Conditioned on a large exceedance event, default indicators become asymptotically i.i.d., and loss-given-default is exponentially tilted.

We are concerned with obtaining novel concentration inequalities for the missing mass, i.e. the total probability mass of the outcomes not observed in the sample. We not only derive - for the first time - distribution-free Bernstein-like deviation bounds with sublinear exponents in deviation size for missing mass, but …

2015-03-10abs ↗pdf ↗

Paper extends nonparametric regression bounds for dependent β\beta-mixing samples.

problem Analyzing error in nonparametric regression with dependent data.
method Extends uniform deviation inequalities from independent to dependent β\beta-mixing samples.
result Derives generalization bounds for nonparametric regression with dependent data.

Improved adaptive algorithms for identifying the best arm in MABs with fixed budget.

problem Identifying the best arm in stochastic Multi-Armed Bandits with a fixed sampling budget.
method Established a connection between Large Deviation Principles and adaptive algorithms, improving error probability bounds and devising new algorithms.
result The \sred algorithm outperforms existing algorithms in identifying the best arm.