Deep Clustering with a Constraint for Topological Invariance based on Symmetric InfoNCE
Not on the map. Why?
Abstract (arXiv)
We consider the scenario of deep clustering, in which the available prior knowledge is limited. In this scenario, few existing state-of-the-art deep clustering methods can perform well for both non-complex topology and complex topology datasets. To address the problem, we propose a constraint utilizing symmetric InfoNCE, which helps an objective of deep clustering method in the scenario train the model so as to be efficient for not only non-complex topology but also complex topology datasets. Additionally, we provide several theoretical explanations of the reason why the constraint can enhances performance of deep clustering methods. To confirm the effectiveness of the proposed constraint, we introduce a deep clustering method named MIST, which is a combination of an existing deep clustering method and our constraint. Our numerical experiments via MIST demonstrate that the constraint is effective. In addition, MIST outperforms other state-of-the-art deep clustering methods for most of the commonly used ten benchmark datasets.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 29 of its 87 references that are in the map. First posted on arXiv 6 Mar 2023.
Builds on
29 of 87 references.
References · 29
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
- 2018Representation Learning with Contrastive Predictive Codingcited by 7,662
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,979
- 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,712
- 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,590
- 2020Unsupervised Learning of Visual Features by Contrasting Cluster Assignmentscited by 2,845
- 2017Virtual Adversarial Training: A Regularization Method for Supervised and Semi-Supervised Learningcited by 918
- 2015Unsupervised Deep Embedding for Clustering Analysiscited by 763
- 2018MINE: Mutual Information Neural Estimationcited by 680
- 2019On Variational Bounds of Mutual Informationcited by 550
17 more
- 2019Self-labelling via simultaneous clustering and representation learningcited by 525
- 2018Invariant Information Clustering for Unsupervised Image Classification and Segmentationcited by 454
- 2020SCAN: Learning to Classify Images without Labelscited by 351
- 2019On Mutual Information Maximization for Representation Learningcited by 315
- 2020Contrastive Clusteringcited by 264
- 2016Variational Deep Embedding: An Unsupervised and Generative Approach to Clusteringcited by 219
- 2016Joint Unsupervised Learning of Deep Representations and Image Clusterscited by 205
- 2017Learning Discrete Representations via Information Maximizing Self-Augmented Trainingcited by 149
- 2015Unsupervised and Semi-supervised Learning with Categorical Generative Adversarial Networkscited by 94
- 2018SpectralNet: Spectral Clustering using Deep Neural Networkscited by 94
- 2018ClusterGAN : Latent Space Clustering in Generative Adversarial Networkscited by 75
- 2019N2D: (Not Too) Deep Clustering via Clustering the Local Manifold of an Autoencoded Embeddingcited by 30
- 2020Deep Transformation-Invariant Clusteringcited by 26
- 2021Connecting Language and Vision for Natural Language-Based Vehicle Retrievalcited by 12
- 2016Minimax-optimal semi-supervised regression on unknown manifoldscited by 7
- 2015Deep Learning with Nonparametric Clusteringcited by 6
- 2019Generalized Clustering by Learning to Optimize Expected Normalized Cutscited by 3
Built on by
Citing papers per year: 2024: 1; 2025: 3; 2026: 1.
5 papers.
- 2024Weighted Point Set Embedding for Multimodal Contrastive Learning Toward Optimal Similarity Metriccited by 6
- 2026Zero-Flow Encoderscited by 4
- 2025Theoretical Refinement of CLIP by Utilizing Linear Structure of Optimal Similaritycited by 2
- 2025Graph of Agents: Principled Long Context Modeling by Emergent Multi-Agent Collaborationcited by 1
- 2025SONA: Learning Conditional, Unconditional, and Mismatching-Aware Discriminatorcited by 0
- 2026Zero-Flow Encoders31 Jan 2026
- 2025Theoretical Refinement of CLIP by Utilizing Linear Structure of Optimal Similarity17 Oct 2025
- 2025SONA: Learning Conditional, Unconditional, and Mismatching-Aware Discriminator6 Oct 2025
- 2025Graph of Agents: Principled Long Context Modeling by Emergent Multi-Agent Collaboration26 Sep 2025
- 2024Weighted Point Set Embedding for Multimodal Contrastive Learning Toward Optimal Similarity Metric30 Apr 2024