In information geometry, a divergence is a kind of statistical distance: a binary function which establishes the separation from one probability distribution to another on a statistical manifold.

The simplest divergence is squared Euclidean distance (SED), and divergences can be viewed as generalizations of SED. The other most important divergence is relative entropy (Kullback–Leibler divergence, KL divergence), which is central to information theory. There are numerous other specific divergences and classes of divergences, notably f-divergences and Bregman divergences (see § Examples).

Definition

Given a differentiable manifold[a] of dimension , a divergence on is a -function satisfying:[1][2]

  1. for all (non-negativity),
  2. if and only if (positivity),
  3. At every point , is a positive-definite quadratic form for infinitesimal displacements from .

In applications to statistics, the manifold is typically the space of parameters of a parametric family of probability distributions.

Condition 3 means that defines an inner product on the tangent space for every . Since is on , this defines a Riemannian metric on .

Locally at , we may construct a local coordinate chart with coordinates , then the divergence is

where is a matrix of size . It is the Riemannian metric at point expressed in coordinates .

Dimensional analysis of condition 3 shows that divergence has the dimension of squared distance.[3]

The dual divergence is defined as

When we wish to contrast against , we refer to as primal divergence.

Given any divergence , its symmetrized version is obtained by averaging it with its dual divergence:[3]

Difference from other similar concepts

Unlike metrics, divergences are not required to be symmetric, and the asymmetry is important in applications.[3] Accordingly, one often refers asymmetrically to the divergence "of q from p" or "from p to q", rather than "between p and q". Secondly, divergences generalize squared distance, not linear distance, and thus do not satisfy the triangle inequality, but some divergences (such as the Bregman divergence) do satisfy generalizations of the Pythagorean theorem.

In general statistics and probability, "divergence" generally refers to any kind of function , where are probability distributions or other objects under consideration, such that conditions 1, 2 are satisfied. Condition 3 is required for "divergence" as used in information geometry.

As an example, the total variation distance, a commonly used statistical divergence, does not satisfy condition 3.

Notation

Notation for divergences varies significantly between fields, though there are some conventions.

Divergences are generally notated with an uppercase 'D', as in , to distinguish them from metric distances, which are notated with a lowercase 'd'. When multiple divergences are in use, they are commonly distinguished with subscripts, as in for Kullback–Leibler divergence (KL divergence).

Often a different separator between parameters is used, particularly to emphasize the asymmetry. In information theory, a double bar is commonly used: ; this is similar to, but distinct from, the notation for conditional probability, , and emphasizes interpreting the divergence as a relative measurement, as in relative entropy; this notation is common for the KL divergence. A colon may be used instead,[b] as ; this emphasizes the relative information supporting the two distributions.

The notation for parameters varies as well. Uppercase interprets the parameters as probability distributions, while lowercase or interprets them geometrically as points in a space, and or interprets them as measures.

Geometrical properties

Further information: Information geometry

Many properties of divergences can be derived if we restrict S to be a statistical manifold, meaning that it can be parametrized with a finite-dimensional coordinate system θ, so that for a distribution pS we can write p = p(θ).

For a pair of points p, qS with coordinates θp and θq, denote the partial derivatives of D(p, q) as

Now we restrict these functions to a diagonal p = q, and denote [4]

By definition, the function D(p, q) is minimized at p = q, and therefore

where matrix g(D) is positive semi-definite and defines a unique Riemannian metric on the manifold S.

Divergence D(·, ·) also defines a unique torsion-free affine connection(D) with coefficients

and the dual to this connection ∇* is generated by the dual divergence D*.

Thus, a divergence D(·, ·) generates on a statistical manifold a unique dualistic structure (g(D), ∇(D), ∇(D*)). The converse is also true: every torsion-free dualistic structure on a statistical manifold is induced from some globally defined divergence function (which however need not be unique).[5]

For example, when D is an f-divergence[6] for some function ƒ(·), then it generates the metric g(Df) = c·g and the connection (Df) = ∇(α), where g is the canonical Fisher information metric, ∇(α) is the α-connection, c = ƒ′′(1), and α = 3 + 2ƒ′′′(1)/ƒ′′(1).

Examples

The two most important divergences are the relative entropy (Kullback–Leibler divergence, KL divergence), which is central to information theory and statistics, and the squared Euclidean distance (SED). Minimizing these two divergences is the main way that linear inverse problem are solved, via the principle of maximum entropy and least squares, notably in logistic regression and linear regression.[7]

The two most important classes of divergences are the f-divergences and Bregman divergences; however, other types of divergence functions are also encountered in the literature. The only divergence that is both an f-divergence and a Bregman divergence is the Kullback–Leibler divergence;[8] the squared Euclidean divergence is a Bregman divergence (corresponding to the function ), but not an f-divergence.

f-divergences

Main article: f-divergence

Given convex function such that , the f-divergence generated by is defined as

Kullback–Leibler divergence:
squared Hellinger distance:
Jensen–Shannon divergence:
α-divergence
chi-squared divergence:
(α,β)-product divergence[citation needed]:

Bregman divergences

Main article: Bregman divergence

Bregman divergences correspond to convex functions on convex sets. Given a strictly convex, continuously-differentiable function F on a convex set, known as the Bregman generator, the Bregman divergence measures the convexity of: the error of the linear approximation of F from q as an approximation of the value at p:

The dual divergence to a Bregman divergence is the divergence generated by the convex conjugate F* of the Bregman generator of the original divergence. For example, for the squared Euclidean distance, the generator is , while for the relative entropy the generator is the negative entropy .

History

The use of the term "divergence" – both what functions it refers to, and what various statistical distances are called – has varied significantly over time, but by c. 2000 had settled on the current usage within information geometry, notably in the textbook Amari & Nagaoka (2000).[1]

The term "divergence" for a statistical distance was used informally in various contexts from c. 1910 to c. 1940. Its formal use dates at least to Bhattacharyya (1943), entitled "On a measure of divergence between two statistical populations defined by their probability distributions", which defined the Bhattacharyya distance, and Bhattacharyya (1946), entitled "On a Measure of Divergence between Two Multinomial Populations", which defined the Bhattacharyya angle. The term was popularized by its use for the Kullback–Leibler divergence in Kullback & Leibler (1951) and its use in the textbook Kullback (1959). The term "divergence" was used generally by Ali & Silvey (1966) for statistically distances. Numerous references to earlier uses of statistical distances are given in Adhikari & Joshi (1956) and Kullback (1959, pp. 6–7, 1.3 Divergence).

Kullback & Leibler (1951) actually used "divergence" to refer to the symmetrized divergence (this function had already been defined and used by Harold Jeffreys in 1948[9]), referring to the asymmetric function as "the mean information for discrimination ... per observation",[10] while Kullback (1959) referred to the asymmetric function as the "directed divergence".[11] Ali & Silvey (1966) referred generally to such a function as a "coefficient of divergence", and showed that many existing functions could be expressed as f-divergences, referring to Jeffreys' function as "Jeffreys' measure of divergence" (today "Jeffreys divergence"), and Kullback–Leibler's asymmetric function (in each direction) as "Kullback's and Leibler's measures of discriminatory information" (today "Kullback–Leibler divergence").[12]

The information geometry definition of divergence (the subject of this article) was initially referred to by alternative terms, including "quasi-distance" Amari (1982, p. 369) and "contrast function" Eguchi (1985), though "divergence" was used in Amari (1985) for the α-divergence, and has become standard for the general class.[1][2]

The term "divergence" is in contrast to a distance (metric), since the symmetrized divergence does not satisfy the triangle inequality.[13] For example, the term "Bregman distance" is still found, but "Bregman divergence" is now preferred.

Notationally, Kullback & Leibler (1951) denoted their asymmetric function as , while Ali & Silvey (1966) denote their functions with a lowercase 'd' as .

See also

Notes

  1. ^ Throughout, we only require differentiability class C2 (continuous with continuous first and second derivatives), since only second derivatives are required. In practice, commonly used statistical manifolds and divergences are infinitely differentiable ("smooth").
  2. ^ A colon is used in Kullback & Leibler (1951, p. 80), where the KL divergence between measure and is written as .

References

  1. ^ a b c Amari & Nagaoka 2000, chapter 3.2.
  2. ^ a b Amari 2016, p. 10, Definition 1.1.
  3. ^ a b c Amari 2016, p. 10.
  4. ^ Eguchi (1992)
  5. ^ Matumoto (1993)
  6. ^ Nielsen, F.; Nock, R. (2013). "On the Chi square and higher-order Chi distances for approximating f-divergences". IEEE Signal Processing Letters. 21: 10–13. arXiv:1309.3029. doi:10.1109/LSP.2013.2288355.
  7. ^ Csiszár 1991.
  8. ^ Jiao, Jiantao; Courtade, Thomas; No, Albert; Venkat, Kartik; Weissman, Tsachy (December 2014). "Information Measures: the Curious Case of the Binary Alphabet". IEEE Transactions on Information Theory. 60 (12): 7616–7626. doi:10.1109/TIT.2014.2360184. ISSN 0018-9448.
  9. ^ Jeffreys 1948, p. 158.
  10. ^ Kullback & Leibler 1951, p. 80.
  11. ^ Kullback 1959, p. 7.
  12. ^ Ali & Silvey 1966, p. 139.
  13. ^ Kullback 1959, p. 6.

Bibliography