mlsanityData to 7 Oct 2026

Individual-heterogeneous sub-Gaussian Mixture Models

arXiv 2604.05337 ↗First posted 7 Apr 2026stat.ML cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

The classical Gaussian mixture model assumes homogeneity within clusters, an assumption that often fails in real-world data where observations naturally exhibit varying scales or intensities. To address this, we introduce the individual-heterogeneous sub-Gaussian mixture model, a flexible framework that assigns each observation its own heterogeneity parameter, thereby explicitly capturing the heterogeneity inherent in practical applications. Built upon this model, we propose an efficient spectral method that provably achieves exact recovery of the true cluster labels under mild separation conditions, even in high-dimensional settings where the number of features far exceeds the number of samples. Numerical experiments on both synthetic and real data demonstrate that our method consistently outperforms existing clustering algorithms, including those designed for classical Gaussian mixture models.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 20 of its 45 references that are in the map. First posted on arXiv 7 Apr 2026.

Builds on

20 of 45 references.

References · 20

  1. 2014Statistical guarantees for the EM algorithm: From population to sample-based analysiscited by 131
  2. 2013Consistency of spectral clustering in stochastic block modelscited by 128
  3. 2020Spectral Methods for Data Science: A Statistical Perspectivecited by 111
  4. 2016Community detection in networks: A user guidecited by 105
  5. 2016Statistical and Computational Guarantees of Lloyd's Algorithm and its Variantscited by 52
  6. 2013Regularized Spectral Clustering under the Degree-Corrected Stochastic Blockmodelcited by 45
  7. 2019Optimality of Spectral Clustering in the Gaussian Mixture Modelcited by 42
  8. 2016Community Detection in Degree-Corrected Block Modelscited by 36
  9. 2016Global analysis of Expectation Maximization for mixtures of two Gaussianscited by 31
  10. 2018Partial recovery bounds for clustering with the relaxed Kmeanscited by 25
  11. 2017Mixed Membership Estimation for Social Networkscited by 21
  12. 2020Spectral Algorithms for Community Detection in Directed Networkscited by 17
8 more
  1. 2022Leave-one-out Singular Subspace Perturbation Analysis for Spectral Clusteringcited by 14
  2. 2018Determining the Number of Communities in Degree-corrected Stochastic Block Modelscited by 10
  3. 2019A Robust Spectral Clustering Algorithm for Sub-Gaussian Mixture Models with Outlierscited by 9
  4. 2020Adjusted chi-square test for degree-corrected block modelscited by 5
  5. 2023Adversarially robust clustering with optimality guaranteescited by 4
  6. 2020Exact Recovery of Community Detection in k-Community Gaussian Mixture Modelcited by 3
  7. 2024Community detection by spectral methods in multi-layer networkscited by 3
  8. 2023Strong Consistency of Spectral Clustering for the Sparse Degree-Corrected Hypergraph Stochastic Block Modelcited by 2

Built on by

Not cited yet.