Sharp High-dimensional Central Limit Theorems for Log-concave Distributions
Xiao Fang, Yuta Koike

TL;DR
This paper establishes sharp high-dimensional central limit theorems for sums of log-concave vectors, providing explicit error bounds that depend on the dimension and sample size, with improvements under the KLS conjecture.
Contribution
It introduces new dimension-dependent bounds for normal approximation of log-concave distributions, including a novel Gaussian coupling inequality combining Stein's method and stochastic localization.
Findings
Bounded approximation error over rectangles by $C(rac{ ext{log}^{13}(dn)}{n})^{1/2}$.
Improved bound to $C(rac{ ext{log}^{3}(dn)}{n})^{1/2}$ under KLS conjecture.
Derived optimal $p$-Wasserstein bounds and a Cramér moderate deviation result.
Abstract
Let be i.i.d. log-concave random vectors in with mean 0 and covariance matrix . We study the problem of quantifying the normal approximation error for with explicit dependence on the dimension . Specifically, without any restriction on , we show that the approximation error over rectangles in is bounded by for some universal constant . Moreover, if the Kannan-Lov\'asz-Simonovits (KLS) spectral gap conjecture is true, this bound can be improved to . This improved bound is optimal in terms of both and in the regime . We also give -Wasserstein bounds with all and a Cram\'er type moderate deviation result for this normal approximation error, and they are all optimal under the KLS conjecture. To prove these…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPoint processes and geometric inequalities · Markov Chains and Monte Carlo Methods · Geometric Analysis and Curvature Flows
