KALE Flow: A Relaxed KL Gradient Flow for Probabilities with Disjoint Support
Pierre Glaser, Michael Arbel, Arthur Gretton
Abstract
We study the gradient flow for a relaxed approximation to the Kullback-Leibler (KL) divergence between a moving source and a fixed target distribution. This approximation, termed the KALE (KL approximate lower-bound estimator), solves a regularized version of the Fenchel dual problem defining the KL over a restricted class of functions. When using a Reproducing Kernel Hilbert Space (RKHS) to define the function class, we show that the KALE continuously interpolates between the KL and the Maximum Mean Discrepancy (MMD). Like the MMD and other Integral Probability Metrics, the KALE remains well defined for mutually singular distributions. Nonetheless, the KALE inherits from the limiting KL a greater sensitivity to mismatch in the support of the distributions, compared with the MMD. These two properties make the KALE gradient flow particularly well suited when the target distribution is supported on a low-dimensional manifold. Under an assumption of sufficient smoothness of the trajectories, we show the global convergence of the KALE flow. We propose a particle implementation of the flow given initial samples from the source and the target distribution, which we use to empirically confirm the KALE's properties.
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.
Cited by top-tier papers13
- A Rigorous Link between Deep Ensembles and (Variational) Bayesian MethodsVeit David Wild, Sahra Ghalebikesabi, Dino Sejdinovic, Jeremias KnoblauchNeurIPS 2023 · 40 citations
- Generative Sliced MMD Flows with Riesz KernelsJohannes Hertrich, Christian Wald, Fabian Altekrüger, Paul HagemannICLR 2024 · 40 citations
- Unifying GANs and Score-Based Diffusion as Generative Particle ModelsJean-Yves Franceschi, Mike Gartrell, Ludovic Dos Santos, Thibaut Issenhuth et al.NeurIPS 2023 · 32 citations
- Scalable Wasserstein Gradient Flow for Generative Modeling through Unbalanced Optimal TransportJaemoo Choi, Jaewoong Choi, Myungjoo KangICML 2024 · 20 citations
- Gradual Domain Adaptation via Gradient FlowZhan Zhuang, Yu Zhang, Ying WeiICLR 2024 · 15 citations
Builds on5
- Generalized Energy Based ModelsMichael Arbel, Liang Zhou, Arthur GrettonICLR 2021 · 254 citations
- Efficient constrained sampling via the mirror-Langevin algorithmKwangjun Ahn, Sinho ChewiNeurIPS 2021 · 77 citations
- Primal Dual Interpretation of the Proximal Stochastic Gradient Langevin AlgorithmAdil Salim, Peter RichtárikNeurIPS 2020 · 53 citations
- Unbalanced Sobolev DescentYoussef Mroueh, Mattia RigottiNeurIPS 2020 · 19 citations
- Synchronizing Probability Measures on Rotations via Optimal TransportTolga Birdal, Michael Arbel, Umut Simsekli, Leonidas J. GuibasCVPR 2020
Related papers
- Stationary MMD PointsZonghao Chen, Toni Karvonen, Heishiro Kanagawa, Francois-Xavier Briol et al.ICML 2026
- Statistical and Geometrical properties of the Kernel Kullback-Leibler divergenceAnna Korba, Francis R. Bach, Clémentine ChazalNeurIPS 2024 · 5 citations
- Interaction-Force Transport Gradient FlowsEgor Gladin, Pavel E. Dvurechenskii, Alexander Mielke, Jia-Jie ZhuNeurIPS 2024 · 7 citations
- Accurate Quantization of Measures via Interacting Particle-based OptimizationLantian Xu, Anna Korba, Dejan SlepcevICML 2022 · 18 citations
- A Non-Asymptotic Analysis for Stein Variational Gradient DescentAnna Korba, Adil Salim, Michael Arbel, Giulia Luise et al.NeurIPS 2020 · 102 citations
