Related papers: On normal approximations to $U$-statistics
The Lasso is one of the most important approaches for parameter estimation and variable selection in high dimensional linear regression. At the heart of its success is the attractive rate of convergence result even when $p$, the dimension…
In this article, we establish a near-optimal convergence rate for the CLT of linear eigenvalue statistics of Wigner matrices, in Kolmogorov-Smirnov distance. For all test functions $f\in C^5(\mathbb R)$, we show that the convergence rate is…
We study the properties of several likelihood-based statistics commonly used in testing for the presence of a known signal under a mixture model with known background, but unknown signal fraction. Under the null hypothesis of no signal, all…
Let $s:[1,\infty) \to \C $ be a locally integrable function in Lebesgue's sense. The logarithmic (also called harmonic) mean of the function $s$ is defined by [\tau(t) := \frac 1{\log t} \int_1^t \frac {s(x)}{x} dx, \qquad t>1,] where the…
We derive optimal rates of convergence in the supremum norm for estimating the H\"older-smooth mean function of a stochastic process which is repeatedly and discretely observed with additional errors at fixed, multivariate, synchronous…
Two-time-scale stochastic approximation, a generalized version of the popular stochastic approximation, has found broad applications in many areas including stochastic control, optimization, and machine learning. Despite its popularity,…
In a remarkable paper, Peter Hall [{\it On the rate of convergence of normal extremes}, J. App. Prob, {\bf 16} (1979) 433--439] proved that the supremum norm distance between the distribution function of the normalized maximum of $n$…
We study the central limit theorem in the non-normal domain of attraction to symmetric $\alpha$-stable laws for $0<\alpha\leq2$. We show that for i.i.d. random variables $X_i$, the convergence rate in $L^\infty$ of both the densities and…
A local convergence rate is established for a Gauss orthogonal collocation method applied to optimal control problems with control constraints. If the Hamiltonian possesses a strong convexity property, then the theory yields convergence for…
In this article, we obtain a super-exponential rate of convergence in total variation between the traces of the first $m$ powers of an $n\times n$ random unitary matrices and a $2m$-dimensional Gaussian random variable. This generalizes…
Let $(X_1, \dots, X_n)$ be multivariate normal, with mean vector $\boldsymbol{\mu}$ and covariance matrix $\boldsymbol{\Sigma}$, and $S_n=\mathrm{e}^{X_1}+\cdots+\mathrm{e}^{X_n}$. The Laplace transform ${\cal…
In the context of statistical supervised learning, the noiseless linear model assumes that there exists a deterministic linear relation $Y = \langle \theta_*, X \rangle$ between the random output $Y$ and the random feature vector $\Phi(U)$,…
The $T$-test is probably the most popular statistical test; it is routinely recommended by the textbooks. The applicability of the test relies upon the validity of normal or Student's approximation to the distribution of Student's statistic…
For a regression model, we consider the risk of the maximum likelihood estimator with respect to $\alpha$-divergence, which includes the special cases of Kullback-Leibler divergence, Hellinger distance and $\chi^2$ divergence. The…
We consider the stable approximation of sparse solutions to non-linear operator equations by means of Tikhonov regularization with a subquadratic penalty term. Imposing certain assumptions, which for a linear operator are equivalent to the…
We investigate the almost sure asymptotic properties of vector martingale transforms. Assuming some appropriate regularity conditions both on the increasing process and on the moments of the martingale, we prove that normalized moments of…
We study a problem of finding good approximations to Euler's constant $\gamma=\lim_{n\to\infty}S_n,$ where $S_n=\sum_{k=1}^n\frac{1}{n}-\log(n+1),$ by linear forms in logarithms and harmonic numbers. In 1995, C. Elsner showed that slow…
Randomized approximation algorithms for many #P-complete problems (such as the partition function of a Gibbs distribution, the volume of a convex body, the permanent of a $\{0,1\}$-matrix, and many others) reduce to creating random…
In this note, we investigate the convergence of a $U$-statistic of order two having stationary ergodic data. We will find sufficient conditions for the almost sure and $L^1$ convergence and present some counter-examples showing that the…
In another related work, U-statistics were used for non-asymptotic "average-case" analysis of random compressed sensing matrices. In this companion paper the same analytical tool is adopted differently - here we perform non-asymptotic…