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 such that $a \leq X \leq b$ almost surely, i.e. with probability one. Then, for all $\lambda \in \mathbb$,

:\mathbb \left e^ \right\leq \exp \Big(\lambda\mathbb \frac \Big),

or equivalently,

:\mathbb \left e^ \right\leq \exp \Big(\frac \Big).

Proof

Without loss of generality, by replacing $X$ by X - \mathbb /math>, we can assume \mathbb = 0, so that $a \leq 0 \leq b$.

Since $e^$ is a convex function of $x$, we have that for all x \in ,b/math>,

:$e^\leq \frace^+\frace^$

So,
:\begin
\mathbb\left ^\right&\leq \frace^+\frace^\\
&= \frace^ + \frace^ \\
&= e^,
\end

where $L(h)= \frac+\ln(1 + \frac)$. By computing derivatives, we find

:$L(0)=L'(0)=0$ and $L''(h)= -\frac$.

From the AMGM inequality we thus see that $L''(h)\le\frac14$ for all $h$, and thus, from Taylor's theorem, there is some $0 \le \theta \le 1$ such that

:$L(h) = L(0) + h L'(0) + \frac h^2 L''(h\theta) \leq \frach^2.$

Thus, \mathbb\left ^\right\leq e^.

See also

*Hoeffding's inequality
* Bennett's inequality

Notes

Probabilistic inequalities

{{probability-stub