A Global Characterization of $f$-Divergences Yielding PSD Mutual-Information Matrices
Zachary Robertson

TL;DR
This paper characterizes when pairwise $f$-mutual information matrices form positive semi-definite kernels, revealing the divergence properties that determine their PSD nature across finite-alphabet variables.
Contribution
It provides a complete characterization of convex $f$-divergences that produce PSD mutual-information matrices, including necessary and sufficient conditions.
Findings
The normalized generator must have a nonnegative power series expansion around 1.
Shannon mutual information and Jensen-Shannon divergence do not produce PSD matrices.
Chi-squared divergence always yields a PSD mutual-information matrix.
Abstract
Given random variables, when does the matrix of pairwise -mutual informations define a PSD kernel over variables? For convex finite generators with and finite boundary value , we give a closed characterization up to linear transformation , which leaves every -divergence and every -mutual-information matrix unchanged. The matrix is PSD for every finite-alphabet family if and only if the normalized representative has a globally convergent expansion , with , on all of . Sufficiency follows from a replica embedding for monomial generators plus closure under nonnegative mixtures. Necessity first extracts the local Taylor cone at using biased three-point kernels , the Belton--Guillot--Khare--Putinar (BGKP) low-rank Hankel…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
