Individual-heterogeneous sub-Gaussian Mixture Models

arXiv cs.LG / 4/8/2026

💬 OpinionIdeas & Deep AnalysisModels & Research

Key Points

  • The paper critiques the standard Gaussian mixture model for assuming homogeneous cluster structure, which can break down when real data has varying scales or intensities across observations.
  • It proposes an “individual-heterogeneous sub-Gaussian mixture model” that assigns each observation its own heterogeneity parameter to better reflect real-world variability.
  • Using this framework, the authors develop an efficient spectral clustering method with provable exact recovery of true labels under mild separation assumptions.
  • The method is analyzed for high-dimensional regimes where the feature dimension can far exceed the number of samples, and the theory is supported by experiments.
  • Experiments on synthetic and real datasets show the approach consistently outperforms clustering baselines, including classical Gaussian-mixture-based methods.

Abstract

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.