Efficient Concentration with Gaussian Approximation
read the original abstract
Concentration inequalities for the sample mean, like those due to Bernstein, Hoeffding, and Bentkus, are valid for any sample size but overly conservative, yielding confidence intervals that are unnecessarily wide. The central limit theorem (CLT) provides asymptotic confidence intervals with optimal width, but these are invalid for all sample sizes. To resolve this tension, we develop new computable concentration inequalities for bounded variables with asymptotically optimal size, finite-sample validity, and sub-Gaussian decay. These bounds enable the construction of efficient confidence intervals with correct coverage for any sample size and efficient empirical Berry-Esseen bounds that require no prior knowledge of the population variance. We derive our inequalities by tightly bounding non-uniform Kolmogorov and Wasserstein distances to a Gaussian using zero-bias couplings and Stein's method of exchangeable pairs and demonstrate practical improvements over the Bernstein, Hoeffding, Bentkus, Berry-Esseen, Feller-Cram\'er, Romano-Wolf, empirical Bernstein, empirical Bentkus, and coin-betting inequalities.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Computable Bounds for Strong Approximations with Applications
The paper supplies computable KMT-type bounds for bounded i.i.d. sums that depend only on range and variance (or an empirical estimate), plus a moderate-deviation byproduct.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.