English
Related papers

Related papers: Concentration inequalities for dependent Random va…

200 papers

Stein's method for concentration inequalities was introduced to prove concentration of measure in problems involving complex dependencies such as random permutations and Gibbs measures. In this paper, we provide some extensions of the…

Probability · Mathematics 2010-11-11 Sourav Chatterjee , Partha S. Dey

As an alternative to the well-known methods of "chaining" and "bracketing" that have been developed in the study of random fields, a new method, which is based on a stochastic maximal inequality derived by using It\^o's formula and on a new…

Probability · Mathematics 2016-02-12 Yoichi Nishiyama

We introduce a version of Stein's method for proving concentration and moment inequalities in problems with dependence. Simple illustrative examples from combinatorics, physics, and mathematical statistics are provided.

Probability · Mathematics 2007-05-23 Sourav Chatterjee

Concentration bounds for non-product, non-Haar measures are fairly recent: the first such result was obtained for contracting Markov chains by Marton in 1996 via the coupling method. The work that followed, with few exceptions, also used…

Probability · Mathematics 2012-07-10 Leonid , Kontorovich

We consider the stochastic integrals of multivariate point processes and study their concentration phenomena. In particular, we obtain a Bernstein type of concentration inequality through Dol\'eans-Dade exponential formula and a uniform…

Probability · Mathematics 2017-03-24 Hanchao Wang , Zhengyan Lin , Zhonggen Su

We obtain a Bernstein type Gaussian concentration inequality for martingales. Our inequality improves the Azuma-Hoeffding inequality for moderate deviations $x$. Following the work of McDiarmid (1989), Talagrand (1996) and Boucheron, Lugosi…

Probability · Mathematics 2017-10-17 Xiequan Fan

This paper gives new concentration inequalities for the spectral norm of a wide class of matrix martingales in continuous time. These results extend previously established Freedman and Bernstein inequalities for series of random matrices to…

Probability · Mathematics 2016-10-28 Emmanuel Bacry , Stéphane Gaïffas , Jean-François Muzy

The work [8] established memory loss in the time-dependent (non-random) case of uniformly expanding maps of the interval. Here we find conditions under which we have convergence to the normal distribution of the appropriately scaled…

Dynamical Systems · Mathematics 2016-03-25 Peter Nandori , Domokos Szasz , Tamas Varju

We develop a class of exponential bounds for the probability that a martingale sequence crosses a time-dependent linear threshold. Our key insight is that it is both natural and fruitful to formulate exponential concentration inequalities…

Probability · Mathematics 2025-12-18 Steven R. Howard , Aaditya Ramdas , Jon McAuliffe , Jasjeet Sekhon

The goal of this paper is to go further in the analysis of the behavior of the number of descents in a random permutation. Via two different approaches relying on a suitable martingale decomposition or on the Irwin-Hall distribution, we…

Probability · Mathematics 2024-11-20 Bernard Bercu , Michel Bonnefont , Adrien Richou

Matrix concentration inequalities provide a direct way to bound the typical spectral norm of a random matrix. The methods for establishing these results often parallel classical arguments, such as the Laplace transform method. This work…

Information Theory · Computer Science 2014-04-29 Joel A. Tropp , Richard Y. Chen

This paper derives confidence intervals (CI) and time-uniform confidence sequences (CS) for the classical problem of estimating an unknown mean from bounded observations. We present a general approach for deriving concentration bounds, that…

Statistics Theory · Mathematics 2022-08-29 Ian Waudby-Smith , Aaditya Ramdas

We derive a new maximal inequality for stationary sequences under a martingale-type condition introduced by Maxwell and Woodroofe [Ann. Probab. 28 (2000) 713-724]. Then, we apply it to establish the Donsker invariance principle for this…

Probability · Mathematics 2007-05-23 Magda Peligrad , Sergey Utev

We use the abstract method of (local) martingale problems in order to give criteria for convergence of stochastic processes. Extending previous notions, the formulation we use is neither restricted to Markov processes (or semimartingales),…

Probability · Mathematics 2021-08-27 David Criens , Peter Pfaffelhuber , Thorsten Schmidt

Concentration inequalities are widely used for analyzing machine learning algorithms. However, current concentration inequalities cannot be applied to some of the most popular deep neural networks, notably in natural language processing.…

Machine Learning · Statistics 2021-03-22 Rémy Garnier , Raphaël Langhendries

This paper develops a general concentration inequality for the suprema of empirical processes with dependent data. The concentration inequality is obtained by combining generic chaining with a coupling-based strategy. Our framework…

Econometrics · Economics 2026-02-23 Chiara Amorino , Christian Brownlees , Ankita Ghosh

We give concentration bounds for martingales that are uniform over finite times and extend classical Hoeffding and Bernstein inequalities. We also demonstrate our concentration bounds to be optimal with a matching anti-concentration…

Probability · Mathematics 2015-12-03 Akshay Balsubramani

We present a set of high-probability inequalities that control the concentration of weighted averages of multiple (possibly uncountably many) simultaneously evolving and interdependent martingales. Our results extend the PAC-Bayesian…

Machine Learning · Computer Science 2012-07-31 Yevgeny Seldin , François Laviolette , Nicolò Cesa-Bianchi , John Shawe-Taylor , Peter Auer

If a random variable is not exponentially integrable, it is known that no concentration inequality holds for an infinite sequence of independent copies. Under mild conditions, we establish concentration inequalities for finite sequences of…

Probability · Mathematics 2007-05-23 Franck Barthe , Patrick Cattiaux , Cyril Roberto

We establish concentration inequalities for random dynamical systems (RDSs), assuming that the observables of interest are separately Lipschitz. Under a weak average contraction condition, we obtain deviation bounds for several random…

Dynamical Systems · Mathematics 2026-03-24 Graccyela Salcedo