Related papers: High-dimensional Central Limit Theorems by Stein's…
In this paper, we propose an interior-point method for linearly constrained optimization problems (possibly nonconvex). The method - which we call the Hessian barrier algorithm (HBA) - combines a forward Euler discretization of Hessian…
The sharpest known high probability generalization bounds for uniformly stable algorithms (Feldman, Vondr\'{a}k, 2018, 2019), (Bousquet, Klochkov, Zhivotovskiy, 2020) contain a generally inevitable sampling error term of order…
[B{\l}aszczyszyn, Yogeshwaran and Yukich (2019)] established central limit theorems for geometric statistics of point processes having fast decay dependence. As limit theorems are of limited use unless we understand their errors involved in…
We prove a local limit theorem, i.e. a central limit theorem for densities, for a sequence of independent and identically distributed random variables taking values on an abstract Wiener space; the common law of those random variables is…
Motivated by the omnipresence of extreme value distributions in limit theorems involving extremes of random processes, we adapt Stein's method to include these laws as possible target distributions. We do so by using the generator approach…
Uniform and nonuniform Berry--Esseen (BE) bounds of optimal orders on the closeness to normality for general abstract nonlinear statistics are given, which are then used to obtain optimal bounds on the rate of convergence in the delta…
The central limit theorem is one of the most fundamental results in probability and has been successfully extended to locally dependent data and strongly-mixing random fields. In this paper, we establish its rate of convergence for…
We consider $N\times N$ Hermitian random matrices with independent identical distributed entries. The matrix is normalized so that the average spacing between consecutive eigenvalues is of order 1/N. Under suitable assumptions on the…
For a class of degenerate diffusion processes of rank 2, i.e. when only Poisson brackets of order one are needed to span the whole space, we obtain a parametrix representation of the density from which we derive some explicit Gaussian…
We obtain explicit Berry-Esseen bounds in the Kolmogorov distance for the normal approximation of non-linear functionals of vectors of independent random variables. Our results are based on the use of Stein's method and of random difference…
This work presents the first systematic development of Stein's method for matrix distributions. We establish the basic essential ingredients of Stein's method for matrix normal approximation: we derive a generator-based Stein identity from…
The motivation of this work is the study of the error term e_t^{\epsilon}(x,\omega) in the averaging method for differential equations perturbed by a dynamical system. Results of convergence in distribution for…
This paper provides new error bounds on "consistent" reconstruction methods for signals observed from quantized random projections. Those signal estimation techniques guarantee a perfect matching between the available quantized data and a…
This paper gives a theoretical analysis of high dimensional linear discrimination of Gaussian data. We study the excess risk of linear discriminant rules. We emphasis on the poor performances of standard procedures in the case when…
We continue the study of the Hermitian random matrix ensemble with external source $\frac{1}{Z_n} e^{-n \Tr({1/2}M^2 -AM)} dM$ where $A$ has two distinct eigenvalues $\pm a$ of equal multiplicity. This model exhibits a phase transition for…
We show, how the classical Berry-Esseen theorem for normal approximation may be used to derive rates of convergence for random sums of centerd, real-valued random variables with respect to a certain class of probability metrics, including…
We study the saddlepoint approximation (SPA) for sums of $n$ i.i.d. random vectors $X_i\in\mathbb R^d$ in growing dimensions. SPA provides highly accurate approximations to probability densities and distribution functions via the moment…
We obtain estimates for the Kolmogorov distance to appropriately chosen gaussians, of linear functions \[ \sum_{i\in [n]^d} \theta_i X_i \] of random tensors $\boldsymbol{X}=\langle X_i:i\in [n]^d\rangle$ which are symmetric and…
Peng (2008)(\cite{P08b}) proved the Central Limit Theorem under a sublinear expectation: \textit{Let $(X_i)_{i\ge 1}$ be a sequence of i.i.d random variables under a sublinear expectation $\hat{\mathbf{E}}$ with…
In order to characterize the fluctuation between the ergodic limit and the time-averaging estimator of a full discretization in a quantitative way, we establish a central limit theorem for the full discretization of the parabolic stochastic…