Related papers: Improved Hoeffding's Lemma and Hoeffding's Tail Bo…

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…

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 re-examine a lower-tail upper bound for the random variable $$X=\prod_{i=1}^{\infty}\min\left\{\sum_{k=1}^iE_k,1\right\},$$ where $E_1,E_2,\ldots\stackrel{iid}\sim\text{Exp}(1)$. This bound has found use in root-finding and seed-finding…

This note gives a proof of an improved upper bound for the right-side tail of a distribution discussed in "Crossover Distributions at the Edge of the Rarefaction Fan" by Ivan Corwin and Jeremy Quastel.

Let $X_1,X_2,...$ be a sequence of independent and identically distributed random variables, and put $S_n=X_1+...+X_n$. Under some conditions on the positive sequence $\tau_n$ and the positive increasing sequence $a_n$, we give necessary…

This paper develops an optimal Chernoff type bound for the probabilities of large deviations of sums $\sum_{k=1}^n f (X_k)$ where $f$ is a real-valued function and $(X_k)_{k \in \mathbb{Z}_{\ge 0}}$ is a finite state Markov chain with an…

We consider the problem of finding the optimal upper bound for the tail probability of a sum of $k$ nonnegative, independent and identically distributed random variables with given mean $x$. For $k=1$ the answer is given by Markov's…

Let $\{Z(\tau,s), (\tau,s)\in [a,b]\times[0,T]\}$ with some positive constants $a,b,T$ be a centered Gaussian random field with variance function $\sigma^{2}(\tau,s)$ satisfying $\sigma^{2}(\tau,s)=\sigma^{2}(\tau)$. We firstly derive the…

Chebyshev's inequality provides an upper bound on the tail probability of a random variable based on its mean and variance. While tight, the inequality has been criticized for only being attained by pathological distributions that abuse the…

The well-known "Janson's inequality" gives Poisson-like upper bounds for the lower tail probability \Pr(X \le (1-\eps)\E X) when X is the sum of dependent indicator random variables of a special form. We show that, for large deviations,…

Let $X_1,\dots,X_n$ be independent normal random variables with $X_i\sim N(\mu_i,\sigma_i^2)$, and set $Z=\prod_{i=1}^n X_i$. We derive asymptotic approximations for the right tail probability $\mathbb{P}(Z>x)$ as $x\to\infty$. When at…

We derive upper and lower bounds on the expectation of $f(\mathbf{S})$ under dependence uncertainty, i.e. when the marginal distributions of the random vector $\mathbf{S}=(S_1,\dots,S_d)$ are known but their dependence structure is…

This paper describes the construction of a lower bound for the tails of general random variables, using solely knowledge of their moment generating function. The tilting procedure used allows for the construction of lower bounds that are…

We give a simple inequality for the sum of independent bounded random variables. This inequality improves on the celebrated result of Hoeffding in a special case. It is optimal in the limit where the sum tends to a Poisson random variable.

In our recent research endeavors, we have delved into the realm of tail bounds problems concerning bivariate random tensor means. In this context, tensors are treated as finite-dimensional operators. However, the longstanding challenge of…

We use bias-reduced estimators of high quantiles, of heavy-tailed distributions, to introduce a new estimator of the mean in the case of infinite second moment. The asymptotic normality of the proposed estimator is established and checked,…

``Localization'' has proven to be a valuable tool in the Statistical Learning literature as it allows sharp risk bounds in terms of the problem geometry. Localized bounds seem to be much less exploited in the Stochastic Optimization…

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…

Understanding the generalization properties of heavy-tailed stochastic optimization algorithms has attracted increasing attention over the past years. While illuminating interesting aspects of stochastic optimizers by using heavy-tailed…

We study stochastic linear bandits with heavy-tailed rewards, where the rewards have a finite $(1+\epsilon)$-absolute central moment bounded by $\upsilon$ for some $\epsilon \in (0,1]$. We improve both upper and lower bounds on the minimax…