Local Minima Structures in Gaussian Mixture Models
Not on the map. Why?
Abstract (arXiv)
We investigate the landscape of the negative log-likelihood function of Gaussian Mixture Models (GMMs) with a general number of components in the population limit. As the objective function is non-convex, there can be multiple local minima that are not globally optimal, even for well-separated mixture models. Our study reveals that all local minima share a common structure that partially identifies the cluster centers (i.e., means of the Gaussian components) of the true location mixture. Specifically, each local minimum can be represented as a non-overlapping combination of two types of sub-configurations: fitting a single mean estimate to multiple Gaussian components or fitting multiple estimates to a single true component. These results apply to settings where the true mixture components satisfy a certain separation condition, and are valid even when the number of components is over- or under-specified. We also present a more fine-grained analysis for the setting of one-dimensional GMMs with three components, which provide sharper approximation error bounds with improved dependence on the separation.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). First posted on arXiv 28 Sep 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 1; 2024: 3; 2025: 2; 2026: 3.
9 papers.
- 2024A theoretical perspective on mode collapse in variational inferencecited by 14
- 2024Unveiling the Cycloid Trajectory of EM Iterations in Mixed Linear Regressioncited by 1
- 2024Jigsaw Game: Federated Clusteringcited by 1
- 2023Scalable Clustering: Large Scale Unsupervised Learning of Gaussian Mixture Models with Outlierscited by 0
- 2025Learning Overspecified Gaussian Mixtures Exponentially Fast with the EM Algorithmcited by 0
- 2025Overspecified Mixture Discriminant Analysis: Exponential Convergence, Statistical Guarantees, and Remote Sensing Applicationscited by 0
- 2026Learning Mixture Density via Natural Gradient Expectation Maximizationcited by 0
- 2026The elbow statistic: Multiscale clustering statistical significancecited by 0
- 2026Local linear convergence of gradient methods for overparameterized Gaussian mixturescited by 0
- 2026Local linear convergence of gradient methods for overparameterized Gaussian mixtures29 May 2026
- 2026The elbow statistic: Multiscale clustering statistical significance3 Mar 2026
- 2026Learning Mixture Density via Natural Gradient Expectation Maximization11 Feb 2026
- 2025Overspecified Mixture Discriminant Analysis: Exponential Convergence, Statistical Guarantees, and Remote Sensing Applications30 Oct 2025
- 2025Learning Overspecified Gaussian Mixtures Exponentially Fast with the EM Algorithm13 Jun 2025
- 2024A theoretical perspective on mode collapse in variational inference17 Oct 2024
- 2024Jigsaw Game: Federated Clustering17 Jul 2024
- 2024Unveiling the Cycloid Trajectory of EM Iterations in Mixed Linear Regression28 May 2024
- 2023Scalable Clustering: Large Scale Unsupervised Learning of Gaussian Mixture Models with Outliers28 Feb 2023