Neural Mixture Models with Expectation-Maximization for End-to-end Deep Clustering
Not on the map. Why?
Abstract (arXiv)
Any clustering algorithm must synchronously learn to model the clusters and allocate data to those clusters in the absence of labels. Mixture model-based methods model clusters with pre-defined statistical distributions and allocate data to those clusters based on the cluster likelihoods. They iteratively refine those distribution parameters and member assignments following the Expectation-Maximization (EM) algorithm. However, the cluster representability of such hand-designed distributions that employ a limited amount of parameters is not adequate for most real-world clustering tasks. In this paper, we realize mixture model-based clustering with a neural network where the final layer neurons, with the aid of an additional transformation, approximate cluster distribution outputs. The network parameters pose as the parameters of those distributions. The result is an elegant, much-generalized representation of clusters than a restricted mixture of hand-designed distributions. We train the network end-to-end via batch-wise EM iterations where the forward pass acts as the E-step and the backward pass acts as the M-step. In image clustering, the mixture-based EM objective can be used as the clustering objective along with existing representation learning methods. In particular, we show that when mixture-EM optimization is fused with consistency optimization, it improves the sole consistency optimization performance in clustering. Our trained networks outperform single-stage deep clustering methods that still depend on k-means, with unsupervised classification accuracy of 63.8% in STL10, 58% in CIFAR10, 25.9% in CIFAR100, and 98.9% in MNIST.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 21 of its 51 references that are in the map. First posted on arXiv 6 Jul 2021.
Builds on
21 of 51 references.
References · 21
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,979
- 2013Auto-Encoding Variational Bayescited by 3,980
- 2013Deep Inside Convolutional Networks: Visualising Image Classification Models and Saliency Mapscited by 2,348
- 2015Unsupervised Representation Learning with Deep Convolutional Generative Adversarial Networkscited by 2,048
- 2018Unsupervised Feature Learning via Non-Parametric Instance-level Discriminationcited by 1,838
- 2016Temporal Ensembling for Semi-Supervised Learningcited by 1,054
- 2018Deep Clustering for Unsupervised Learning of Visual Featurescited by 1,020
- 2015Unsupervised Deep Embedding for Clustering Analysiscited by 763
- 2018Invariant Information Clustering for Unsupervised Image Classification and Segmentationcited by 454
- 2020SCAN: Learning to Classify Images without Labelscited by 351
- 2016Joint Unsupervised Learning of Deep Representations and Image Clusterscited by 205
9 more
- 2017Neural Expectation Maximizationcited by 123
- 2019Stacked Capsule Autoencoderscited by 82
- 2019Deep Comprehensive Correlation Mining for Image Clusteringcited by 80
- 2021Clustering-friendly Representation Learning via Instance Discrimination and Feature Decorrelationcited by 65
- 2020Improving Unsupervised Image Clustering With Robust Learningcited by 51
- 2021MiCE: Mixture of Contrastive Experts for Unsupervised Image Clusteringcited by 42
- 2015Stacked What-Where Auto-encoderscited by 20
- 2014Optimized Cartesian K-Meanscited by 14
- 2018Learning Latent Representations in Neural Networks for Clustering through Pseudo Supervision and Graph-based Activity Regularizationcited by 5
Built on by
Citing papers per year: 2024: 1; 2025: 0; 2026: 1.
2 papers.