no. 16 · Tuesday 17 November 2026
Sharp High-Dimensional Gaussian Approximations over Rectangles without Covariance Restrictions
Abstract
We study how well a sum of $n$ independent random vectors with $p$ coordinates can be approximated by a Gaussian vector with the same mean and covariance. We measure the error over rectangles, so the bounds apply to maxima and simultaneous confidence regions. The coordinates may be arbitrarily dependent, even exactly linearly dependent, and the bounds do not deteriorate as the covariance matrix becomes singular. After standardizing the coordinate variances, bounded or sub-exponential coordinates give the $n^{-1/2}$ sample-size rate up to logarithmic factors, with the size or tail bounds held fixed. The main upper bounds retain the Gaussian expected maximum, improving the rates when the coordinates are strongly dependent. Fourth-moment refinements give further improvements when large observations contribute little to individual coordinate variances. If we instead impose a fixed moment bound of order $q>4$ on the largest absolute coordinate, together with a coordinate fourth-moment bound, the rate becomes $n^{-1/2+1/q}$ up to logarithmic factors. At $q=4$, the slower $n^{-1/4}$ rate is unavoidable, confirming our earlier conjecture. We also allow the bounds on observation size to grow with $n$. Lower-bound examples show that the dependence on sample size, observation size, and Gaussian width is sharp up to logarithmic factors in the regimes studied, and in several regimes the upper and lower bounds match including the logarithmic terms.
- code
- github.com/VC2015/rectangle-clt-singular ∎ Lean project (lean-kane/lakefile.toml, lean-kane/lean-toolchain) builds, no sorry at 1803366, checked 2026-11-17 build details
- comments
- 107 pages. Supplemental Material (28 pages) and archived Lean verification: https://github.com/VC2015/rectangle-clt-singular
- fields
- Statistics Theory