Second- and higher-order Gaussian anticoncentration inequalities and error bounds in Slepian's comparison theorem
Summary: This paper presents some second- and higher-order Gaussian anticoncentration inequalities in high dimension and error bounds in Slepian's comparison theorem for the distribution functions of the maxima of two Gaussian vectors. The anticoncentration theorems are presented as upper bounds for the sum of the absolute values of the partial derivatives of a certain order for the joint distribution function of a Gaussian vector or weighted sums of such absolute values. Compared with the existing results where the covariance matrix of the entire Gaussian vector is required to be invertible, the bounds for the th derivatives developed in this paper require only the invertibility of the covariance matrices of all subsets of random variables. The second-order anticoncentration inequality is used to develop comparison theorems for the joint distribution functions of Gaussian vectors or, equivalently, the univariate distribution functions of their maxima via Slepian's interpolation. The third- and higher-order anticoncentration inequalities are motivated by recent advances in the central limit theorem and consistency of bootstrap for the maximum component of a sum of independent random vectors in high dimension and related applications in statistical inference and machine learning. For the entire collection see [Zbl 07816361].
- Comparison and anti-concentration bounds for maxima of Gaussian random vectors
- Some inequalities for Gaussian processes and applications
- Large ball probabilities, Gaussian comparison and anti-concentration
- An inequality for the total variation distance between high-dimensional centered Gaussian laws
- Comparison inequalities for order statistics of Gaussian arrays
- A normal comparison inequality and its applications
- Beyond Gaussian approximation: bootstrap for maxima of sums of independent random vectors
- Central limit theorem in high dimensions: the optimal bound on dimension growth rate
- Central limit theorems and bootstrap in high dimensions
- Comparison and anti-concentration bounds for maxima of Gaussian random vectors
- Density formula and concentration inequalities with Malliavin calculus
- Edgeworth expansions in very-high-dimensional problems
- Fooling polytopes
- Gaussian approximation for high dimensional time series
- Gaussian approximation for high dimensional vector under physical dependence
- Gaussian approximations and multiplier bootstrap for maxima of sums of high-dimensional random vectors
- Gaussian processes: Inequalities, small ball probabilities and applications
- High-dimensional central limit theorems by Stein's method
- scientific article; zbMATH DE number 49190 (Why is no real title available?)
- scientific article; zbMATH DE number 51414 (Why is no real title available?)
- scientific article; zbMATH DE number 3636997 (Why is no real title available?)
- scientific article; zbMATH DE number 1952026 (Why is no real title available?)
- scientific article; zbMATH DE number 1975229 (Why is no real title available?)
- scientific article; zbMATH DE number 3431598 (Why is no real title available?)
- scientific article; zbMATH DE number 3366227 (Why is no real title available?)
- Nonclassical Berry-Esseen inequalities and accuracy of the bootstrap
- On the dependence of the Berry-Esseen bound on dimension
- On the rate of convergence in the multivariate CLT
- Smallest singular value of a random rectangular matrix
- Smooth approximations of the norm and differentiable functions with bounded support in Banach space \(\ell ^ k_{\infty}\)
- Some inequalities for Gaussian processes and applications
- The Littlewood-Offord problem and invertibility of random matrices
This page was built for publication: Second- and higher-order Gaussian anticoncentration inequalities and error bounds in Slepian's comparison theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6200224)
