English
Related papers

Related papers: Nearly optimal central limit theorem and bootstrap…

200 papers

In this paper, we refine the Berry-Esseen bounds for the multivariate normal approximation of Polyak-Ruppert averaged iterates arising from the linear stochastic approximation (LSA) algorithm with decreasing step size. We consider the…

Machine Learning · Statistics 2025-10-15 Bogdan Butyrin , Eric Moulines , Alexey Naumov , Sergey Samsonov , Qi-Man Shao , Zhuo-Song Zhang

Let $X,X_1,X_2,\ldots$ be i.i.d. ${\mathbb{R}}^d$-valued real random vectors. Assume that ${\mathbf{E}X=0}$, $\operatorname {cov}X=\mathbb{C}$, $\mathbf{E}\Vert X\Vert^2=\sigma ^2$ and that $X$ is not concentrated in a proper subspace of…

Probability · Mathematics 2014-01-15 Friedrich Götze , Andrei Yu. Zaitsev

We establish a central limit theorem for (a sequence of) multivariate martingales which dimension potentially grows with the length $n$ of the martingale. A consequence of the results are Gaussian couplings and a multiplier bootstrap for…

Statistics Theory · Mathematics 2018-09-11 Alexandre Belloni , Roberto I. Oliveira

This paper derives a new strong Gaussian approximation bound for the sum of independent random vectors. The approach relies on the optimal transport theory and yields \textit{explicit} dependence on the dimension size $p$ and the sample…

Statistics Theory · Mathematics 2021-09-06 Nazar Buzun , Nikolay Shvetsov , Dmitry V. Dylov

This paper addresses the question of when projections of a high-dimensional random vector are approximately Gaussian. This problem has been studied previously in the context of high-dimensional data analysis, where the focus is on…

Information Theory · Computer Science 2017-01-02 Galen Reeves

Slepian and Sudakov-Fernique type inequalities, which compare expectations of maxima of Gaussian random vectors under certain restrictions on the covariance matrices, play an important role in probability theory, especially in empirical…

Probability · Mathematics 2014-04-15 Victor Chernozhukov , Denis Chetverikov , Kengo Kato

We study the approximability of general convex sets in $\mathbb{R}^n$ by intersections of halfspaces, where the approximation quality is measured with respect to the standard Gaussian distribution $N(0,I_n)$ and the complexity of an…

Computational Complexity · Computer Science 2023-11-16 Anindya De , Shivam Nadimpalli , Rocco A. Servedio

Gaussian universality results assert that the properties of many estimators remain unchanged when the input data are replaced by Gaussians. Such results have gained popularity in high-dimensional statistics and machine learning, as…

Probability · Mathematics 2025-12-03 Kevin Han Huang , Morgane Austern , Peter Orbanz

We study accuracy of bootstrap procedures for estimation of quantiles of a smooth function of a sum of independent sub-Gaussian random vectors. We establish higher-order approximation bounds with error terms depending on a sample size and a…

Statistics Theory · Mathematics 2020-09-21 Mayya Zhilova

In this paper we develop non-asymptotic Gaussian approximation results for the sampling distribution of suprema of empirical processes when the indexing function class $\mathcal{F}_n$ varies with the sample size $n$ and may not be Donsker.…

Statistics Theory · Mathematics 2023-09-06 Alexander Giessing

Although much progress has been made in the theory and application of bootstrap approximations for max statistics in high dimensions, the literature has largely been restricted to cases involving light-tailed data. To address this issue, we…

Methodology · Statistics 2025-12-24 Mingshuo Liu , Miles E. Lopes

We obtain explicit error bounds for the $d$-dimensional normal approximation on hyperrectangles for a random vector that has a Stein kernel, or admits an exchangeable pair coupling, or is a non-linear statistic of independent random…

Probability · Mathematics 2020-09-08 Xiao Fang , Yuta Koike

Under correlation-type conditions, we derive an upper bound of order $(\log n)/n$ for the average Kolmogorov distance between the distributions of weighted sums of dependent summands and the normal law. The result is based on improved…

Probability · Mathematics 2019-06-24 S. G. Bobkov , G. P. Chistyakov , F. Götze

We prove abstract bounds on the Wasserstein and Kolmogorov distances between non-randomly centered random sums of real i.i.d. random variables with a finite third moment and the standard normal distribution. Except for the case of mean zero…

Probability · Mathematics 2015-11-20 Christian Döbler

In this paper we provide explicit upper bounds on some distances between the (law of the) output of a random Gaussian NN and (the law of) a random Gaussian vector. Our results concern both shallow random Gaussian neural networks with…

This paper is concerned with finite sample approximations to the supremum of a non-degenerate $U$-process of a general order indexed by a function class. We are primarily interested in situations where the function class as well as the…

Statistics Theory · Mathematics 2019-02-15 Xiaohui Chen , Kengo Kato

In recent years, bootstrap methods have drawn attention for their ability to approximate the laws of "max statistics" in high-dimensional problems. A leading example of such a statistic is the coordinate-wise maximum of a sample average of…

Statistics Theory · Mathematics 2019-07-23 Miles E. Lopes , Zhenhua Lin , Hans-Georg Mueller

We consider the problem of Gaussian multiplier bootstrap procedures for the $k$th largest statistics and functions of the top $k$ order statistics, which are commonly encountered in high-dimensional statistical inference. Such a problem has…

Statistics Theory · Mathematics 2026-03-04 Yixi Ding , Qizhai Li , Yuke Shi , Liuquan Sun , Luobin Zhang

Let $X_1, \ldots , X_n$ be i.i.d. random vectors in $\mathbb{R}^d$ with $\|X_1\| \le \beta$. Then, we show that $\frac{1}{\sqrt{n}}(X_1 + \ldots + X_n)$ converges to a Gaussian in quadratic transportation (also known as "Kantorovich" or…

Probability · Mathematics 2017-07-25 Alex Zhai

We consider the number of crossings in a random embedding of a graph, $G$, with vertices in convex position. We give explicit formulas for the mean and variance of the number of crossings as a function of various subgraph counts of $G$.…

Probability · Mathematics 2024-10-14 Santiago Arenas-Velilla , Octavio Arizmendi , J. E. Paguyo