mlsanityData to 14 Oct 2026

Generalised Mutual Information for Discriminative Clustering

arXiv 2210.06300 ↗First posted 12 Oct 2022stat.ML cs.AI cs.ITcited by 5

Not on the map. Why?

Abstract (arXiv)

In the last decade, recent successes in deep clustering majorly involved the mutual information (MI) as an unsupervised objective for training neural networks with increasing regularisations. While the quality of the regularisations have been largely discussed for improvements, little attention has been dedicated to the relevance of MI as a clustering objective. In this paper, we first highlight how the maximisation of MI does not lead to satisfying clusters. We identified the Kullback-Leibler divergence as the main reason of this behaviour. Hence, we generalise the mutual information by changing its core distance, introducing the generalised mutual information (GEMINI): a set of metrics for unsupervised neural network training. Unlike MI, some GEMINIs do not require regularisations when training. Some of these metrics are geometry-aware thanks to distances or kernels in the data space. Finally, we highlight that GEMINIs can automatically select a relevant number of clusters, a property that has been little studied in deep clustering context where the number of clusters is a priori unknown.

Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 26 of its 66 references that are in the map. First posted on arXiv 12 Oct 2022.

Builds on

26 of 66 references.

References · 26

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  3. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
  4. 2018Representation Learning with Contrastive Predictive Codingcited by 7,777
  5. 2017On Calibration of Modern Neural Networkscited by 4,960
  6. 2020Unsupervised Learning of Visual Features by Contrasting Cluster Assignmentscited by 2,857
  7. 2018Spectral Normalization for Generative Adversarial Networkscited by 1,636
  8. 2018Learning deep representations by mutual information estimation and maximizationcited by 1,273
  9. 2018Deep Clustering for Unsupervised Learning of Visual Featurescited by 1,028
  10. 2017Virtual Adversarial Training: A Regularization Method for Supervised and Semi-Supervised Learningcited by 920
  11. 2015Unsupervised Deep Embedding for Clustering Analysiscited by 767
  12. 2018MINE: Mutual Information Neural Estimationcited by 683
14 more
  1. 2018Invariant Information Clustering for Unsupervised Image Classification and Segmentationcited by 455
  2. 2020SCAN: Learning to Classify Images without Labelscited by 352
  3. 2019On Mutual Information Maximization for Representation Learningcited by 316
  4. 2018Regularisation of Neural Networks by Enforcing Lipschitz Continuitycited by 314
  5. 2020Contrastive Clusteringcited by 265
  6. 2016Joint Unsupervised Learning of Deep Representations and Image Clusterscited by 205
  7. 2017Generalization and Equilibrium in Generative Adversarial Nets (GANs)cited by 166
  8. 2017Learning Discrete Representations via Information Maximizing Self-Augmented Trainingcited by 149
  9. 2017Deep Clustering via Joint Convolutional Autoencoder Embedding and Relative Entropy Minimizationcited by 113
  10. 2021Clustering-friendly Representation Learning via Instance Discrimination and Feature Decorrelationcited by 65
  11. 2022DeepDPM: Deep Clustering With an Unknown Number of Clusterscited by 52
  12. 2020Improving Unsupervised Image Clustering With Robust Learningcited by 51
  13. 2018Deep clustering: On the link between discriminative models and K-meanscited by 37
  14. 2021Clustering by Maximizing Mutual Information Across Viewscited by 23

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 1; 2024: 1; 2025: 1; 2026: 2.

5 papers.