Benefits of over-parameterization with EM
Not on the map. Why?
Abstract (arXiv)
Expectation Maximization (EM) is among the most popular algorithms for maximum likelihood estimation, but it is generally only guaranteed to find its stationary points of the log-likelihood objective. The goal of this article is to present theoretical and empirical evidence that over-parameterization can help EM avoid spurious local optima in the log-likelihood. We consider the problem of estimating the mean vectors of a Gaussian mixture model in a scenario where the mixing weights are known. Our study shows that the global behavior of EM, when one uses an over-parameterized model in which the mixing weights are treated as unknown, is better than that when one uses the (correct) model with the mixing weights fixed to the known values. For symmetric Gaussians mixtures with two components, we prove that introducing the (statistically redundant) weight parameters enables EM to find the global maximizer of the log-likelihood starting from almost any initial mean parameters, whereas EM without this over-parameterization may very often fail. For other Gaussian mixtures, we provide empirical evidence that shows similar behavior. Our results corroborate the value of over-parameterization in solving non-convex optimization problems, previously observed in other domains.
Key facts. Cited by 10 papers in the map (data through 14 Oct 2026). First posted on arXiv 26 Oct 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 3; 2023: 1; 2024: 3; 2025: 0; 2026: 1.
10 papers.
- 2024Compressible Dynamics in Deep Overparameterized Low-Rank Learning & Adaptationcited by 26
- 2021PCFGs Can Do Better: Inducing Probabilistic Context-Free Grammars with Many Symbolscited by 22
- 2021Sharp global convergence guarantees for iterative nonconvex optimization: A Gaussian process perspectivecited by 10
- 2022Dynamic Programming in Rank Space: Scaling Structured Inference with Low-Rank HMMs and PCFGscited by 10
- 2024ItTakesTwo: Leveraging Peer Representations for Semi-supervised LiDAR Semantic Segmentationcited by 5
- 2026Escaping Local Minima Provably in Non-convex Matrix Sensing: A Deterministic Framework via Simulated Liftingcited by 3
- 2022EM's Convergence in Gaussian Latent Tree Modelscited by 2
- 2022Overparameterization from Computational Constraintscited by 1
- 2023Fast exploration and learning of latent graphs with aliased observationscited by 0
- 2024Beyond adaptive gradient: Fast-Controlled Minibatch Algorithm for large-scale optimizationcited by 0
- 2026Escaping Local Minima Provably in Non-convex Matrix Sensing: A Deterministic Framework via Simulated Lifting5 Feb 2026
- 2024Beyond adaptive gradient: Fast-Controlled Minibatch Algorithm for large-scale optimization24 Nov 2024
- 2024ItTakesTwo: Leveraging Peer Representations for Semi-supervised LiDAR Semantic Segmentation9 Jul 2024
- 2024Compressible Dynamics in Deep Overparameterized Low-Rank Learning & Adaptation6 Jun 2024
- 2023Fast exploration and learning of latent graphs with aliased observations13 Mar 2023
- 2022EM's Convergence in Gaussian Latent Tree Models21 Nov 2022
- 2022Overparameterization from Computational Constraints27 Aug 2022
- 2022Dynamic Programming in Rank Space: Scaling Structured Inference with Low-Rank HMMs and PCFGs1 May 2022
- 2021Sharp global convergence guarantees for iterative nonconvex optimization: A Gaussian process perspective20 Sep 2021
- 2021PCFGs Can Do Better: Inducing Probabilistic Context-Free Grammars with Many Symbols28 Apr 2021