When Fourth Moments Are Enough
Abstract
This note concerns a somewhat innocent question motivated by an observation concerning the use of Chebyshev bounds on sample estimates of p in the binomial distribution with parameters n,p. Namely, what moment order produces the best Chebyshev estimate of p? If Sn(p) has a binomial distribution with parameters n,p, there it is readily observed that argmax0 p 1 ESn2(p) = argmax0 p 1np(1-p) = 12, and ESn2(12) = n4. Rabi Bhattacharya observed that while the second moment Chebyshev sample size for a 95\% confidence estimate within 5 percentage points is n = 2000, the fourth moment yields the substantially reduced polling requirement of n = 775. Why stop at fourth moment? Is the argmax achieved at p = 12 for higher order moments and, if so, does it help, and compute ESn2m(12)? As captured by the title of this note, answers to these questions lead to a simple rule of thumb for best choice of moments in terms of an effective sample size for Chebyshev concentration inequalities.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.