Hellinger distance on a finite type #
The Bhattacharyya coefficient ∑ a, √(μ {a} · ν {a}) of two measures on a finite type, the
squared Hellinger distance 1 - BC, and the Hellinger distance √(1 - BC). For probability
measures the coefficient lies in [0, 1], so the Hellinger distance is bounded by 1 where the
Kullback–Leibler divergence may be infinite. Mathlib has no Hellinger distance; [UPSTREAM]
candidate for Mathlib/InformationTheory/.
The Bhattacharyya coefficient ∑ a, √(μ {a} · ν {a}).
Equations
- InformationTheory.bhattacharyyaCoeff μ ν = ∑ a : α, √(μ.real {a} * ν.real {a})
Instances For
The squared Hellinger distance 1 - BC(μ, ν).
Equations
Instances For
The Hellinger distance √(1 - BC(μ, ν)).
Equations
Instances For
For probability measures the Bhattacharyya coefficient is at most 1, by the
arithmetic–geometric mean inequality on each atom.
The Bhattacharyya coefficient against a Dirac mass is the square root of the other measure's mass at the atom.
The Hellinger distance from a Dirac mass is determined by the other measure's mass at the
atom: 1 where that mass vanishes.