English
Related papers

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

200 papers

We prove new lower bounds for the upper tail probabilities of suprema of Gaussian processes. Unlike many existing bounds, our results are not asymptotic, but supply strong information when one is only a little into the upper tail. We…

Probability · Mathematics 2013-02-25 Adam J. Harper

This article is devoted to the study of tail index estimation based on i.i.d. multivariate observations, drawn from a standard heavy-tailed distribution, i.e. of which 1-d Pareto-like marginals share the same tail index. A multivariate…

Statistics Theory · Mathematics 2014-04-10 Stéphan Clémençon , Antoine Dematteo

Recently, Gilmer proved the first constant lower bound for the union-closed sets conjecture via an information-theoretic argument. The heart of the argument is an entropic inequality involving the OR function of two i.i.d.\ binary vectors,…

Information Theory · Computer Science 2023-06-16 Jingbo Liu

We derive upper bounds on the tail conditional expectation of binomial and Poisson random variables. Those upper bounds are subsequently employed to the problem of obtaining non-asymptotic lower bounds on the probability that the…

Probability · Mathematics 2017-12-07 Christos Pelekis

In this work, we apply the concept about operator connection to consider bivariate random tensor means. We first extend classical Markov and Chebyshev inequalities from a random variable to a random tensor by establishing Markov inequality…

Probability · Mathematics 2023-05-08 Shih-Yu Chang

This paper develops a Hoeffding inequality for the partial sums $\sum_{k=1}^n f (X_k)$, where $\{X_k\}_{k \in \mathbb{Z}_{> 0}}$ is an irreducible Markov chain on a finite state space $S$, and $f : S \to [a, b]$ is a real-valued function.…

Statistics Theory · Mathematics 2020-07-13 Vrettos Moulos

We prove tail estimates for variables $\sum_i f(X_i)$, where $(X_i)_i$ is the trajectory of a random walk on an undirected graph (or, equivalently, a reversible Markov chain). The estimates are in terms of the maximum of the function $f$,…

Probability · Mathematics 2007-12-25 Roy Wagner

We study stochastic nonconvex optimization under heavy-tailed noise. In this setting, the stochastic gradients only have bounded $p$-th central moment ($p$-BCM) for some $p \in (1,2]$. Building on the foundational work of Arjevani et al.…

Optimization and Control · Mathematics 2026-04-01 Adrien Fradin , Abdurakhmon Sadiev , Laurent Condat , Peter Richtárik

We improve the rate function of McDiarmid's inequality for Hamming distance. In particular, applying our result to the separately Lipschitz functions of independent random variables, we also refine the convergence rate function of…

Probability · Mathematics 2016-11-15 Xiequan Fan

In this paper, we provide novel optimal (or near optimal) convergence rates for a clipped version of the stochastic subgradient method. We consider nonsmooth convex problems over possibly unbounded domains, under heavy-tailed noise that…

Optimization and Control · Mathematics 2025-04-21 Daniela Angela Parletta , Andrea Paudice , Saverio Salzo

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…

Probability · Mathematics 2017-01-17 Iosif Pinelis

In this paper, we establish an improved version of a saddle point theorem ([4]) removing a weak lower semicontinuity assumption at all. We then revisit some of the applications of that theorem in the light of such an improvement. For…

Optimization and Control · Mathematics 2021-11-08 Biagio Ricceri

This paper establishes the functional convergence of the Extreme Nelson--Aalen and Extreme Kaplan--Meier estimators, which are designed to capture the heavy-tailed behaviour of censored losses. The resulting limit representations can be…

Methodology · Statistics 2024-08-22 Martin Bladt , Christoffer Øhlenschlæger

Many management decisions involve accumulated random realizations for which only the first and second moments of their distribution are available. The sharp Chebyshev-type bound for the tail probability and Scarf bound for the expected loss…

Econometrics · Economics 2025-05-15 Zhaolin Li , Artem Prokhorov

The estimation of the extremal dependence structure is spoiled by the impact of the bias, which increases with the number of observations used for the estimation. Already known in the univariate setting, the bias correction procedure is…

Statistics Theory · Mathematics 2015-04-03 Anne-Laure Fougères , Laurens de Haan , Cécile Mercadier

In this paper, we study lower tail probabilities of the height function $\mathfrak{h}(M,N)$ of the stochastic six-vertex model. We introduce a novel combinatorial approach to demonstrate that the tail probabilities…

Probability · Mathematics 2025-08-26 Sayan Das , Yuchen Liao , Matteo Mucciconi

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…

Probability · Mathematics 2013-12-11 Roberto Imbuzeiro Oliveira

We provide a necessary and sufficient condition for the ratio of two jointly alpha-Frechet random variables to be regularly varying. This condition is based on the spectral representation of the joint distribution and is easy to check in…

Statistics Theory · Mathematics 2011-02-04 Yizao Wang

In this paper, we study the problem of stochastic linear bandits with finite action sets. Most of existing work assume the payoffs are bounded or sub-Gaussian, which may be violated in some scenarios such as financial markets. To settle…

Machine Learning · Computer Science 2020-04-29 Bo Xue , Guanghui Wang , Yimu Wang , Lijun Zhang

We derive upper bounds for probabilities of the form $P(g(\mathbf{X})\geq t)$ using the southwest boundary (recently introduced in our previous work) $\partial_{\mathrm{SW}} Q(g^{-1}[t,\infty))$, where $Q$ is a reflection to the first…

Probability · Mathematics 2026-04-27 Stephen Jordan Harrison