Convexity of the Kullback–Leibler divergence for mixtures #
For finite measures μ i, ν i on Ω and weights c i ≥ 0, the Kullback–Leibler divergence is
convex in the pair of measures:
klDiv (∑ i, c i • μ i) (∑ i, c i • ν i) ≤ ∑ i, c i * klDiv (μ i) (ν i).
The proof combines the data processing inequality with the integral form of the conditional
divergence. Let β := ∑ i, c i • δ i be the measure with weights c on the index set and let
κ, η be the kernels from the index set given by μ and ν. The two mixtures are the
compositions κ ∘ₘ β and η ∘ₘ β, that is, the images of β ⊗ₘ κ and β ⊗ₘ η under the second
projection, so the data processing inequality bounds klDiv (κ ∘ₘ β) (η ∘ₘ β) by the conditional
divergence klDiv (β ⊗ₘ κ) (β ⊗ₘ η), which is ∫⁻ i, klDiv (κ i) (η i) ∂β.
Main statements #
InformationTheory.klDiv_finsetSum_smul_le,InformationTheory.klDiv_sum_smul_le: convexity ofklDivin the pair of measures, for mixtures indexed by aFinsetand by aFintype;InformationTheory.klDiv_smul_add_smul_le: the same statement for two-point mixtures;InformationTheory.klDiv_finsetSum_smul_left_le,InformationTheory.klDiv_sum_smul_left_le: convexity ofklDivin its first argument;InformationTheory.klDiv_finsetSum_smul_right_le,InformationTheory.klDiv_sum_smul_right_le: convexity ofklDivin its second argument.
Convexity of the Kullback–Leibler divergence in the pair of measures, for a mixture
indexed by a Finset: for finite measures μ i, ν i and weights c i ≥ 0,
klDiv (∑ i ∈ s, c i • μ i) (∑ i ∈ s, c i • ν i) ≤ ∑ i ∈ s, c i * klDiv (μ i) (ν i).
Weights summing to 1 give the convexity of klDiv; no such hypothesis is needed here, since
klDiv is positively homogeneous.
Convexity of the Kullback–Leibler divergence in the pair of measures: for finite measures
μ i, ν i and weights c i ≥ 0,
klDiv (∑ i, c i • μ i) (∑ i, c i • ν i) ≤ ∑ i, c i * klDiv (μ i) (ν i).
Convexity of the Kullback–Leibler divergence in the pair of measures, for a two-point
mixture: for finite measures μ₀, μ₁, ν₀, ν₁ and weights a, b ≥ 0,
klDiv (a • μ₀ + b • μ₁) (a • ν₀ + b • ν₁) ≤ a * klDiv μ₀ ν₀ + b * klDiv μ₁ ν₁.
Convexity of the Kullback–Leibler divergence in its first argument, for a finite mixture
indexed by a Finset: for finite measures μ i, ν and nonnegative weights c i summing to
1, klDiv (∑ i ∈ s, c i • μ i) ν ≤ ∑ i ∈ s, c i * klDiv (μ i) ν.
Convexity of the Kullback–Leibler divergence in its first argument: for finite measures
μ i, ν and nonnegative weights c i summing to 1,
klDiv (∑ i, c i • μ i) ν ≤ ∑ i, c i * klDiv (μ i) ν.
Convexity of the Kullback–Leibler divergence in its second argument, for a finite mixture
indexed by a Finset: for finite measures μ, ν i and nonnegative weights c i summing to
1, klDiv μ (∑ i ∈ s, c i • ν i) ≤ ∑ i ∈ s, c i * klDiv μ (ν i).
Convexity of the Kullback–Leibler divergence in its second argument: for finite measures
μ, ν i and nonnegative weights c i summing to 1,
klDiv μ (∑ i, c i • ν i) ≤ ∑ i, c i * klDiv μ (ν i).