DeepAI AI Chat
Log In Sign Up

A Note on the Chernoff Bound for Random Variables in the Unit Interval

by   Andrew Y. K. Foong, et al.
University of Cambridge

The Chernoff bound is a well-known tool for obtaining a high probability bound on the expectation of a Bernoulli random variable in terms of its sample average. This bound is commonly used in statistical learning theory to upper bound the generalisation risk of a hypothesis in terms of its empirical risk on held-out data, for the case of a binary-valued loss function. However, the extension of this bound to the case of random variables taking values in the unit interval is less well known in the community. In this note we provide a proof of this extension for convenience and future reference.


page 1

page 2

page 3


The Littlewood-Offord Problem for Markov Chains

The celebrated Littlewood-Offord problem asks for an upper bound on the ...

A Constructive Proof of a Concentration Bound for Real-Valued Random Variables

Almost 10 years ago, Impagliazzo and Kabanets (2010) gave a new combinat...

Deterministic Finite-Memory Bias Estimation

In this paper we consider the problem of estimating a Bernoulli paramete...

A Note on High-Probability versus In-Expectation Guarantees of Generalization Bounds in Machine Learning

Statistical machine learning theory often tries to give generalization g...

A new method for constructing continuous distributions on the unit interval

A novel approach towards construction of absolutely continuous distribut...

Statistical optimality conditions for compressive ensembles

We present a framework for the theoretical analysis of ensembles of low-...