arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2009.06004math.STmath.PRstat.TH
收藏

高维中心极限定理与Bootstrap逼近:隐式光滑下的$1/\sqrt{n}$近似速率

Central Limit Theorem and Bootstrap Approximation in High Dimensions: Near $1/\sqrt{n}$ Rates via Implicit Smoothing

Miles E. Lopes

摘要:

高斯近似和自举近似的非渐近界最近在高维统计中引起了极大的兴趣。本文研究了Berry-Esseen界的近似相对于多元Kolmogorov距离,在上下文中的$n$随机向量的总和是$p$维和i.i.d.到目前为止,越来越多的工作已经建立了对$p$有轻微对数依赖性的界限。然而,开发具有对$n$的近$n^{-1/2}$依赖性的相应界限的问题在很大程度上仍未解决。在具有次高斯或次指数项的随机向量的设置内,本文建立了具有近$n^{-1/2}$依赖性的高斯和自举近似的界。此外,证明是相当不同的其他最近的方法,并利用一个“隐式平滑”操作中的Lindeberg插值。

英文摘要:

Non-asymptotic bounds for Gaussian and bootstrap approximation have recently attracted significant interest in high-dimensional statistics. This paper studies Berry-Esseen bounds for such approximations with respect to the multivariate Kolmogorov distance, in the context of a sum of $n$ random vectors that are $p$-dimensional and i.i.d. Up to now, a growing line of work has established bounds with mild logarithmic dependence on $p$. However, the problem of developing corresponding bounds with near $n^{-1/2}$ dependence on $n$ has remained largely unresolved. Within the setting of random vectors that have sub-Gaussian or sub-exponential entries, this paper establishes bounds with near $n^{-1/2}$ dependence, for both Gaussian and bootstrap approximation. In addition, the proofs are considerably distinct from other recent approaches and make use of an "implicit smoothing" operation in the Lindeberg interpolation.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑