Wasserstein variational gradient descent: From semi-discrete optimal transport to ensemble variational inference
Not on the map. Why?
Abstract (arXiv)
Particle-based variational inference offers a flexible way of approximating complex posterior distributions with a set of particles. In this paper we introduce a new particle-based variational inference method based on the theory of semi-discrete optimal transport. Instead of minimizing the KL divergence between the posterior and the variational approximation, we minimize a semi-discrete optimal transport divergence. The solution of the resulting optimal transport problem provides both a particle approximation and a set of optimal transportation densities that map each particle to a segment of the posterior distribution. We approximate these transportation densities by minimizing the KL divergence between a truncated distribution and the optimal transport solution. The resulting algorithm can be interpreted as a form of ensemble variational inference where each particle is associated with a local variational approximation.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). First posted on arXiv 7 Nov 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 0; 2023: 0; 2024: 1.
3 papers.
- 2021Stein Variational Gradient Descent: many-particle and long-time asymptoticscited by 15
- 2021Semi-Discrete Optimal Transport: Hardness, Regularization and Numerical Solutioncited by 13
- 2024Finite Neural Networks as Mixtures of Gaussian Processes: From Provable Error Bounds to Prior Selectioncited by 3
- 2024Finite Neural Networks as Mixtures of Gaussian Processes: From Provable Error Bounds to Prior Selection26 Jul 2024
- 2021Semi-Discrete Optimal Transport: Hardness, Regularization and Numerical Solution10 Mar 2021
- 2021Stein Variational Gradient Descent: many-particle and long-time asymptotics25 Feb 2021