mlsanityData to 7 Oct 2026

Wasserstein variational gradient descent: From semi-discrete optimal transport to ensemble variational inference

arXiv 1811.02827 ↗First posted 7 Nov 2018stat.ML cs.LGcited by 3

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

Cited by year

Citing papers per year: 2021: 2; 2022: 0; 2023: 0; 2024: 1.

3 papers.