The Hellinger distance is the square root of a constant multiple of . Common conventions use either the factor or .
The scalar inequality , applied to and integrated against , gives . The right side is the unnormalized squared Hellinger distance. Infinite divergence and zero density regions are handled by the usual extended-integral conventions.
The Hellinger affinity of dominated probability measures is the integral of the geometric mean of their probability density functions. It lies in by Cauchy-Schwarz inequality. The unnormalized squared Hellinger distance is times this affinity; this identity makes the relation with relative entropy particularly simple.
For the unnormalized Hellinger distance, . Factor and use the Cauchy-Schwarz inequality to bound the total variation distance. For the other bound, gives , whose integral is the squared unnormalized Hellinger distance. Infinite Kullback-Leibler divergence is allowed.
The Hellinger distance convention , with no factor , for densities under a common dominating measure. Its range is . This convention makes hold with the displayed constants.
If is a measurable function into a separable Banach space and has finite second moments under probability measures , then their Bochner integral expected values satisfy
Here the Hellinger distance includes the factor in its square. For a proof, use , , and . Apply the norm bound for a Bochner integral and the Cauchy-Schwarz inequality to , then use . This explains why stability of a Bayesian posterior in Hellinger distance controls posterior expected values when the relevant second moments remain bounded.
With the convention , the Hellinger distance between two normal distributions with is
To prove it, integrate the geometric mean of their probability density functions. Completing the square makes that geometric mean the density of a normal distribution times the displayed prefactor and exponential. For example, writing , that normal distribution has mean and variance . The identity then proves the formula.
For equal unit variances, this becomes . More generally, put and . Then , , and , proving

Articles by others on the same topic (0)

There are currently no matching articles.