mlsanityData to 7 Oct 2026

Cutoff for exact recovery of Gaussian mixture models

arXiv 2001.01194 ↗First posted 5 Jan 2020math.ST cs.DS cs.ITcited by 18

Not on the map. Why?

Abstract (arXiv)

We determine the information-theoretic cutoff value on separation of cluster centers for exact recovery of cluster labels in a K-component Gaussian mixture model with equal cluster sizes. Moreover, we show that a semidefinite programming (SDP) relaxation of the K-means clustering method achieves such sharp threshold for exact recovery without assuming the symmetry of cluster centers.

Key facts. Cited by 18 papers in the map (data through 7 Oct 2026). First posted on arXiv 5 Jan 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 5; 2023: 2; 2024: 3; 2025: 3; 2026: 5.

18 papers.

Sort:

  1. 2022Wasserstein K-means for clustering probability distributionscited by 16
  2. 2023Statistically Optimal K-means Clustering via Nonnegative Low-rank Semidefinite Programmingcited by 9
  3. 2023Exact Recovery and Bregman Hard Clustering of Node-Attributed Stochastic Block Modelcited by 7
  4. 2022Sketch-and-Lift: Scalable Subsampled Semidefinite Program for K-means Clusteringcited by 6
  5. 2022Optimal Clustering by Lloyd Algorithm for Low-Rank Mixture Modelcited by 5
  6. 2022GeONet: a neural operator for learning the Wasserstein geodesiccited by 3
  7. 2024Universal Lower Bounds and Optimal Rates: Achieving Minimax Clustering Error in Sub-Exponential Mixture Modelscited by 3
  8. 2022Likelihood Adjusted Semidefinite Programs for Clustering Heterogeneous Datacited by 2
  9. 2025Scalable Second-order Riemannian Optimization for K-means Clusteringcited by 2
  10. 2025Nonnegative Low-rank Matrix Recovery Can Have Spurious Local Minimacited by 1
  11. 2025Graph-based Clustering Revisited: A Relaxation of Kernel k-Means Perspectivecited by 1
  12. 2026Learning Multi-type heterogeneous interacting particle systemscited by 1
6 more
  1. 2026The Catastrophic Failure of The k-Means Algorithm in High Dimensions, and How Hartigan's Algorithm Avoids Itcited by 1
  2. 2024Model Selection and Parameter Estimation of One-Dimensional Gaussian Mixture Modelscited by 0
  3. 2024Adaptive Mean Estimation in the Hidden Markov sub-Gaussian Mixture Modelcited by 0
  4. 2026One-Bit Clustering for Two Component Sub-Gaussian Mixture Modelscited by 0
  5. 2026Riemannian Difference-of-Convex Optimization for K-Means Clusteringcited by 0
  6. 2026GEM-KMeans: Memory-Efficient and Accurate Clustering on Massive Scale with GPU Optimizationcited by 0