mlsanityData to 7 Oct 2026

Nonparametric MLE for Gaussian Location Mixtures: Certified Computation and Generic Behavior

arXiv 2503.20193 ↗First posted 26 Mar 2025math.ST stat.ML stat.THcited by 3

Not on the map. Why?

Abstract (arXiv)

We study the nonparametric maximum likelihood estimator widehatπ for Gaussian location mixtures in one dimension. It has been known since (Lindsay, 1983) that given an n-point dataset, this estimator always returns a mixture with at most n components, and more recently (Wu-Polyanskiy, 2020) gave a sharp O(log n) bound for subgaussian data. In this work we study computational aspects of widehatπ. We provide an algorithm which for small enough varepsilon>0 computes an varepsilon-approximation of widehatπ in Wasserstein distance in time K+Cnk2loglog(1/varepsilon). Here K is data-dependent but independent of varepsilon, while C is an absolute constant and k=|supp(widehatπ)|≤ n is the number of atoms in widehatπ. We also certifiably compute the exact value of |supp(widehatπ)| in finite time. These guarantees hold almost surely whenever the dataset (x1,dots,xn)∈ [-cn1/4,cn1/4] consists of independent points from a probability distribution with a density (relative to Lebesgue measure). We also show the distribution of widehatπ conditioned to be k-atomic admits a density on the associated 2k-1 dimensional parameter space for all k≤ √n/3, and almost sure locally linear convergence of the EM algorithm. One key tool is a classical Fourier analytic estimate for non-degenerate curves.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 16 of its 60 references that are in the map. First posted on arXiv 26 Mar 2025.

Builds on

16 of 60 references.

References · 16

  1. 2014Convex Optimization: Algorithms and Complexitycited by 569
  2. 2014Statistical guarantees for the EM algorithm: From population to sample-based analysiscited by 131
  3. 2016Ten Steps of EM Suffice for Mixtures of Two Gaussianscited by 40
  4. 2016Local Maxima in the Likelihood of Gaussian Mixture Models: Structural Results and Algorithmic Consequencescited by 34
  5. 2014Tight bounds for learning a mixture of two gaussianscited by 29
  6. 2019Randomly initialized EM algorithm for two-component Gaussian mixture achieves near optimality in O(√n) iterationscited by 27
  7. 2017On the nonparametric maximum likelihood estimator for Gaussian location mixture densities with application to Gaussian denoisingcited by 19
  8. 2020Optimal estimation of high-dimensional location Gaussian mixturescited by 16
  9. 2020Self-regularizing Property of Nonparametric Maximum Likelihood Estimator in Mixture Modelscited by 16
  10. 2020Robust Learning of Mixtures of Gaussianscited by 15
  11. 2021Learning GMMs with Nearly Optimal Robustness Guaranteescited by 12
  12. 2021The EM Algorithm is Adaptively-Optimal for Unbalanced Symmetric Gaussian Mixturescited by 6
4 more
  1. 2018A fast algorithm for maximum likelihood estimation of mixture proportions using sequential quadratic programmingcited by 4
  2. 2023A Mean Field Approach to Empirical Bayes Estimation in High-dimensional Linear Regressioncited by 4
  3. 2023Gradient flows for empirical Bayes in high-dimensional linear modelscited by 4
  4. 2021Nonparametric Finite Mixture Models with Possible Shape Constraints: A Cubic Newton Approachcited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 1; 2026: 2.

3 papers.