Gaussian mixtures closest to a given measure via optimal transport
Jean-Bernard Lasserre (LAAS-POP, TSE-R)

TL;DR
This paper characterizes Gaussian mixtures closest to a given measure using optimal transport, providing a numerical scheme to approximate the minimal Wasserstein distance and detect if the measure is a Gaussian mixture within a parameter set.
Contribution
It introduces a novel optimal transport framework for Gaussian mixture approximation and develops a mesh-free semidefinite relaxation scheme for practical computation.
Findings
The scheme can approximate the Wasserstein distance arbitrarily closely.
It can detect when the measure is a Gaussian mixture within the parameter set.
It allows extraction of mixture components when the measure is a finite atomic Gaussian mixture.
Abstract
Given a determinate (multivariate) probability measure , we characterize Gaussian mixtures which minimize the Wasserstein distance to when the mixing probability measure on the parameters of the Gaussians is supported on a compact set .(i) We first show that such mixtures are optimal solutions of a particular optimal transport (OT) problem where the marginal of the OT problem is also unknown via the mixing measure variable . Next (ii) by using a well-known specific property of Gaussian measures, this optimal transport is then viewed as a Generalized Moment Problem (GMP) and if the set of mixture parameters is a basic compact semi-algebraic set, we provide a "mesh-free" numerical scheme to approximate as closely as desired the optimal distance by solving a hierarchy of semidefinite…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMarkov Chains and Monte Carlo Methods · Groundwater flow and contamination studies
