mlsanityData to 7 Oct 2026

An Explicit Expansion of the Kullback-Leibler Divergence along its Fisher-Rao Gradient Flow

arXiv 2302.12229 ↗First posted 23 Feb 2023math.OC stat.MLcited by 16

Not on the map. Why?

Abstract (arXiv)

Let V_* : ℝd → ℝ be some (possibly non-convex) potential function, and consider the probability measure π propto e-V_*. When π exhibits multiple modes, it is known that sampling techniques based on Wasserstein gradient flows of the Kullback-Leibler (KL) divergence (e.g. Langevin Monte Carlo) suffer poorly in the rate of convergence, where the dynamics are unable to easily traverse between modes. In stark contrast, the work of Lu et al. (2019; 2022) has shown that the gradient flow of the KL with respect to the Fisher-Rao (FR) geometry exhibits a convergence rate to π is that textitindependent of the potential function. In this short note, we complement these existing results in the literature by providing an explicit expansion of KL(ρtFR|π) in terms of e-t, where (ρtFR)t≥ 0 is the FR gradient flow of the KL divergence. In turn, we are able to provide a clean asymptotic convergence rate, where the burn-in time is guaranteed to be finite. Our proof is based on observing a similarity between FR gradient flows and simulated annealing with linear scaling, and facts about cumulant generating functions. We conclude with simple synthetic experiments that demonstrate our theoretical findings are indeed tight. Based on our numerics, we conjecture that the asymptotic rates of convergence for Wasserstein-Fisher-Rao gradient flows are possibly related to this expansion in some cases.

Key facts. Cited by 16 papers in the map (data through 7 Oct 2026). Builds on 10 of its 42 references that are in the map. First posted on arXiv 23 Feb 2023.

Builds on

10 of 42 references.

References · 10

  1. 2019Rapid Convergence of the Unadjusted Langevin Algorithm: Isoperimetry Sufficescited by 224
  2. 2015Optimal Entropy-Transport problems and a new Hellinger-Kantorovich distance between positive measurescited by 138
  3. 2018Analysis of Langevin Monte Carlo via convex optimizationcited by 126
  4. 2018Sampling as optimization in the space of measures: The Langevin dynamics as a composite optimization problemcited by 123
  5. 2022Variational inference via Wasserstein gradient flowscited by 84
  6. 2019Sparse Optimization on Measures with Over-parameterized Gradient Descentcited by 50
  7. 2019Accelerating Langevin Sampling with Birth-deathcited by 45
  8. 2022Birth-death dynamics for sampling: Global convergence, approximations and their asymptoticscited by 30
  9. 2023Learning Gaussian Mixtures Using the Wasserstein-Fisher-Rao Gradient Flowcited by 25
  10. 2019Global convergence of neuron birth-death dynamicscited by 22

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 2; 2024: 7; 2025: 5; 2026: 2.

16 papers.

Sort: