English
Related papers

Related papers: Exponential Concentration Inequalities For Indepen…

200 papers

Despite the remarkable empirical success of score-based diffusion models, their statistical guarantees remain underdeveloped. Existing analyses often provide pessimistic convergence rates that do not reflect the intrinsic low-dimensional…

Machine Learning · Statistics 2026-04-24 Saptarshi Chakraborty , Quentin Berthet , Peter L. Bartlett

We prove that quadratic forms in isotropic random vectors $X$ in $\mathbb{R}^n$, possessing the convex concentration property with constant $K$, satisfy the Hanson-Wright inequality with constant $CK$, where $C$ is an absolute constant,…

Probability · Mathematics 2014-10-01 Radosław Adamczak

We present Hoeffding-type and Bernstein-type inequalities for right-censored data. The inequalities bound the difference between an inverse of the probability of censoring weighting (IPCW) estimator and its expectation. We first discuss the…

Statistics Theory · Mathematics 2019-03-07 Yair Goldberg

To quantify the dependence between two random vectors of possibly different dimensions, we propose to rely on the properties of the 2-Wasserstein distance. We first propose two coefficients that are based on the Wasserstein distance between…

Statistics Theory · Mathematics 2021-10-19 Gilles Mordant , Johan Segers

In this note, we derive concentration inequalities for random vectors with subGaussian norm (a generalization of both subGaussian random vectors and norm bounded random vectors), which are tight up to logarithmic factors.

Probability · Mathematics 2019-02-12 Chi Jin , Praneeth Netrapalli , Rong Ge , Sham M. Kakade , Michael I. Jordan

Let $X_1,\dots,X_n$ be i.i.d. log-concave random vectors in $\mathbb R^d$ with mean 0 and covariance matrix $\Sigma$. We study the problem of quantifying the normal approximation error for $W=n^{-1/2}\sum_{i=1}^nX_i$ with explicit…

Probability · Mathematics 2023-05-30 Xiao Fang , Yuta Koike

Concentration inequalities are fundamental tools in probabilistic combinatorics and theoretical computer science for proving that random functions are near their means. Of particular importance is the case where f(X) is a function of…

Combinatorics · Mathematics 2022-06-01 Lutz Warnke

We show that the Bernstein-Hoeffding method can be employed to a larger class of generalized moments. This class includes the exponential moments whose properties play a key role in the proof of a well-known inequality of Wassily Hoeffding,…

Probability · Mathematics 2015-09-02 Christos Pelekis , Jan Ramon , Yuyi Wang

For any integer $m<n$, where $m$ can depend on $n$, we study the rate of convergence of $\frac{1}{\sqrt{m}}\mathrm{Tr} \mathbf{U}^m$ to its limiting Gaussian as $n\to\infty$ for orthogonal, unitary and symplectic Haar distributed random…

Probability · Mathematics 2022-04-08 Klara Courteaut , Kurt Johansson , Gaultier Lambert

We prove exponential concentration in i.i.d. first-passage percolation in $Z^d$ for all $d \geq 2$ and general edge-weights $(t_e)$. Precisely, under an exponential moment assumption $E e^{\alpha t_e}< \infty$ for some $\alpha>0$) on the…

Probability · Mathematics 2014-11-27 Michael Damron , Jack Hanson , Philippe Sosoe

We present a new method for proving the norm concentration inequality of sub-Gaussian variables. Our proof is based on an averaged version of the moment generating function, termed the averaged moment generating function. Our method applies…

Probability · Mathematics 2025-05-12 Zishun Liu , Sam Power , Yongxin Chen

We study properties of a sample covariance estimate $\widehat \Sigma$ given a finite sample of $n$ i.i.d. centered random elements in $\R^d$ with the covariance matrix $\Sigma$. We derive dimension-free bounds on the squared Frobenius norm…

Probability · Mathematics 2024-09-09 Nikita Puchkin , Fedor Noskov , Vladimir Spokoiny

It is shown that certain ensembles of random matrices with entries that vanish outside a band around the diagonal satisfy a localization condition on the resolvent which guarantees that eigenvectors have strong overlap with a vanishing…

Mathematical Physics · Physics 2010-06-29 Jeffrey Schenker

Chatterjee (2016) proved, as an application of his general framework relating superconcentration and chaos, that after the entries of an $n \times n$ matrix drawn from the Gaussian unitary ensemble undergo an entrywise Ornstein-Uhlenbeck…

Probability · Mathematics 2026-02-19 Xiangyi Zhu , Dmitriy Kunisky

The Hanson-Wright inequality establishes exponential concentration for quadratic forms $X^T M X$, where $X$ is a vector with independent sub-Gaussian entries and with parameters depending on the Frobenius and operator norms of $M$. The most…

Probability · Mathematics 2025-09-03 Ingvar Ziemann

We prove extensions of classical concentration inequalities for random variables which have $\alpha$-subexponential tail decay for any $\alpha \in (0,2]$. This includes Hanson--Wright type and convex concentration inequalities. We also…

Probability · Mathematics 2022-12-09 Holger Sambale

A concentration result for quadratic form of independent subgaussian random variables is derived. If the moments of the random variables satisfy a "Bernstein condition", then the variance term of the Hanson-Wright inequality can be…

Statistics Theory · Mathematics 2019-01-28 Pierre C Bellec

We use here a particle system to prove a convergence result as well as a deviation inequality for solutions of granular media equation when the confinement potential and the interaction potential are no more uniformly convex. Proof is…

Probability · Mathematics 2007-05-23 Patrick Cattiaux , Guillin Arnaud , Malrieu Florent

We establish in-expectation and tail bounds on the generalization error of representation learning type algorithms. The bounds are in terms of the relative entropy between the distribution of the representations extracted from the training…

Machine Learning · Statistics 2025-03-21 Milad Sefidgaran , Abdellatif Zaidi , Piotr Krasnowski

In this paper, explicit error bounds are derived in the approximation of rank $k$ projections of certain $n$-dimensional random vectors by standard $k$-dimensional Gaussian random vectors. The bounds are given in terms of $k$, $n$, and a…

Probability · Mathematics 2007-06-07 Elizabeth Meckes