Sharp Inequalities for f-divergences
Not on the map. Why?
Abstract (arXiv)
f-divergences are a general class of divergences between probability measures which include as special cases many commonly used divergences in probability, mathematical statistics and information theory such as Kullback-Leibler divergence, chi-squared divergence, squared Hellinger distance, total variation distance etc. In this paper, we study the problem of maximizing or minimizing an f-divergence between two probability measures subject to a finite number of constraints on other f-divergences. We show that these infinite-dimensional optimization problems can all be reduced to optimization problems over small finite dimensional spaces which are tractable. Our results lead to a comprehensive and unified treatment of the problem of obtaining sharp inequalities between f-divergences. We demonstrate that many of the existing results on inequalities between f-divergences can be obtained as special cases of our results and we also improve on some existing non-sharp inequalities.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). First posted on arXiv 2 Feb 2013.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 1.
3 papers.
- 2021Information-Theoretic Bounds on the Moments of the Generalization Error of Learning Algorithmscited by 12
- 2022Chained Generalisation Boundscited by 10
- 2021The Fourier Discrepancy Functioncited by 1
- 2022Chained Generalisation Bounds2 Mar 2022
- 2021The Fourier Discrepancy Function5 Feb 2021
- 2021Information-Theoretic Bounds on the Moments of the Generalization Error of Learning Algorithms3 Feb 2021