Five Proofs of Chernoff's Bound with Applications
classification
💻 cs.DM
keywords
boundchernofffiveapplicationsbasicdifferentdiscussextensions
read the original abstract
We discuss five ways of proving Chernoff's bound and show how they lead to different extensions of the basic bound.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
General Frameworks for Conditional Two-Sample Testing
The paper introduces two general frameworks for conditional two-sample testing by converting conditional independence tests or using density ratio estimation to enable marginal comparisons.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.