Hellinger divergence #
Main definitions #
FooBar
Main statements #
fooBar_unique
Notation #
Implementation details #
Hellinger function, defined as x ↦ (a - 1)⁻¹ * (x ^ a - 1) for a ∈ (0, 1) ∪ (1, + ∞).
At 0 the function is obtained by contiuity and is the indicator function of {0}. At 1 it is
defined as x ↦ x * log x, because in this way we obtain that the Hellinger divergence at 1
conincides with the KL divergence, which is natural for continuity reasons.
Equations
Instances For
Hellinger divergence of order a.
The cases a = 0 and a = 1 are defined separately inside the definition of the Hellinger
function, so that in the case a = 0 we have hellingerDiv 0 μ ν = ν {x | (∂μ/∂ν) x = 0}, and in
the case a = 1 the Hellinger divergence coincides with the KL divergence.
Equations
Instances For
If a ≤ 1 use hellingerDiv_eq_integral_of_integrable_of_le_one or
hellingerDiv_eq_integral_of_le_one, as they have fewer hypotheses.
In this section there are results about the expression ν(α) + (a - 1) * Hₐ(μ, ν),
which appears in the definition of the Renyi divergence.
The Data Processing Inequality for the Hellinger divergence.