Gaussian mixtures closest to a given measure via optimal transport
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866916229879431168 |
|---|---|
| author | Lasserre, Jean-Bernard |
| author_facet | Lasserre, Jean-Bernard |
| contents | Given a determinate (multivariate) probability measure $μ$, we characterize Gaussian mixtures $ν\_ϕ$ which minimize the Wasserstein distance $W\_2(μ,ν\_ϕ)$ to $μ$ when the mixing probability measure $ϕ$ on the parameters $(m,Σ)$ of the Gaussians is supported on a compact set $S$.(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 $S$ of mixture parameters $(m,Σ)$ 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 relaxations of increasing size. In particular, we neither assume that the mixing measure is finitely supported nor that the variance is the same for all components. If the original measure $μ$ is not a Gaussian mixture with parameters $(m,Σ)\in S$, then a strictly positive distance is detected at a finite step of the hierarchy. If the original measure $μ$ is a Gaussian mixture with parameters $(m,Σ)\in S$, then all semidefinite relaxations of the hierarchy have same zero optimal value. Moreover if the mixing measure is atomic with finite support, its components can sometimes be extracted from an optimal solution at some semidefinite relaxation of the hierarchy when Curto & Fialkow's flatness condition holds for some moment matrix. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_19378 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Gaussian mixtures closest to a given measure via optimal transport Lasserre, Jean-Bernard Optimization and Control Statistics Theory Given a determinate (multivariate) probability measure $μ$, we characterize Gaussian mixtures $ν\_ϕ$ which minimize the Wasserstein distance $W\_2(μ,ν\_ϕ)$ to $μ$ when the mixing probability measure $ϕ$ on the parameters $(m,Σ)$ of the Gaussians is supported on a compact set $S$.(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 $S$ of mixture parameters $(m,Σ)$ 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 relaxations of increasing size. In particular, we neither assume that the mixing measure is finitely supported nor that the variance is the same for all components. If the original measure $μ$ is not a Gaussian mixture with parameters $(m,Σ)\in S$, then a strictly positive distance is detected at a finite step of the hierarchy. If the original measure $μ$ is a Gaussian mixture with parameters $(m,Σ)\in S$, then all semidefinite relaxations of the hierarchy have same zero optimal value. Moreover if the mixing measure is atomic with finite support, its components can sometimes be extracted from an optimal solution at some semidefinite relaxation of the hierarchy when Curto & Fialkow's flatness condition holds for some moment matrix. |
| title | Gaussian mixtures closest to a given measure via optimal transport |
| topic | Optimization and Control Statistics Theory |
| url | https://arxiv.org/abs/2404.19378 |