Individual-heterogeneous sub-Gaussian Mixture Models

• URL: http://arxiv.org/abs/2604.05337v1
• Date: Tue, 07 Apr 2026 02:22:51 GMT
• Title: Individual-heterogeneous sub-Gaussian Mixture Models
• Abstract summary: We introduce the individual-heterogeneous sub-Gaussian mixture model.<n>We propose an efficient spectral method that provably achieves exact recovery of the true cluster labels.<n> Numerical experiments on both synthetic and real data demonstrate that our method consistently outperforms existing clustering algorithms.
• Score: 4.314956204483074
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Robust model-based clustering via mixtures of multivariate pseudo-Voigt distributions [0.0]
  A weighted convex combination of Gaussian and Cauchy distributions is proposed for robust model-based clustering and outlier detection.<n>The framework is shown to be particularly effective for data characterized by heavy-tailed behavior.
  arXiv  Detail & Related papers  (2026-08-27T18:38:42Z)
• From Scores to Gibbs Correctors: Accelerating Uniform-Rate Discrete Diffusion Models [58.02657021435213]
  We propose a novel Gibbs-based corrector for discrete diffusion models, termed Gibbs-Accelerated Discrete Diffusion (GADD)<n>We show GADD achieves an overall sampling complexity of $mathcalO(mathrmpolylog (varepsilon-1)$, yielding the first such rate for diffusion-based samplers for uniform-rate discrete diffusion models.
  arXiv  Detail & Related papers  (2026-05-26T17:52:28Z)
• Mixed Membership sub-Gaussian Models [4.314956204483074]
  We develop an efficient algorithm to estimate the mixed membership of each individual observation.<n>We prove that the estimation error of the per-individual membership vector can be made arbitrarily small with high probability.
  arXiv  Detail & Related papers  (2026-04-24T15:07:32Z)
• Spatial Covariance Constraints for Gaussian Mixture Models [0.0]
  This study introduces a spatial covariance constraint for Gaussian mixture models that requires only four free parameters for each component, independent of dimensionality.<n>Using a coordinate system, the spatially constrained Gaussian mixture model enables clustering of multi-way spatial data and inference of spatial patterns.
  arXiv  Detail & Related papers  (2026-01-12T20:21:22Z)
• Stochastic Mean-Shift Clustering [1.4299355089723902]
  We present a version of the mean-shift clustering algorithm.<n>In this version a randomly chosen sequence of data points move according to partial ascent steps of the objective function.<n>It can be observed that in most cases the mean-shift clustering outperforms the standard mean-shift.
  arXiv  Detail & Related papers  (2025-11-12T11:07:05Z)
• Copula-based mixture model identification for subgroup clustering with imaging applications [2.285847431713438]
  We consider the more flexible Copula-Based Mixture Models (CBMMs) for clustering.<n>CBMMs allow heterogeneous component distributions composed by flexible choices of marginal and copula forms.
  arXiv  Detail & Related papers  (2025-02-12T16:30:39Z)
• Adaptive Fuzzy C-Means with Graph Embedding [84.47075244116782]
  Fuzzy clustering algorithms can be roughly categorized into two main groups: Fuzzy C-Means (FCM) based methods and mixture model based methods. We propose a novel FCM based clustering model that is capable of automatically learning an appropriate membership degree hyper- parameter value.
  arXiv  Detail & Related papers  (2024-05-22T08:15:50Z)
• Universal Lower Bounds and Optimal Rates: Achieving Minimax Clustering Error in Sub-Exponential Mixture Models [8.097200145973389]
  We first establish a universal lower bound for the error rate in clustering any mixture model. We then demonstrate that iterative algorithms attain this lower bound in mixture models with sub-exponential tails. For datasets better modelled by Poisson or Negative Binomial mixtures, we study mixture models whose distributions belong to an exponential family. In such mixtures, we establish that Bregman hard clustering, a variant of Lloyd's algorithm employing a Bregman divergence, is rate optimal.
  arXiv  Detail & Related papers  (2024-02-23T16:51:17Z)
• Score-based Continuous-time Discrete Diffusion Models [102.65769839899315]
  We extend diffusion models to discrete variables by introducing a Markov jump process where the reverse process denoises via a continuous-time Markov chain. We show that an unbiased estimator can be obtained via simple matching the conditional marginal distributions. We demonstrate the effectiveness of the proposed method on a set of synthetic and real-world music and image benchmarks.
  arXiv  Detail & Related papers  (2022-11-30T05:33:29Z)
• A Robust and Flexible EM Algorithm for Mixtures of Elliptical Distributions with Missing Data [71.9573352891936]
  This paper tackles the problem of missing data imputation for noisy and non-Gaussian data. A new EM algorithm is investigated for mixtures of elliptical distributions with the property of handling potential missing data. Experimental results on synthetic data demonstrate that the proposed algorithm is robust to outliers and can be used with non-Gaussian data.
  arXiv  Detail & Related papers  (2022-01-28T10:01:37Z)
• Generalization Metrics for Practical Quantum Advantage in Generative Models [68.8204255655161]
  Generative modeling is a widely accepted natural use case for quantum computers. We construct a simple and unambiguous approach to probe practical quantum advantage for generative modeling by measuring the algorithm's generalization performance. Our simulation results show that our quantum-inspired models have up to a $68 times$ enhancement in generating unseen unique and valid samples.
  arXiv  Detail & Related papers  (2022-01-21T16:35:35Z)
• Robust Finite Mixture Regression for Heterogeneous Targets [70.19798470463378]
  We propose an FMR model that finds sample clusters and jointly models multiple incomplete mixed-type targets simultaneously. We provide non-asymptotic oracle performance bounds for our model under a high-dimensional learning framework. The results show that our model can achieve state-of-the-art performance.
  arXiv  Detail & Related papers  (2020-10-12T03:27:07Z)
• Consistent Estimation of Identifiable Nonparametric Mixture Models from Grouped Observations [84.81435917024983]
  This work proposes an algorithm that consistently estimates any identifiable mixture model from grouped observations. A practical implementation is provided for paired observations, and the approach is shown to outperform existing methods.
  arXiv  Detail & Related papers  (2020-06-12T20:44:22Z)
• Blocked Clusterwise Regression [0.0]
  We generalize previous approaches to discrete unobserved heterogeneity by allowing each unit to have multiple latent variables. We contribute to the theory of clustering with an over-specified number of clusters and derive new convergence rates for this setting.
  arXiv  Detail & Related papers  (2020-01-29T23:29:31Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.