Limiting density of discrete points

From Wikipedia, the free encyclopedia
Jump to: navigation, search

In information theory, the limiting density of discrete points is an adjustment to the formula of Claude Shannon for differential entropy.

It was formulated by Edwin Thompson Jaynes to address defects in the initial definition of differential entropy.

Definition[edit]

Shannon originally wrote down the following formula for the entropy of a continuous distribution, known as differential entropy:

H(X)=-\int p(x)\log p(x)\,dx.

Unlike Shannon's formula for the discrete entropy, however, this is not the result of any derivation (Shannon simply replaced the summation symbol in the discrete version with an integral) and it turns out to lack many of the properties that make the discrete entropy a useful measure of uncertainty. In particular, it is not invariant under a change of variables and can even become negative.

Jaynes (1963, 1968) argued that the formula for the continuous entropy should be derived by taking the limit of increasingly dense discrete distributions.[1][2] Suppose that we have a set of n discrete points \{x_i\}, such that in the limit n \to \infty their density approaches a function m(x) called the invariant measure.

 \lim_{n \to \infty}\frac{1}{n}\,(\mbox{number of points in }a<x<b)=\int_a^b m(x)\,dx

Jaynes derived from this the following formula for the continuous entropy, which he argued should be taken as the correct formula:

H(X)=-\int p(x)\log\frac{p(x)}{m(x)}\,dx.

It is formally similar to but conceptually distinct from the (negative of the) Kullback–Leibler divergence or relative entropy, which is comparison measure between two probability distributions. The formula for the Kullback-Leibler divergence is similar, except that the invariant measure m(x) is replaced by a second probability density function q(x). In Jaynes' formula, m(x) is not a probability density but simply a density. In particular it does not have to be normalised so as to sum to 1.

Jaynes' continuous entropy formula and the relative entropy share the property of being invariant under a change of variables, which solves many of the difficulties that come from applying Shannon's continuous entropy formula.

It is the inclusion of the invariant measure m that ensures the formula's invariance under a change of variables, since both m(x) and p(x) must be transformed in the same way.

References[edit]

  1. ^ Jaynes, E. T. (1963). "Information Theory and Statistical Mechanics". In K. Ford. Statistical Physics. Benjamin, New York. p. 181. 
  2. ^ Jaynes, E. T. (1968). "Prior Probabilities". IEEE Trans. on Systems Science and Cybernetics. SSC-4: 227. 
  • Jaynes, E. T. (2003). Probability Theory: The Logic of Science. Cambridge University Press. ISBN 978-0521592710.