惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

T
The Blog of Author Tim Ferriss
Hugging Face - Blog
Hugging Face - Blog
F
Fortinet All Blogs
B
Blog
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
Microsoft Security Blog
Microsoft Security Blog
Blog — PlanetScale
Blog — PlanetScale
月光博客
月光博客
腾讯CDC
小众软件
小众软件
G
Google Developers Blog
V
Visual Studio Blog
罗磊的独立博客
GbyAI
GbyAI
V
V2EX
大猫的无限游戏
大猫的无限游戏
H
Help Net Security
L
LangChain Blog
Engineering at Meta
Engineering at Meta
量子位
The GitHub Blog
The GitHub Blog
博客园 - 司徒正美
WordPress大学
WordPress大学
B
Blog RSS Feed

math.PR updates on arXiv.org

Visibility in the Boolean Model on Harmonic Manifolds Global estimates on the Brenier map Geodesics and Wandering Exponents in Brochette First-Passage Percolation State-dependent inverse-subordinator time changes of regenerative processes: Excursion structure and multiscale occupation-time limits Randomly twisted transfer operators and singular values statistics Generalized Bessel-Dunkl diffusions An almost sure invariance principle for the Takagi-van der Waerden class functions Central limit theorems for high dimensional lattice polytopes: cosmological polytopes Convergence rate estimates for semigroups and heat kernels associated with resistance forms Second-order Poincaré inequalities and localization on the Poisson space Maximum Probability of Independence in Transitive Matroids On global solutions to the semidiscrete stochastic heat equation The Poisson Tail Conjecture for primes in short intervals A Complete Spectral Analysis of the CEV Operator with Applications to Arbitrage Holographic functions and neural networks From Betting to Empirical Bernstein LIL Concentration of General Stochastic Approximation Under Heavy-Tailed Markovian Noise Pointwise Generalization in Deep Neural Networks Bayesian Latent Space Models for Graphs Are Misspecified: Toward Robust Inference via Generalized Posteriors Wasserstein bounds for denoising diffusion probabilistic models via the Föllmer process A note on connections between the Föllmer process and the denoising diffusion probabilistic model Simple Approximation and Derivative Free Inference-Time Scaling for Diffusion Models via Sequential Monte Carlo on Path Measures Diffusion-Based Stochastic Operator Networks for Uncertainty Quantification in Stochastic Partial Differential Equations A Fourier perspective on the learning dynamics of neural networks: from sample complexities to mechanistic insights Propagation of Chaos in Contextual Flow Maps Dimension-Uniform Discretization Analysis of Preconditioned Annealed Langevin Dynamics for Multimodal Gaussian Mixtures $α$-TCAV: A Unified Framework for Testing with Concept Activation Vectors Scaling Laws from Sequential Feature Recovery: A Solvable Hierarchical Model On the Limits of Latent Reuse in Diffusion Models State-of-art minibatches via novel DPP kernels: discretization, wavelets, and rough objectives
Central Limit Theorem in High Dimensions : The Optimal Bo...
Debraj Das, Soumendra Lahiri · 2020-08-11 · via math.PR updates on arXiv.org

In this article, we try to give an answer to the simple question: ``\textit{What is the critical growth rate of the dimension $p$ as a function of the sample size $n$ for which the Central Limit Theorem holds uniformly over the collection of $p$-dimensional hyper-rectangles ?''}. Specifically, we are interested in the normal approximation of suitably scaled versions of the sum $\sum_{i=1}^{n}X_i$ in $\mathcal{R}^p$ uniformly over the class of hyper-rectangles $\mathcal{A}^{re}=\{\prod_{j=1}^{p}[a_j,b_j]\cap\mathcal{R}:-\infty\leq a_j\leq b_j \leq \infty, j=1,\ldots,p\}$, where $X_1,\dots,X_n$ are independent $p-$dimensional random vectors with each having independent and identically distributed (iid) components. We investigate the critical cut-off rate of $\log p$ below which the uniform central limit theorem (CLT) holds and above which it fails. According to some recent results of Chernozukov et al. (2017), it is well known that the CLT holds uniformly over $\mathcal{A}^{re}$ if $\log p=o\big(n^{1/7}\big)$. They also conjectured that for CLT to hold uniformly over $\mathcal{A}^{re}$, the optimal rate is $\log p = o\big(n^{1/3}\big)$. We show instead that under some conditions, the CLT holds uniformly over $\mathcal{A}^{re}$, when $\log p=o\big(n^{1/2}\big)$. More precisely, we show that if $\log p =ε\sqrt{n}$ for some sufficiently small $ε>0$, the normal approximation is valid with an error $ε$, uniformly over $\mathcal{A}^{re}$. Further, we show by an example that the uniform CLT over $\mathcal{A}^{re}$ fails if $\limsup_{t\rightarrow \infty} n^{-(1/2+δ)} \log p >0$ for some $δ>0$. Hence the critical rate of the growth of $p$ for the validity of the CLT is given by $\log p=o\big(n^{1/2}\big)$.