Freeze and Cluster: A Simple Baseline for Rehearsal-Free Continual Category Discovery
Not on the map. Why?
Abstract (arXiv)
This paper addresses the problem of Rehearsal-Free Continual Category Discovery (RF-CCD), which focuses on continuously identifying novel class by leveraging knowledge from labeled data. Existing methods typically train from scratch, overlooking the potential of base models, and often resort to data storage to prevent forgetting. Moreover, because RF-CCD encompasses both continual learning and novel class discovery, previous approaches have struggled to effectively integrate advanced techniques from these fields, resulting in less convincing comparisons and failing to reveal the unique challenges posed by RF-CCD. To address these challenges, we lead the way in integrating advancements from both domains and conducting extensive experiments and analyses. Our findings demonstrate that this integration can achieve state-of-the-art results, leading to the conclusion that in the presence of pre-trained models, the representation does not improve and may even degrade with the introduction of unlabeled data. To mitigate representation degradation, we propose a straightforward yet highly effective baseline method. This method first utilizes prior knowledge of known categories to estimate the number of novel classes. It then acquires representations using a model specifically trained on the base classes, generates high-quality pseudo-labels through k-means clustering, and trains only the classifier layer. We validate our conclusions and methods by conducting extensive experiments across multiple benchmarks, including the Stanford Cars, CUB, iNat, and Tiny-ImageNet datasets. The results clearly illustrate our findings, demonstrate the effectiveness of our baseline, and pave the way for future advancements in RF-CCD.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 48 of its 56 references that are in the map. First posted on arXiv 12 Mar 2025.
Builds on
48 of 56 references.
References · 48
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
- 2021Masked Autoencoders Are Scalable Vision Learnerscited by 7,403
- 2021Emerging Properties in Self-Supervised Vision Transformerscited by 6,968
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
- 2016Learning without Forgettingcited by 2,496
- 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,333
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
- 2018Deep Clustering for Unsupervised Learning of Visual Featurescited by 1,028
- 2021Learning to Prompt for Continual Learningcited by 944
- 2020Dark Experience for General Continual Learning: a Strong, Simple Baselinecited by 911
- 2021iBOT: Image BERT Pre-Training with Online Tokenizercited by 903
- 2018Overcoming catastrophic forgetting with hard attention to the taskcited by 681
36 more
- 2022DualPrompt: Complementary Prompting for Rehearsal-free Continual Learningcited by 642
- 2019Self-labelling via simultaneous clustering and representation learningcited by 528
- 2022CODA-Prompt: COntinual Decomposed Attention-based Prompting for Rehearsal-Free Continual Learningcited by 450
- 2022Mitigating Neural Network Overconfidence with Logit Normalizationcited by 252
- 2019Learning to Discover Novel Visual Categories via Deep Transfer Clusteringcited by 225
- 2022Generalized Category Discoverycited by 211
- 2023SLCA: Slow Learner with Classifier Alignment for Continual Learning on a Pre-trained Modelcited by 180
- 2021Benchmarking Representation Learning for Natural World Image Collectionscited by 168
- 2021Open-World Semi-Supervised Learningcited by 165
- 2023RanPAC: Random Projections and Pre-trained Models for Continual Learningcited by 164
- 2021A Unified Objective for Novel Class Discoverycited by 162
- 2021An Empirical Investigation of the Role of Pre-training in Lifelong Learningcited by 134
- 2017Learning to cluster in order to transfer across domains and taskscited by 128
- 2021AutoNovel: Automatically Discovering and Learning Novel Visual Categoriescited by 116
- 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
- 2023Dynamic Conceptional Contrastive Learning for Generalized Category Discoverycited by 92
- 2022PromptCAL: Contrastive Affinity Learning via Auxiliary Prompts for Generalized Novel Category Discoverycited by 87
- 2023FeCAM: Exploiting the Heterogeneity of Class Distributions in Exemplar-Free Continual Learningcited by 87
- 2021AFEC: Active Forgetting of Negative Transfer in Continual Learningcited by 73
- 2022A Simple Baseline that Questions the Use of Pretrained-Models in Continual Learningcited by 54
- 2023First Session Adaptation: A Strong Replay-Free Baseline for Class-Incremental Learningcited by 46
- 2022CoSCL: Cooperation of Small Continual Learners is Stronger than a Big Onecited by 43
- 2022Class-incremental Novel Class Discoverycited by 42
- 2023MetaGCD: Learning to Continually Learn in Generalized Category Discoverycited by 42
- 2022Novel Class Discovery without Forgettingcited by 39
- 2022Grow and Merge: A Unified Framework for Continuous Categories Discoverycited by 33
- 2023Think, Act, and Ask: Open-World Interactive Personalized Robot Navigationcited by 31
- 2024Active Generalized Category Discoverycited by 31
- 2020Triple Memory Networks: a Brain-Inspired Method for Continual Learningcited by 28
- 2023Incremental Generalized Category Discoverycited by 25
- 2023Class-relation Knowledge Distillation for Novel Class Discoverycited by 23
- 2023Novel Class Discovery for Long-tailed Recognitioncited by 19
- 2024Effective Prompt Pool Learning for Continual Category Discoverycited by 14
- 2023Large-scale Pre-trained Models are Surprisingly Strong in Incremental Novel Class Discoverycited by 11
- 2024Dual-level Adaptive Self-Labeling for Novel Class Discovery in Point Cloud Segmentationcited by 10
Built on by
Not cited yet.