The First Step in The Proof of Chernoff Bounds
The Chernoff bound for a random variable X, which is the sum of n independent random variables, is obtained by applying etX for some well-chosen value of t. This method was first applied by Sergei Bernstein to prove the related Bernstein inequalities.
From Markov's inequality and using independence we can derive the following useful inequality:
For any t > 0,
In particular optimizing over t and using independence we obtain,
-
(1)
Similarly,
and so,
Read more about this topic: Chernoff Bound
Famous quotes containing the words step, proof and/or bounds:
“We can rejoice that the time has arrived when millions of Negro Americans can step out of the shadows, and walk forthrightly into the bright sunshine of human rights.”
—Hubert H. Humphrey (19111978)
“The proof of a poet is that his country absorbs him as affectionately as he has absorbed it.”
—Walt Whitman (18191892)
“Firmness yclept in heroes, kings and seamen,
That is, when they succeed; but greatly blamed
As obstinacy, both in men and women,
Wheneer their triumph pales, or star is tamed
And twill perplex the casuist in morality
To fix the due bounds of this dangerous quality.”
—George Gordon Noel Byron (17881824)