Related papers: A Method For Bounding Tail Probabilities

We provide a new extension of Breiman's Theorem on computing tail probabilities of a product of random variables to a multivariate setting. In particular, we give a complete characterization of regular variation on cones in $[0,\infty)^d$…

The paper suggests a simple method of deriving minimax lower bounds to the accuracy of statistical inference on heavy tails. A well-known result by Hall and Welsh (Ann. Statist. 12 (1984) 1079-1084) states that if $\hat{\alpha}_n$ is an…

We propose robust sparse reduced rank regression for analyzing large and complex high-dimensional data with heavy-tailed random noise. The proposed method is based on a convex relaxation of a rank- and sparsity-constrained non-convex…

High-dimensional data subject to heavy-tailed phenomena and heterogeneity are commonly encountered in various scientific fields and bring new challenges to the classical statistical methods. In this paper, we combine the asymmetric square…

Chernoff bounds are a powerful application of the Markov inequality to produce strong bounds on the tails of probability distributions. They are often used to bound the tail probabilities of sums of Poisson trials, or in regression to…

Our work aims to study the tail behaviour of weighted sums of the form $\sum_{i=1}^{\infty} X_{i} \prod_{j=1}^{i}Y_{j}$, where $(X_{i}, Y_{i})$ are independent and identically distributed, with common joint distribution bivariate Sarmanov.…

An explicit upper bound on the tail probabilities for the normalized Rademacher sums is given. This bound, which is best possible in a certain sense, is asymptotically equivalent to the corresponding tail probability of the standard normal…

We significantly improve the generalization bounds for VC classes by using two main ideas. First, we consider the hypergeometric tail inversion to obtain a very tight non-uniform distribution-independent risk upper bound for VC classes.…

We study tail probabilities via some Gaussian approximations. Our results make refinements to large deviation theory. The proof builds on classical results by Bahadur and Rao. Binomial distributions and their tail probabilities are…

We develop a new probabilistic and geometric method to obtain several sharp results pertaining to the upper tail behavior of continuum Gibbs measures on infinite ensembles of random continuous curves, also known as line ensembles,…

High-probability guarantees in stochastic optimization are often obtained only under strong noise assumptions such as sub-Gaussian tails. We show that such guarantees can also be achieved under the weaker assumption of bounded variance by…

We give upper and lower asymptotic bounds for the left tail and for the right tail of the continuous limiting QuickSort density f that are nearly matching in each tail. The bounds strengthen results from a paper of Svante Janson (2015)…

The sum of Log-normal variates is encountered in many challenging applications such as in performance analysis of wireless communication systems and in financial engineering. Several approximation methods have been developed in the…

Let $\{\xi_n\}$ be a sequence of independent and identically distributed random variables. In this paper we study the comparison for two upper tail probabilities $\mathbb{P}\{\sum_{n=1}^{\infty}a_n|\xi_n|^p\geq r\}$ and…

We study the almost surely finite random variable $S$ defined by the distributional fixed-point equation \[ S \stackrel{d}{=} 1 + \max\{US', (1-U)S''\}, \qquad U \sim \mathrm{Unif}(0,1), \] where $S'$ and $S''$ are independent copies of…

We present a flexible, deterministic numerical method for computing left-tail rare events of sums of non-negative, independent random variables. The method is based on iterative numerical integration of linear convolutions by means of…

In this paper we present a method for obtaining tail-bounds for random variables satisfying certain probabilistic recurrences that arise in the analysis of randomized parallel divide and conquer algorithms. In such algorithms, some…

Let $\{X(t)= (X_1(t),X_2(t))^T,\ t \in \mathbb{R}^N\}$ be an $\mathbb{R}^2$-valued continuous locally stationary Gaussian random field with $\mathbb{E}[X(t)]=\mathbf{0}$. For any compact sets $A_1, A_2 \subset \mathbb{R}^N$, precise…

Despite the successes of probabilistic models based on passing noise through neural networks, recent work has identified that such methods often fail to capture tail behavior accurately, unless the tails of the base distribution are…

Finite sample properties of random covariance-type matrices have been the subject of much research. In this paper we focus on the "lower tail" of such a matrix, and prove that it is subgaussian under a simple fourth moment assumption on the…