Metraipolis › archive › dc_67f6da7b7916
Riemannian Gradient Descent for Gaussian Mixture Models with unknown diagonal covariances — arXiv:2609.30220
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.30220
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T06:02:59.764Z
- SHA-256 of the archived text
8d4afcc3af8ef4ae2aa3d017948bab7eb97da7d351aaeb93241d88ccea7e6f65- Stable URL of this page
https://metraipolis.com/documento/dc_67f6da7b7916
How to cite
Riemannian Gradient Descent for Gaussian Mixture Models with unknown diagonal covariances — arXiv:2609.30220 — arXiv (en), https://arxiv.org/abs/2609.30220 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_67f6da7b7916 (Metraipolis archive dc_67f6da7b7916, sha256 8d4afcc3af8ef4ae2aa3d017948bab7eb97da7d351aaeb93241d88ccea7e6f65)
BibTeX
@misc{dc67f6da7b7916,
title = {Riemannian Gradient Descent for Gaussian Mixture Models with unknown diagonal covariances — arXiv:2609.30220},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.30220},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_67f6da7b7916; sha256 8d4afcc3af8ef4ae2aa3d017948bab7eb97da7d351aaeb93241d88ccea7e6f65},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.30220. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
This paper investigates the numerical resolution of the Beurling-LASSO (BLASSO), a convex optimization framework that promotes sparsity in the space of measures. We consider its application to the estimation of Gaussian mixture models (GMMs) with an unknown number of components and unknown diagonal covariance matrices. Our approach combines the Conic Particle Gradient Descent (CPGD) principle with Riemannian gradient descent, to account for the underlying Fisher-Rao geometry of Gaussian distributions. Our contributions are twofold. First, we provide theoretical guarantees for the convergence of our algorithm. In particular, we establish exponential local convergence under a non-degeneracy condition on the solution and relate this assumption to a separation condition on the underlying statistical target. Second, we address practical implementation aspects of CPGD and present numerical experiments illustrating its performance. On the test cases considered, these experiments suggest that CPGD is more robust to overspecification of the number of components than the EM algorithm. We also investigate the impact of component separation on recovery accuracy. Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-25 in stat.ML). Categorie arXiv: Optimization and Control (math.OC) ; Statistics Theory (math.ST); Machine Learning (stat.ML). Pagina del lavoro: https://arxiv.org/abs/2609.30220 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-08T05:30:28.925Z dalla pagina https://arxiv.org/catchup/stat.ML/2026-09-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).