A Non-asymptotic, Sharp, and User-friendly Reverse Chernoff-Cramèr Bound

10/21/2018
by   Anru Zhang, et al.
0

The Chernoff-Cramèr bound is a widely used technique to analyze the upper tail bound of random variable based on its moment generating function. By elementary proofs, we develop a user-friendly reverse Chernoff-Cramèr bound that yields non-asymptotic lower tail bounds for generic random variables. The new reverse Chernoff-Cramèr bound is used to derive a series of results, including the sharp lower tail bounds for the sum of independent sub-Gaussian and sub-exponential random variables, which matches the classic Hoefflding-type and Bernstein-type concentration inequalities, respectively. We also provide non-asymptotic matching upper and lower tail bounds for a suite of distributions, including gamma, beta, (regular, weighted, and noncentral) chi-squared, binomial, Poisson, Irwin-Hall, etc. We apply the result to develop matching upper and lower bounds for extreme value expectation of the sum of independent sub-Gaussian and sub-exponential random variables. A statistical application of sparse signal identification is finally studied.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/21/2018

On the Non-asymptotic and Sharp Lower Tail Bounds of Random Variables

The non-asymptotic tail bounds of random variables play crucial roles in...
research
08/28/2020

On the Non-Asymptotic Concentration of Heteroskedastic Wishart-type Matrix

This paper focuses on the non-asymptotic concentration of the heterosked...
research
04/06/2023

Sharp Deviations Bounds for Dirichlet Weighted Sums with Application to analysis of Bayesian algorithms

In this work, we derive sharp non-asymptotic deviation bounds for weight...
research
01/28/2020

Sub-Gaussian Matrices on Sets: Optimal Tail Dependence and Applications

Random linear mappings are widely used in modern signal processing, comp...
research
09/23/2018

On the Maximum of Dependent Gaussian Random Variables: A Sharp Bound for the Lower Tail

Although there is an extensive literature on the maxima of Gaussian proc...
research
05/18/2019

On a Tail Bound for Root-Finding in Randomly Growing Trees

We re-examine a lower-tail upper bound for the random variable X=∏_i=1^∞...
research
12/31/2019

Some compact notations for concentration inequalities and user-friendly results

This paper presents compact notations for concentration inequalities and...

Please sign up or login with your details

Forgot password? Click here to reset