Deep Generative Clustering with VAEs and Expectation-Maximization
Not on the map. Why?
Abstract (arXiv)
We propose a novel deep clustering method that integrates Variational Autoencoders (VAEs) into the Expectation-Maximization (EM) framework. Our approach models the probability distribution of each cluster with a VAE and alternates between updating model parameters by maximizing the Evidence Lower Bound (ELBO) of the log-likelihood and refining cluster assignments based on the learned distributions. This enables effective clustering and generation of new samples from each cluster. Unlike existing VAE-based methods, our approach eliminates the need for a Gaussian Mixture Model (GMM) prior or additional regularization techniques. Experiments on MNIST and FashionMNIST demonstrate superior clustering performance compared to state-of-the-art methods.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 13 Jan 2025.
Builds on
0 of 0 references.
No references here yet.
Built on by
Citing papers per year: 2025: 3; 2026: 1.
4 papers.
- 2025Slicing the Gaussian Mixture Wasserstein Distancecited by 7
- 2025From Points to Spheres: A Geometric Reinterpretation of Variational Autoencoderscited by 0
- 2025Dialectics for Artificial Intelligencecited by 0
- 2026Deep Generalised Mixed Models: a Novel Neural Network Structure for Analysing Hierarchical Datacited by 0
- 2026Deep Generalised Mixed Models: a Novel Neural Network Structure for Analysing Hierarchical Data6 Aug 2026
- 2025Dialectics for Artificial Intelligence19 Dec 2025
- 2025From Points to Spheres: A Geometric Reinterpretation of Variational Autoencoders23 Jul 2025
- 2025Slicing the Gaussian Mixture Wasserstein Distance11 Apr 2025