Lune

NeurIPS2023Top-tier venue

On the Properties of Kullback-Leibler Divergence Between Multivariate Gaussian Distributions

Yufeng Zhang, Jialu Pan, Li Ken Li, Wanwei Liu, Zhenbang Chen, Xinwang Liu, Ji Wang

2023Year
67Citations
4Top-tier citations

Abstract

Kullback-Leibler (KL) divergence is one of the most important divergence measures between probability distributions. In this paper, we prove several properties of KL divergence between multivariate Gaussian distributions. First, for any two nn-dimensional Gaussian distributions N1\mathcal{N}_1 and N2\mathcal{N}_2, we give the supremum of KL(N1∣∣N2)KL(\mathcal{N}_1||\mathcal{N}_2) when KL(N2∣∣N1)≤ε (ε>0)KL(\mathcal{N}_2||\mathcal{N}_1)\leq \varepsilon\ (\varepsilon>0). For small ε\varepsilon, we show that the supremum is ε+2ε1.5+O(ε2)\varepsilon + 2\varepsilon^{1.5} + O(\varepsilon^2). This quantifies the approximate symmetry of small KL divergence between Gaussians. We also find the infimum of KL(N1∣∣N2)KL(\mathcal{N}_1||\mathcal{N}_2) when KL(N2∣∣N1)≥M (M>0)KL(\mathcal{N}_2||\mathcal{N}_1)\geq M\ (M>0). We give the conditions when the supremum and infimum can be attained. Second, for any three nn-dimensional Gaussians N1\mathcal{N}_1, N2\mathcal{N}_2, and N3\mathcal{N}_3, we find an upper bound of KL(N1∣∣N3)KL(\mathcal{N}_1||\mathcal{N}_3) if KL(N1∣∣N2)≤ε1KL(\mathcal{N}_1||\mathcal{N}_2)\leq \varepsilon_1 and KL(N2∣∣N3)≤ε2KL(\mathcal{N}_2||\mathcal{N}_3)\leq \varepsilon_2 for ε1,ε2≥0\varepsilon_1,\varepsilon_2\ge 0. For small ε1\varepsilon_1 and ε2\varepsilon_2, we show the upper bound is 3ε1+3ε2+2ε1ε2+o(ε1)+o(ε2)3\varepsilon_1+3\varepsilon_2+2\sqrt{\varepsilon_1\varepsilon_2}+o(\varepsilon_1)+o(\varepsilon_2). This reveals that KL divergence between Gaussians follows a relaxed triangle inequality. Importantly, all the bounds in the theorems presented in this paper are independent of the dimension nn. Finally, We discuss the applications of our theorems in explaining counterintuitive phenomenon of flow-based model, deriving deep anomaly detection algorithm, and extending one-step robustness guarantee to multiple steps in safe reinforcement learning.

Ask about this paper

Your agent reads all of it.

Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.

Questions to start from

Your agent calls

Luneget_paper_fulltext

Ask in Lune

Free to start. No credit card required.

lune papers fulltext 10530d32-644b-4261-901b-506f0e13a48a

Cited by top-tier papers4

Ask how each one uses it

Builds on3

Related papers

Dusk over the sea between two cliffs drawn in fine vertical lines