Hoeffding's lemma
In probability theory, Hoeffding's lemma is an inequality that bounds the moment-generating function of any bounded random variable. It is named after the Finnish–American mathematical statistician Wassily Hoeffding.
The proof of Hoeffding's lemma uses Taylor's theorem and Jensen's inequality. Hoeffding's lemma is itself used in the proof of McDiarmid's inequality.
Statement of the lemma
Let X be any real-valued random variable with expected value E[X] = 0 and such that a ≤ X ≤ b almost surely. Then, for all λ ∈ R,
Note that by the assumption that the random variable has zero expectation, the and in the lemma must satisfy and .
Proof of the lemma
Since is a convex function of x, we have
So,
Let , and
Then, since
Taking derivative of ,
By Taylor's expansion,
Hence,
(The "alternative proof" below is the same proof with more explanation.)
Alternative proof
First note that if one of a or b is zero, then and the inequality follows. If both are nonzero, then a must be negative and b must be positive.
Next, recall that esx is a convex function on the real line:
Applying E[ ⋅ ] to both sides of the above inequality gives us:
Let u = s(b − a) and define:
φ is well defined on R, to see this we calculate:
The definition of φ implies
By Taylor's theorem, for every real u there exists a v between 0 and u such that
Note that:
Therefore,
This implies