Five Proofs of Chernoff's Bound with Applications

Abstract

We discuss five ways of proving Chernoff's bound and show how they lead to different extensions of the basic bound.

16 pages, no figures. This revision slightly updates the presentation of the IK-method

References in corpus (2)

• Subgaussian Tail Bounds via Stability Arguments
• Encoding Arguments

Cited by in corpus (3)

• Q-error Bounds of Random Uniform Sampling for Cardinality Estimation
• K-NN active learning under local smoothness assumption
• K-nn active learning under local smoothness condition