Combinatorial bounds on the α-divergence of univariate mixture models

We derive lower- and upper-bounds of α-divergence between univariate mixture models with components in the exponential family. Three pairs of bounds are presented in order with increasing quality and increasing computational cost. They are verified empirically through simulated Gaussian mixture models. The presented methodology generalizes to other divergence families relying on Hellinger-type integrals.

Paper

Full text

PDF

Combinatorial bounds on the α-divergence of univariate mixture models

Semantic Scholar · Computer Science · 2017

Abstract

We derive lower- and upper-bounds of α-divergence between univariate mixture models with components in the exponential family. Three pairs of bounds are presented in order with increasing quality and increasing computational cost. They are verified empirically through simulated Gaussian mixture models. The presented methodology generalizes to other divergence families relying on Hellinger-type integrals.

Similar papers

© 2026 NYSGPT2525 LLC