pith. sign in

arxiv: 1811.02827 · v2 · pith:7BNR6P7Hnew · submitted 2018-11-07 · 📊 stat.ML · cs.LG

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

classification 📊 stat.ML cs.LG
keywords variationaloptimaltransportinferenceapproximationdivergenceparticleposterior
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.