Related papers: A Sharp Lower-tail Bound for Gaussian Maxima with …

We derive a Gaussian approximation result for the maximum of a sum of random vectors under $(2+\iota)$-th moments. Our main theorem is abstract and nonasymptotic, and can be applied to a variety of statistical learning problems. The proof…

The widespread use of Markov Chain Monte Carlo (MCMC) methods for high-dimensional applications has motivated research into the scalability of these algorithms with respect to the dimension of the problem. Despite this, numerous problems…

Let $(\xi_i)_{i=1,...,n}$ be a sequence of independent and symmetric random variables. We consider the upper bounds on tail probabilities of self-normalized deviations $$ \mathbf{P} \Big( \max_{1\leq k \leq n} \sum_{i=1}^{k} |\xi_i|\big/…

This paper considers a variation of the full-information secretary problem where the random variables to be observed are independent but not necessary identically distributed. The main result is a sharp lower bound for the optimal win…

In this paper, we provide novel tail bounds on the optimization error of Stochastic Mirror Descent for convex and Lipschitz objectives. Our analysis extends the existing tail bounds from the classical light-tailed Sub-Gaussian noise case to…

We derive simple but nearly tight upper and lower bounds for the binomial lower tail probability (with straightforward generalization to the upper tail probability) that apply to the whole parameter regime. These bounds are easy to compute…

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…

We show that the full-sample bootstrap is asymptotically valid for constructing confidence intervals for high-quantiles, tail probabilities, and other tail parameters of a univariate distribution. This resolves the doubts that have been…

We consider the Gaussian interface model in the presence of random external fields, that is the finite volume (random) Gibbs measure on $\mathbb{R}^{\Lambda_N}$, $\Lambda_N=[-N, N]^d\cap \mathbb{Z}^d$ with Hamiltonian $H_N(\phi)=…

This paper develops a new direct approach to approximating suprema of general empirical processes by a sequence of suprema of Gaussian processes, without taking the route of approximating whole empirical processes in the sup-norm. We prove…

This work introduces the minimax Laplace transform method, a modification of the cumulant-based matrix Laplace transform method developed in "User-friendly tail bounds for sums of random matrices" (arXiv:1004.4389v6) that yields both upper…

Let $X(t),t\in R^d$ be a centered Gaussian random field with continuous trajectories and set $\xi_u(t)= X(f(u)t),t\in R^d$ with $f$ some positive function. Classical results establish the tail asymptotics of $P\{ \Gamma(\xi_u) > u\}$ as…

In this work we develop a Monte Carlo method to compute the height distribution of local maxima of a stationary Gaussian or Gaussian-related random field that is observed on a regular lattice. We show that our method can be used to provide…

In this work, we study the convergence \emph{in high probability} of clipped gradient methods when the noise distribution has heavy tails, ie., with bounded $p$th moments, for some $1<p\le2$. Prior works in this setting follow the same…

We study the problem of Differentially Private Stochastic Convex Optimization (DP-SCO) with heavy-tailed data. Specifically, we focus on the $\ell_1$-norm linear regression in the $\epsilon$-DP model. While most of the previous work focuses…

We consider the detection problem of correlations in a $p$-dimensional Gaussian vector, when we observe $n$ independent, identically distributed random vectors, for $n$ and $p$ large. We assume that the covariance matrix varies in some…

In this paper, we obtain a refined non-asymptotic tail bound for the largest singular value (the soft edge) of sub-Gaussian matrix. As an application, we use the obtained theorem to compute the tail bound of the Gaussian Toeplitz matrix.

Suppose that $(Z_n)_{n\geq0}$ is a supercritical branching process in independent and identically distributed random environment. The right tail function of the scaled growth rate for $(Z_n)_{n\geq0}$ is studied. The upper bounds for…

Concentration inequalities for subgraph counts in random geometric graphs built over Poisson point processes are proved. The estimates give upper bounds for the probabilities $\mathbb{P}(N\geq M +r)$ and $\mathbb{P}(N\leq M - r)$ where $M$…

In this paper, we study non-asymptotic deviation bounds of the least squares estimator in Gaussian AR($n$) processes. By relying on martingale concentration inequalities and a tail-bound for $\chi^2$ distributed variables, we provide a…