Gaussian mixtures closest to a given measure via optimal transport
From MaRDI portal
Publication:6639473
DOI10.5802/crmath.657MaRDI QIDQ6639473
Publication date: 15 November 2024
Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)
Gaussian processes (60G15) Optimality conditions and duality in mathematical programming (90C46) Probabilistic measure theory (60A10) Optimal transportation (49Q22) Polynomial optimization (90C23)
Cites Work
- Unnamed Item
- Unnamed Item
- The existence of Gaussian cubature formulas
- Handbook on semidefinite, conic and polynomial optimization
- On square positive extensions and cubature formulas
- A mixture of mixture models for a classification problem: the unity measure error
- Moment matrices: Applications in mixtures
- Exact mean integrated squared error
- Convergence of latent mixing measures in finite and infinite mixture models
- Strong identifiability and optimal minimax rates for finite mixture estimation
- Optimal estimation of Gaussian mixtures via denoised method of moments
- A study of Gaussian mixture models of color and texture features for image classification and segmentation
- Orthogonal polynomials of several variables
- Efficiently learning mixtures of two Gaussians
- An Introduction to Polynomial and Semi-Algebraic Optimization
- Moment Varieties of Gaussian Mixtures
- GloptiPoly 3: moments, optimization and semidefinite programming
- Finite mixture models
- Algebraic Identifiability of Gaussian Mixtures
- SOS Is Not Obviously Automatizable, Even Approximately
- The Moment-SOS Hierarchy
- Solving Inverse Problems With Piecewise Linear Estimators: From Gaussian Mixture Models to Structured Sparsity
- Robustly learning mixtures of k arbitrary Gaussians
This page was built for publication: Gaussian mixtures closest to a given measure via optimal transport
