Hoeffding's lemma

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by 35.2.246.40 (talk) at 20:43, 2 June 2016 (→‎Proof of the lemma). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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 FinnishAmerican 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 and such that almost surely. Then, for all ,


Note that by the assumption that the random variable has zero expectation, the and in the lemma must satisfy and .

Proof of the lemma

(The alternate proof is essentially the same proof with more details fleshed out).

Since is a convex function of , we have

So,

Let , and

Then, since

Taking derivative of ,

for all h.

By Taylor's expansion,

Hence,

(The "alternative proof" below is the same proof with more explanation.)

Alternative proof

First note that if one of or is zero, then and the inequality follows. If both are nonzero, then must be negative and must be positive.

Next, recall that is a convex function on the real line:

Applying to both sides of the above inequality gives us:

Let and define:

is well defined on , to see this we calculate:

The definition of implies

By Taylor's theorem, for every real there exists a between and such that

Note that:

Therefore,

This implies

See also