Exercise 2.3 (Polynomial Markov versus Chernoff)
Suppose that X≥0, and that the moment generating function of X exists in an interval around zero. Given some δ>0 and integer k=1,2…, show that
k=1,2,…infδkE[∣X∣k]≤λ>0infeλδE[eλX]
Consequently, an optimized bound based on polynomial moments is always at least as good as Chernoff upper bound.
Solution
Let c=infkδkE[∣X∣k]. Then c≤δkE[∣X∣k] for all k.
Since λ>0, we have
ck!λkδk≤k!λkE[∣X∣k].
By the assumption, the moment generating function of X exists, therefore,
ck=1∑∞k!λkδk≤k=1∑∞k!λkE[∣X∣k].
Using the Taylor expansion of an exponential function, we have
c≤eλδE[eλX].
Taking the infimum of k and λ>0 finishes the proof.
Reference
Wainwright, Martin. High-dimensional statistics : a non-asymptotic viewpoint. Cambridge, United Kingdom New York, NY, USA: Cambridge University Press, 2019.
Philips, Thomas & Nelson, Randolph. (1995). The Moment Bound Is Tighter Than Chernoff's Bound for Positive Tail Probabilities. The American Statistician. 49. 175. 10.2307/2684633.
Discussion