Approximate inference with Wasserstein gradient flows
Not on the map. Why?
Abstract (arXiv)
We present a novel approximate inference method for diffusion processes, based on the Wasserstein gradient flow formulation of the diffusion. In this formulation, the time-dependent density of the diffusion is derived as the limit of implicit Euler steps that follow the gradients of a particular free energy functional. Existing methods for computing Wasserstein gradient flows rely on discretization of the domain of the diffusion, prohibiting their application to domains in more than several dimensions. We propose instead a discretization-free inference method that computes the Wasserstein gradient flow directly in a space of continuous functions. We characterize approximation properties of the proposed method and evaluate it on a nonlinear filtering task, finding performance comparable to the state-of-the-art for filtering diffusions.
Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). First posted on arXiv 12 Jun 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 6; 2022: 3; 2023: 2; 2024: 1.
12 papers.
- 2021Large-Scale Wasserstein Gradient Flowscited by 76
- 2021Optimizing Functionals on the Space of Probabilities with Input Convex Neural Networkscited by 53
- 2021Variational Wasserstein gradient flowcited by 53
- 2021Sqrt(d) Dimension Dependence of Langevin Monte Carlocited by 25
- 2024Scalable Wasserstein Gradient Flow for Generative Modeling through Unbalanced Optimal Transportcited by 22
- 2021Efficient Gradient Flows in Sliced-Wasserstein Spacecited by 21
- 2022Mean-field Variational Inference via Wasserstein Gradient Flowcited by 19
- 2021Wasserstein Proximal of GANscited by 15
- 2023Dynamic Flows on Curved Space Generated by Labeled Datacited by 10
- 2022Optimal Neural Network Approximation of Wasserstein Gradient Direction via Convex Optimizationcited by 9
- 2023Adaptive Annealed Importance Sampling with Constant Rate Progresscited by 7
- 2022Proximal Mean Field Learning in Shallow Neural Networkscited by 1
- 2024Scalable Wasserstein Gradient Flow for Generative Modeling through Unbalanced Optimal Transport8 Feb 2024
- 2023Adaptive Annealed Importance Sampling with Constant Rate Progress27 Jun 2023
- 2023Dynamic Flows on Curved Space Generated by Labeled Data31 Jan 2023
- 2022Proximal Mean Field Learning in Shallow Neural Networks25 Oct 2022
- 2022Mean-field Variational Inference via Wasserstein Gradient Flow17 Jul 2022
- 2022Optimal Neural Network Approximation of Wasserstein Gradient Direction via Convex Optimization26 May 2022
- 2021Variational Wasserstein gradient flow4 Dec 2021
- 2021Efficient Gradient Flows in Sliced-Wasserstein Space21 Oct 2021
- 2021Sqrt(d) Dimension Dependence of Langevin Monte Carlo8 Sep 2021
- 2021Optimizing Functionals on the Space of Probabilities with Input Convex Neural Networks1 Jun 2021
- 2021Large-Scale Wasserstein Gradient Flows1 Jun 2021
- 2021Wasserstein Proximal of GANs13 Feb 2021