SECTION 01Bernstein’s Condition

Directly computing or bounding the MGF can be impractical. An alternative is to control the polynomial moments of X.

Definition · Bernstein’s Condition

Let X have mean μ = E[X] and variance σ² = E[(X − μ)²]. Bernstein’s condition with parameter b > 0 holds if

|E[(X−μ)k]|≤12k!σ2bk−2,k=2,3,…

Claim · Bernstein’s Condition Implies Sub-Exponentiality

If X satisfies Bernstein’s condition, it is sub-exponential with parameters (ν, α) = (√2σ, 2b).

Proof of the Claim

Expand the exponential. The linear term vanishes because E[X − μ] = 0:

E[eλ(X−μ)]=1+λ2σ22+∑k=3∞λkE[(X−μ)k]k!

Applying Bernstein’s condition term by term gives

E[eλ(X−μ)]≤1+λ2σ22+λ2σ22∑k=3∞(|λ|b)k−2

For |λ| < 1/b, summing the geometric series gives

E[eλ(X−μ)]≤1+λ2σ221−b|λ|≤eλ2σ221−b|λ|

Restricting to |λ| < 1/(2b) makes 1 − b|λ| ≥ 1/2, so

E[eλ(X−μ)]≤eλ2σ2=e(2σ)2λ22

SECTION 02Bernstein-Type Bound

We could apply the preceding sub-exponential tail bound. Keeping the more precise MGF bound from the proof gives a sharper result.

Formulation · Bernstein-Type Bound

For any X satisfying Bernstein’s condition,

E[eλ(X−μ)]≤eλ2σ221−b|λ|,|λ|<1b

The corresponding two-sided concentration bound is

P(|X−μ|≥t)≤2e−t22(σ2+bt),t≥0

SECTION 03Bounded Variables and Comparison with Hoeffding

Example · A Bounded Variable Satisfies Bernstein’s Condition

Suppose |X − μ| ≤ b. For every integer k ≥ 2,

|E[(X−μ)k]|≤E[|X−μ|k]≤bk−2σ2≤k!2σ2bk−2

Thus Bernstein’s condition holds. Hoeffding uses the range [μ − b, μ + b], giving

P(|X−μ|≥t)≤2e−t22b2

Bernstein instead uses the actual variance σ²:

P(|X−μ|≥t)≤2e−t22(σ2+bt)

(1) For small deviations with bt ≪ σ², the Bernstein bound has approximately the Gaussian form 2 exp(−t²/(2σ²)).

(2) Since σ² ≤ b², the variance can be much smaller than the range-based scale b². Bernstein is tighter than the displayed Hoeffding bound when σ² + bt < b², though it is not uniformly tighter for every t.

SECTION 04One-Sided Bounds

A bound on |X| is sufficient for Bernstein’s condition to hold. If we only have a one-sided bound, we can still derive a bound on the corresponding tail.

Formulation · One-Sided Bernstein MGF Bound

Let X have a finite second moment and satisfy X ≤ b almost surely, for some b > 0. Then

E[eλ(X−E[X])]≤eλ22E[X2]1−bλ3,0≤λ<3b

SECTION 05Independent Sums

Formulation · One-Sided Bernstein Tail Bound

For independent variables X₁, …, Xₙ with finite second moments and Xₖ ≤ b almost surely, the MGF bound gives, for δ ≥ 0,

P(∑k=1n(Xk−E[Xk])≥nδ)≤e−nδ22(1n∑k=1nE[Xk2]+bδ3)

SECTION 06Lower Tails of Nonnegative Variables

If a variable is bounded from below, apply the upper-tail result to −X to control its lower tail.

Formulation · Nonnegative Variables

In particular, let Y₁, …, Yₙ be independent nonnegative variables with finite second moments. Then, for δ ≥ 0,

P(∑k=1n(Yk−E[Yk])≤−nδ)≤e−nδ221n∑k=1nE[Yk2]