Hellinger distance explained

In probability and statistics, the Hellinger distance (closely related to, although different from, the Bhattacharyya distance) is used to quantify the similarity between two probability distributions. It is a type of f-divergence. The Hellinger distance is defined in terms of the Hellinger integral, which was introduced by Ernst Hellinger in 1909.

It is sometimes called the Jeffreys distance.^{[1] [2]}

Definition

Measure theory

To define the Hellinger distance in terms of measure theory, let

P and Q denote two probability measures on a measure space l{X} that are absolutely continuous with respect to an auxiliary measure λ . Such a measure always exists, e.g λ = (P + Q) . The square of the Hellinger distance between P and Q is defined as the quantityH ^{2(P,Q)} = (1)/(2) \displaystyle \int _{l{X} } \left(\sqrt - \sqrt\right)^2 \lambda(dx).

Here,

P(dx) = p(x) λ (dx) and Q(dx) = q(x) λ (dx) , i.e. p and q are the Radon–Nikodym derivatives of P and Q respectively with respect to λ . This definition does not depend on λ , i.e. the Hellinger distance between P and Q does not change if λ is replaced with a different probability measure with respect to which both P and Q are absolutely continuous. For compactness, the above formula is often written asH ^{2(P,Q)} = (1)/(2) \int _{l{X} } \left(\sqrt - \sqrt\right)^2.

Probability theory using Lebesgue measure

To define the Hellinger distance in terms of elementary probability theory, we take λ to be the Lebesgue measure, so that dP / dλ and dQ / dλ are simply probability density functions. If we denote the densities as f and g, respectively, the squared Hellinger distance can be expressed as a standard calculus integral

H ^{2(f,g)} = (1)/(2) \int \left(\sqrt{f(x)} - \sqrt{g(x)}\right) ^{2} dx = 1 - \int \sqrt{f(x) g(x)} dx,

where the second form can be obtained by expanding the square and using the fact that the integral of a probability density over its domain equals 1.

The Hellinger distance H(P, Q) satisfies the property (derivable from the Cauchy–Schwarz inequality)

0 \le H(P,Q) \le 1 .

Discrete distributions

For two discrete probability distributions

P = (p _{1,} \ldots, p _{k)} and Q = (q _{1,} \ldots, q _{k)} ,their Hellinger distance is defined asH(P, Q) = (1)/(\sqrt{ 2) } \; \sqrt,

which is directly related to the Euclidean norm of the difference of the square root vectors, i.e.

H(P, Q) = (1)/(\sqrt{ 2) } \; \bigl\|\sqrt - \sqrt \bigr\|_2 .

Also,

1 - H ^{2(P,Q)} = \sum ^{k} _{i =1} \sqrt{p _{i} q _{i}.}

Properties

The Hellinger distance forms a bounded metric on the space of probability distributions over a given probability space.

The maximum distance 1 is achieved when P assigns probability zero to every set to which Q assigns a positive probability, and vice versa.

Sometimes the factor

1 / 2 in front of the integral is omitted, in which case the Hellinger distance ranges from zero to the square root of two.BC(P,Q) as it can be defined asH(P,Q) = \sqrt{ 1 - BC(P,Q)}.

Hellinger distances are used in the theory of sequential and asymptotic statistics.^{[3] [4]}

The squared Hellinger distance between two normal distributions

P \sim l{N}(\mu _{1,\sigma} ^{2 )} ^{1} and Q \sim l{N}(\mu _{2,\sigma} ^{2 )} ^{2} is:H ^{2(P,} Q) = 1 - \sqrt{ (2 \sigma _{1\sigma} _{2})/(\sigma ^{2} _{2}) } \, e^.

The squared Hellinger distance between two multivariate normal distributions

P \sim l{N}(\mu _{1,\Sigma} _{1)} and Q \sim l{N}(\mu _{2,\Sigma} _{2)} is ^[5] H ^{2(P,} Q) = 1 - (\det (\Sigma ^{1 / 4} _{1 )} \det (\Sigma ^{1 / 4} _{2 )})/(\exp\left\{ - \det \left( (\Sigma _{1} + \Sigma _{2})/(2) \right) ^{1/2}) (1)/(8) (\mu _{1} - \mu ^{T} _{2 )} \left( (\Sigma _{1} + \Sigma _{2})/(2) \right) ^{-1} (\mu _{1} - \mu _{2)} \right\}

The squared Hellinger distance between two exponential distributions

P \sim Exp (\alpha) and Q \sim Exp (\beta) is:H ^{2(P,} Q) = 1 - (2 \sqrt{\alpha \beta)/() }.

The squared Hellinger distance between two Weibull distributions

P \sim W (k,\alpha) and Q \sim W (k,\beta) (where k is a common shape parameter and \alpha , \beta are the scale parameters respectively):H ^{2(P,} Q) = 1 - (2 (\alpha \beta) ^{k/2})/(\alpha ^{k} + \beta ^{k}) .

The squared Hellinger distance between two Poisson distributions with rate parameters

\alpha and \beta , so that P \sim Poisson (\alpha) and Q \sim Poisson (\beta) , is:H ^{2(P,Q)} = 1- e ^{- (1)/((\sqrt{\alpha 2)} - \sqrt{\beta}) ^{2}.}

The squared Hellinger distance between two beta distributions

P \sim Beta (a _{1,b} _{1)} and Q \sim Beta (a _{2,} b _{2)} is:H ^{2(P,Q)} = 1 - (B\left( (a _{1} + a _{2})/(, (b _{1} + b _{2})/(2) \right) 2))/(\sqrt{B(a _{1,} b _{1)} B(a _{2,} b _{2)}) }where B is the beta function.

The squared Hellinger distance between two gamma distributions

P \sim Gamma (a _{1,b} _{1)} and Q \sim Gamma (a _{2,} b _{2)} is:H ^{2(P,Q)} = 1 - \Gamma\left({\scriptstyle (a _{1} + a _{2})/(2) }\right)\left(\frac\right)^\sqrtwhere \Gamma is the gamma function.

Connection with total variation distance

The Hellinger distance

H(P,Q) and the total variation distance (or statistical distance) \delta(P,Q) are related as follows:^[6] H ^{2(P,Q)} \leq \delta(P,Q) \leq \sqrt{ 2 }H(P,Q).

The constants in this inequality may change depending on which renormalization you choose (

1 / 2 or 1 /\sqrt{ 2 } ).

These inequalities follow immediately from the inequalities between the 1-norm and the 2-norm.

See also

• Statistical distance
• Kullback–Leibler divergence
• Bhattacharyya distance
• Total variation distance
• Fisher information metric

References

• Book: Yang, Grace Lo . Grace Yang . Le Cam, Lucien M. . Asymptotics in Statistics: Some Basic Concepts . Springer . Berlin . 2000 . 0-387-95036-2 .
• Book: Vaart, A. W. van der . Asymptotic Statistics (Cambridge Series in Statistical and Probabilistic Mathematics) . 19 June 2000 . Cambridge University Press . Cambridge, UK . 0-521-78450-6 .
• Book: Pollard, David E. . A user's guide to measure theoretic probability . Cambridge University Press . Cambridge, UK . 2002 . 0-521-00289-3 .

Notes and References

1. Web site: Jeffreys distance - Encyclopedia of Mathematics . 2022-05-24 . encyclopediaofmath.org . en.
2. 1946-09-24 . An invariant form for the prior probability in estimation problems . Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences . 186 . 1007 . 453–461 . 10.1098/rspa.1946.0056 . 20998741 . 1946RSPSA.186..453J . 0080-4630. Jeffreys . Harold . 19490929 . free .
3. Book: Torgerson, Erik . 1991 . Comparison of Statistical Experiments . 36 . Encyclopedia of Mathematics . Cambridge University Press .
4. Book: Liese, Friedrich . Miescke, Klaus-J. . Statistical Decision Theory: Estimation, Testing, and Selection . 2008 . Springer . 978-0-387-73193-3 .
5. Book: Pardo, L. . 2006 . Statistical Inference Based on Divergence Measures . New York . Chapman and Hall/CRC . 51 . 1-58488-600-5 .
6. Web site: Lecture notes on communication complexity . September 23, 2011 . Prahladh . Harsha .