mlsanityData to 7 Oct 2026

Deep Robust Clustering by Contrastive Learning

arXiv 2008.03030 ↗First posted 7 Aug 2020cs.CVcited by 25

Not on the map. Why?

Abstract (arXiv)

Recently, many unsupervised deep learning methods have been proposed to learn clustering with unlabelled data. By introducing data augmentation, most of the latest methods look into deep clustering from the perspective that the original image and its transformation should share similar semantic clustering assignment. However, the representation features could be quite different even they are assigned to the same cluster since softmax function is only sensitive to the maximum value. This may result in high intra-class diversities in the representation feature space, which will lead to unstable local optimal and thus harm the clustering performance. To address this drawback, we proposed Deep Robust Clustering (DRC). Different from existing methods, DRC looks into deep clustering from two perspectives of both semantic clustering assignment and representation feature, which can increase inter-class diversities and decrease intra-class diversities simultaneously. Furthermore, we summarized a general framework that can turn any maximizing mutual information into minimizing contrastive loss by investigating the internal relationship between mutual information and contrastive learning. And we successfully applied it in DRC to learn invariant features and robust clusters. Extensive experiments on six widely-adopted deep clustering benchmarks demonstrate the superiority of DRC in both stability and accuracy. e.g., attaining 71.6% mean accuracy on CIFAR-10, which is 7.1% higher than state-of-the-art results.

Key facts. Cited by 25 papers in the map (data through 7 Oct 2026). First posted on arXiv 7 Aug 2020.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 8; 2022: 10; 2023: 4; 2024: 2; 2025: 1.

25 papers.

Sort:

By area:

  1. 2022Deep Clustering: A Comprehensive Surveycited by 78
  2. 2021Multi-view Contrastive Graph Clusteringcited by 76
  3. 2021Multi-level Feature Learning for Contrastive Multi-view Clusteringcited by 73
  4. 2022A Comprehensive Survey on Deep Clustering: Taxonomy, Challenges, and Future Directionscited by 73
  5. 2021Graph Contrastive Clusteringcited by 61
  6. 2022Twin Contrastive Learning for Online Clusteringcited by 60
  7. 2021Clustering by Maximizing Mutual Information Across Viewscited by 23
  8. 2022Strongly Augmented Contrastive Clusteringcited by 14
  9. 2021Unsupervised Outlier Detection using Memory and Contrastive Learningcited by 11
  10. 2021Information Maximization Clustering via Multi-View Self-Labellingcited by 10
  11. 2021Contrastive Fine-grained Class Clustering via Generative Adversarial Networkscited by 9
  12. 2024A Survey on Deep Clustering: From the Prior Perspectivecited by 9
13 more
  1. 2023Hard Regularization to Prevent Deep Online Clustering Collapse without Data Augmentationcited by 7
  2. 2022C3: Cross-instance guided Contrastive Clusteringcited by 6
  3. 2022Deep Image Clustering with Contrastive Learning and Multi-scale Graph Convolutional Networkscited by 5
  4. 2022Semi-supervised New Event Type Induction and Description via Contrastive Loss-Enforced Batch Attentioncited by 4
  5. 2022Out-of-Dynamics Imitation Learning from Multimodal Demonstrationscited by 3
  6. 2023Heterogeneous Tri-stream Clustering Networkcited by 3
  7. 2022On the Robustness of Deep Clustering Models: Adversarial Attacks and Defensescited by 2
  8. 2021Stein Latent Optimization for Generative Adversarial Networkscited by 1
  9. 2023On the Importance of Feature Representation for Flood Mapping using Classical Machine Learning Approachescited by 1
  10. 2022Deep Semi-supervised Learning with Double-Contrast of Features and Semanticscited by 0
  11. 2023Grid Jigsaw Representation with CLIP: A New Perspective on Image Clusteringcited by 0
  12. 2024Bridging Gaps: Federated Multi-View Clustering in Heterogeneous Hybrid Viewscited by 0
  13. 2025Unsupervised Graph Anomaly Detection via Multi-Hypersphere Heterophilic Graph Learningcited by 0