Generalized Category Discovery via Token Manifold Capacity Learning
Not on the map. Why?
Abstract (arXiv)
Generalized category discovery (GCD) is essential for improving deep learning models' robustness in open-world scenarios by clustering unlabeled data containing both known and novel categories. Traditional GCD methods focus on minimizing intra-cluster variations, often sacrificing manifold capacity, which limits the richness of intra-class representations. In this paper, we propose a novel approach, Maximum Token Manifold Capacity (MTMC), that prioritizes maximizing the manifold capacity of class tokens to preserve the diversity and complexity of data. MTMC leverages the nuclear norm of singular values as a measure of manifold capacity, ensuring that the representation of samples remains informative and well-structured. This method enhances the discriminability of clusters, allowing the model to capture detailed semantic features and avoid the loss of critical information during clustering. Through theoretical analysis and extensive experiments on coarse- and fine-grained datasets, we demonstrate that MTMC outperforms existing GCD methods, improving both clustering accuracy and the estimation of category numbers. The integration of MTMC leads to more complete representations, better inter-class separability, and a reduction in dimensional collapse, establishing MTMC as a vital component for robust open-world learning. Code is in github.com/lytang63/MTMC.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 42 of its 65 references that are in the map. First posted on arXiv 20 May 2025.
Builds on
42 of 65 references.
References · 42
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
- 2021Emerging Properties in Self-Supervised Vision Transformerscited by 6,968
- 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,750
- 2020Unsupervised Learning of Visual Features by Contrasting Cluster Assignmentscited by 2,857
- 2020Supervised Contrastive Learningcited by 2,829
- 2021Barlow Twins: Self-Supervised Learning via Redundancy Reductioncited by 1,838
- 2013Fine-Grained Visual Classification of Aircraftcited by 1,726
- 2018ImageNet-trained CNNs are biased towards texture; increasing shape bias improves accuracy and robustnesscited by 1,432
- 2020Understanding Contrastive Representation Learning through Alignment and Uniformity on the Hyperspherecited by 1,405
- 2021VICReg: Variance-Invariance-Covariance Regularization for Self-Supervised Learningcited by 1,057
- 2021Domain Generalization: A Surveycited by 764
30 more
- 2017SphereFace: Deep Hypersphere Embedding for Face Recognitioncited by 737
- 2021Understanding Dimensional Collapse in Contrastive Self-supervised Learningcited by 378
- 2021Open-Set Recognition: a Good Closed-Set Classifier is All You Need?cited by 353
- 2018Recent Advances in Open Set Recognition: A Surveycited by 310
- 2019Learning to Discover Novel Visual Categories via Deep Transfer Clusteringcited by 225
- 2022Generalized Category Discoverycited by 211
- 2023Towards Open Vocabulary Learning: A Surveycited by 166
- 2021Open-World Semi-Supervised Learningcited by 165
- 2021A Unified Objective for Novel Class Discoverycited by 162
- 2021On Feature Decorrelation in Self-Supervised Learningcited by 160
- 2020Automatically Discovering and Learning New Visual Categories with Ranking Statisticscited by 143
- 2022Parametric Classification for Generalized Category Discovery: A Baseline Studycited by 113
- 2015Reducing Overfitting in Deep Networks by Decorrelating Representationscited by 94
- 2023Dynamic Conceptional Contrastive Learning for Generalized Category Discoverycited by 92
- 2022PromptCAL: Contrastive Affinity Learning via Auxiliary Prompts for Generalized Novel Category Discoverycited by 87
- 2019Hyperspherical Prototype Networkscited by 86
- 2023Learning Semi-supervised Gaussian Mixture Models for Generalized Category Discoverycited by 72
- 2019The Herbarium Challenge 2019 Datasetcited by 60
- 2022Parametric Information Maximization for Generalized Category Discoverycited by 39
- 2024Contrastive Mean-Shift Learning for Generalized Category Discoverycited by 39
- 2022Self-Supervised Learning with an Information Maximization Criterioncited by 38
- 2023Learning Efficient Coding of Natural Images with Maximum Manifold Capacity Representationscited by 31
- 2024Active Generalized Category Discoverycited by 31
- 2025ProtoGCD: Unified and Unbiased Prototype Learning for Generalized Category Discoverycited by 19
- 2024Happy: A Debiased Learning Framework for Continual Generalized Category Discoverycited by 18
- 2023The Role of Entropy and Reconstruction in Multi-View Self-Supervised Learningcited by 13
- 2023Pre-training with Random Orthogonal Projection Image Modelingcited by 11
- 2023Towards Mitigating Dimensional Collapse of Representations in Collaborative Filteringcited by 10
- 2024Towards an Improved Understanding and Utilization of Maximum Manifold Capacity Representationscited by 8
- 2015Connections Between Nuclear Norm and Frobenius Norm Based Representationscited by 7
Built on by
Citing papers per year: 2025: 1; 2026: 2.
3 papers.
- 2025Dissecting Generalized Category Discovery: Multiplex Consensus under Self-Deconstructioncited by 13
- 2026SpectralGCD: Spectral Concept Selection and Cross-modal Representation Learning for Generalized Category Discoverycited by 3
- 2026InfoSculpt: Sculpting the Latent Space for Generalized Category Discoverycited by 0
- 2026SpectralGCD: Spectral Concept Selection and Cross-modal Representation Learning for Generalized Category Discovery19 Feb 2026
- 2026InfoSculpt: Sculpting the Latent Space for Generalized Category Discovery15 Jan 2026
- 2025Dissecting Generalized Category Discovery: Multiplex Consensus under Self-Deconstruction14 Aug 2025