The CLT in high dimensions: quantitative bounds via martingale embedding

From MaRDI portal
Publication:2212600



Abstract: We introduce a new method for obtaining quantitative convergence rates for the central limit theorem (CLT) in a high dimensional setting. Using our method, we obtain several new bounds for convergence in transportation distance and entropy, and in particular: (a) We improve the best known bound, obtained by the third named author, for convergence in quadratic Wasserstein transportation distance for bounded random vectors; (b) We derive the first non-asymptotic convergence rate for the entropic CLT in arbitrary dimension, for general log-concave random vectors; (c) We give an improved bound for convergence in transportation distance under a log-concavity assumption and improvements for both metrics under the assumption of strong log-concavity. Our method is based on martingale embeddings and specifically on the Skorokhod embedding constructed by the first named author.


The paper introduces a new method for obtaining quantitative convergence rates for the central limit theorem in a high-dimensional setting. The approach is based on martingale embeddings. The method is applied to derive new bounds for convergence in transportation distance and entropy. It improves the best known convergence rate in quadratic Wasserstein transportation distance for bounded random vectors. For general log-concave random vectors the authors derive a nonasymptotic convergence rate for the entropic CLT in an arbitrary dimension. In addition, they provide an improved bound for convergence in transportation distance under a log-concavity assumption and improvements under the assumption of strong log-concavity.



Cites work


Cited in
(23)








This page was built for publication: The CLT in high dimensions: quantitative bounds via martingale embedding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2212600)