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 the first, step, proof and/or bounds:
“Knowledge has two extremes. The first is the pure natural ignorance in which all men find themselves at birth. The other extreme is that reached by great minds, who, having run through all that men can know, find they know nothing, and come back again to that same natural ignorance from which they set out; this is a learned ignorance which is conscious of itself.”
—Blaise Pascal (1623–1662)
“But with one step backward taken
I saved myself from going.
A world torn loose went by me.”
—Robert Frost (1874–1963)
“It comes to pass oft that a terrible oath, with a swaggering accent sharply twanged off, gives manhood more approbation than ever proof itself would have earned him.”
—William Shakespeare (1564–1616)
“Great Wits are sure to Madness near alli’d
And thin Partitions do their Bounds divide;
Else, why should he, with Wealth and Honour blest,
Refuse his Age the needful hours of Rest?”
—John Dryden (1631–1700)