Central Limit Theorem in High Dimensions : The Optimal Bound on Dimension Growth Rate
Debraj Das, Soumendra Lahiri

TL;DR
This paper determines the optimal growth rate of the dimension p relative to sample size n for the Central Limit Theorem to hold uniformly over hyper-rectangles in high-dimensional spaces, showing it is when log p=o(n^{1/2}).
Contribution
The paper establishes that the uniform CLT holds in high dimensions if log p=o(n^{1/2}), improving previous bounds and confirming the conjectured optimal rate.
Findings
CLT holds uniformly if log p=o(n^{1/2})
CLT fails if log p grows faster than n^{1/2}
Provides a precise critical growth rate for high-dimensional CLT
Abstract
In this article, we try to give an answer to the simple question: ``\textit{What is the critical growth rate of the dimension as a function of the sample size for which the Central Limit Theorem holds uniformly over the collection of -dimensional hyper-rectangles ?''}. Specifically, we are interested in the normal approximation of suitably scaled versions of the sum in uniformly over the class of hyper-rectangles , where are independent dimensional random vectors with each having independent and identically distributed (iid) components. We investigate the critical cut-off rate of below which the uniform central limit theorem (CLT) holds and above which it fails. According to some recent results of…
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.
