Error-controlled truncation, R-tree queries, multilevel hierarchies, and epsilon scheduling make large-scale finite-element entropy-regularized semi-discrete optimal transport practical.
Wasserstein variational gradient descent: From semi-discrete optimal transport to ensemble variational inference
1 Pith paper cite this work. Polarity classification is still indexing.
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.
citation-role summary
citation-polarity summary
fields
math.NA 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Efficient Numerical Strategies for Entropy-Regularized Semi-Discrete Optimal Transport
Error-controlled truncation, R-tree queries, multilevel hierarchies, and epsilon scheduling make large-scale finite-element entropy-regularized semi-discrete optimal transport practical.