pith. sign in

arxiv: 1801.03365 · v3 · pith:6HNQXNT4new · submitted 2018-01-10 · 💻 cs.DM

Five Proofs of Chernoff's Bound with Applications

classification 💻 cs.DM
keywords boundchernofffiveapplicationsbasicdifferentdiscussextensions
0
0 comments X
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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. General Frameworks for Conditional Two-Sample Testing

    stat.ML 2024-10 unverdicted novelty 6.0

    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.