Binary entropy function

Image:Binary entropy plot.svg|thumbnail|right|200px|Entropy of a Bernoulli trial as a function of binary outcome probability, called the binary entropy function.
In information theory, the binary entropy function, denoted or, is defined as the entropy of a Bernoulli process with probability of one of two values, and is given by the formula:
The base of the logarithm corresponds to the choice of units of information; base corresponds to nats and is mathematically convenient, while base 2 corresponds to shannons and is conventional ; explicitly:
Note that the values at 0 and 1 are given by the limit ; and that "binary" refers to two possible values for the variable, not the units of information.
When, the binary entropy function attains its maximum value of 1 shannon ; this is the case of an unbiased coin flip. When or, the binary entropy is 0, corresponding to no information, since there is no uncertainty in the variable.

Notation

Binary entropy is a special case of, the entropy function. is distinguished from the general entropy function in that the former takes a single real number as a parameter whereas the latter takes a distribution or random variable as a parameter. Thus the binary entropy is the entropy of the particular distribution, so.
Writing the probability of each of the two values being and, so and, this corresponds to
Sometimes the binary entropy function is also written as. However, it is different from and should not be confused with the Rényi entropy, which is also denoted as.

Explanation

In terms of information theory, entropy is considered to be a measure of the uncertainty in a message. To put it intuitively, suppose. At this probability, the event is certain never to occur, and so there is no uncertainty at all, leading to an entropy of 0. If, the result is again certain, so the entropy is 0 here as well. When, the uncertainty is at a maximum; if one were to place a fair bet on the outcome in this case, there is no advantage to be gained with prior knowledge of the probabilities. In this case, the entropy is maximum at a value of 1 bit. Intermediate values fall between these cases; for instance, if, there is still a measure of uncertainty on the outcome, but one can still predict the outcome correctly more often than not, so the uncertainty measure, or entropy, is less than 1 full bit.

Properties

Derivative

The derivative of the binary entropy function may be expressed as the negative of the logit function:
where denotes the given base of the logarithm.

Convex conjugate

The convex conjugate of the binary entropy is the negative softplus function. This is because the derivative of negative binary entropy is the logit, whose inverse function is the logistic function, which is the derivative of softplus.
Softplus can be interpreted as logistic loss, so by duality, minimizing logistic loss corresponds to maximizing entropy. This justifies the principle of maximum entropy as loss minimization.

Taylor series

The Taylor series of the binary entropy function at 1/2 is
which converges to the binary entropy function for all values.

Bounds

The following bounds hold for :
and
where denotes natural logarithm.