k-means as a variational EM approximation of Gaussian mixture models
Not on the map. Why?
Abstract (arXiv)
We show that k-means (Lloyd's algorithm) is obtained as a special case when truncated variational EM approximations are applied to Gaussian Mixture Models (GMM) with isotropic Gaussians. In contrast to the standard way to relate k-means and GMMs, the provided derivation shows that it is not required to consider Gaussians with small variances or the limit case of zero variances. There are a number of consequences that directly follow from our approach: (A) k-means can be shown to increase a free energy associated with truncated distributions and this free energy can directly be reformulated in terms of the k-means objective; (B) k-means generalizations can directly be derived by considering the 2nd closest, 3rd closest etc. cluster in addition to just the closest one; and (C) the embedding of k-means into a free energy framework allows for theoretical interpretations of other k-means generalizations in the literature. In general, truncated variational EM provides a natural and rigorous quantitative link between k-means-like clustering and GMM clustering algorithms which may be very relevant for future theoretical and empirical studies.
Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). First posted on arXiv 16 Apr 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 0; 2023: 3; 2024: 0; 2025: 1; 2026: 1.
8 papers.
- 2023Prototypical Self-Explainable Models Without Re-trainingcited by 6
- 2021A sampling-based approach for efficient clustering in large datasetscited by 4
- 2021Semi-Supervised Clustering with Inaccurate Pairwise Annotationscited by 2
- 2023Fisher Information Embedding for Node and Graph Learningcited by 1
- 2023Clustered FedStack: Intermediate Global Models with Bayesian Information Criterioncited by 1
- 2021Color Counting for Fashion, Art, and Designcited by 0
- 2025Sublinear Variational Optimization of Gaussian Mixture Models with Millions to Billions of Parameterscited by 0
- 2026K-Means as a Radial Basis function Network: a Variational and Gradient-based Equivalencecited by 0
- 2026K-Means as a Radial Basis function Network: a Variational and Gradient-based Equivalence4 Mar 2026
- 2025Sublinear Variational Optimization of Gaussian Mixture Models with Millions to Billions of Parameters21 Jan 2025
- 2023Prototypical Self-Explainable Models Without Re-training13 Dec 2023
- 2023Clustered FedStack: Intermediate Global Models with Bayesian Information Criterion20 Sep 2023
- 2023Fisher Information Embedding for Node and Graph Learning12 May 2023
- 2021A sampling-based approach for efficient clustering in large datasets29 Dec 2021
- 2021Color Counting for Fashion, Art, and Design13 Oct 2021
- 2021Semi-Supervised Clustering with Inaccurate Pairwise Annotations5 Apr 2021