Chernoff information for complementary Bernoulli distributions

ID: chernoff-information-for-complementary-bernoulli-distributions

Let be the Bernoulli distribution with success probability and the Bernoulli distribution with success probability . For ,
The two summands have product . Their arithmetic mean is at least their geometric mean, with equality at . Thus
The same argument gives for complementary parameters . At the laws agree and .
Figure 1.
Chernoff affinity and Chernoff information for two complementary coin laws
. Original computed example, with success probabilities and . The affinity is minimized at ; the best negative-log affinity is . Details.
With equal prior probabilities, count the successes among observations. The likelihood ratio is , so choose when and when . If is even, either decision or a fair tie randomization gives the same average error at . Under , has the binomial distribution with parameters . Symmetry therefore gives the exact optimal average error
The last term applies only for even ; it represents half the tie probability. Direct finite sums give , and . Twenty observations reduce the optimal average error to about 0.158%. The finite-sample Chernoff error bound at is , a guarantee rather than the exact error.
Figure 2.
Exact repeated-coin error, the finite-sample Chernoff error bound, and the limiting error exponent
. Original finite-binomial calculations under two fixed independent coin laws with equal priors. The first panel uses a logarithmic scale. The normalized negative log error approaches ; finite-sample error need not equal the simple exponential. Details.
Reducing the exact error from to illustrates the value of repeated evidence. The example assumes a single fixed coin law throughout the experiment. If repeated sensor readings share an unmodelled common error, increasing their number need not supply this much independent information.

New to topics? Read the docs here!