Sharpness-aware Dynamic Anchor Selection for Generalized Category Discovery
Not on the map. Why?
Abstract (arXiv)
Generalized category discovery (GCD) is an important and challenging task in open-world learning. Specifically, given some labeled data of known classes, GCD aims to cluster unlabeled data that contain both known and unknown classes. Current GCD methods based on parametric classification adopt the DINO-like pseudo-labeling strategy, where the sharpened probability output of one view is used as supervision information for the other view. However, large pre-trained models have a preference for some specific visual patterns, resulting in encoding spurious correlation for unlabeled data and generating noisy pseudo-labels. To address this issue, we propose a novel method, which contains two modules: Loss Sharpness Penalty (LSP) and Dynamic Anchor Selection (DAS). LSP enhances the robustness of model parameters to small perturbations by minimizing the worst-case loss sharpness of the model, which suppressing the encoding of trivial features, thereby reducing overfitting of noise samples and improving the quality of pseudo-labels. Meanwhile, DAS selects representative samples for the unknown classes based on KNN density and class probability during the model training and assigns hard pseudo-labels to them, which not only alleviates the confidence difference between known and unknown classes but also enables the model to quickly learn more accurate feature distribution for the unknown classes, thus further improving the clustering accuracy. Extensive experiments demonstrate that the proposed method can effectively mitigate the noise of pseudo-labels, and achieve state-of-the-art results on multiple GCD benchmarks.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 36 of its 54 references that are in the map. First posted on arXiv 15 Dec 2025.
Builds on
36 of 54 references.
References · 36
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2021Emerging Properties in Self-Supervised Vision Transformerscited by 6,893
- 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,404
- 2021ASAM: Adaptive Sharpness-Aware Minimization for Scale-Invariant Learning of Deep Neural Networkscited by 293
- 2019Learning to Discover Novel Visual Categories via Deep Transfer Clusteringcited by 223
- 2022Generalized Category Discoverycited by 209
- 2021Open-World Semi-Supervised Learningcited by 165
- 2021A Unified Objective for Novel Class Discoverycited by 161
- 2020Automatically Discovering and Learning New Visual Categories with Ranking Statisticscited by 141
- 2021Efficient Sharpness-aware Minimization for Improved Training of Neural Networkscited by 137
- 2022Towards Efficient and Scalable Sharpness-Aware Minimizationcited by 129
- 2021Neighborhood Contrastive Learning for Novel Class Discoverycited by 119
24 more
- 2022Parametric Classification for Generalized Category Discovery: A Baseline Studycited by 113
- 2021Novel Visual Category Discovery with Dual Ranking Statistics and Mutual Knowledge Distillationcited by 104
- 2023Sharpness-Aware Gradient Matching for Domain Generalizationcited by 102
- 2020OpenMix: Reviving Known Knowledge for Discovering Novel Visual Categories in An Open Worldcited by 93
- 2023Dynamic Conceptional Contrastive Learning for Generalized Category Discoverycited by 90
- 2022PromptCAL: Contrastive Affinity Learning via Auxiliary Prompts for Generalized Novel Category Discoverycited by 85
- 2020Regularizing Neural Networks via Adversarial Model Perturbationcited by 78
- 2023Learning Semi-supervised Gaussian Mixture Models for Generalized Category Discoverycited by 72
- 2023No Representation Rules Them All in Category Discoverycited by 61
- 2022XCon: Learning with Experts for Fine-grained Category Discoverycited by 50
- 2024SPTNet: An Efficient Alternative Framework for Generalized Category Discovery with Spatial Prompt Tuningcited by 50
- 2023Rethinking Confidence Calibration for Failure Predictioncited by 43
- 2023Learn to Categorize or Categorize to Learn? Self-Coding for Generalized Category Discoverycited by 39
- 2024Contrastive Mean-Shift Learning for Generalized Category Discoverycited by 39
- 2024SelEx: Self-Expertise in Fine-Grained Generalized Category Discoverycited by 34
- 2023ImbSAM: A Closer Look at Sharpness-Aware Minimization in Class-Imbalanced Recognitioncited by 31
- 2024Active Generalized Category Discoverycited by 31
- 2021Unsupervised Selective Labeling for More Effective Semi-Supervised Learningcited by 27
- 2022Modeling Inter-Class and Intra-Class Constraints in Novel Class Discoverycited by 26
- 2025Solving the Catastrophic Forgetting Problem in Generalized Category Discoverycited by 26
- 2023Class-relation Knowledge Distillation for Novel Class Discoverycited by 23
- 2023FlatMatch: Bridging Labeled Data and Unlabeled Data with Cross-Sharpness for Semi-Supervised Learningcited by 20
- 2023Imbalanced Open Set Domain Adaptation via Moving-threshold Estimation and Gradual Alignmentcited by 9
- 2024Learning Visual Conditioning Tokens to Correct Domain Shift for Fully Test-time Adaptationcited by 7
Built on by
Citing papers per year: 2026: 1.
1 paper.