mlsanityData to 14 Oct 2026

Prototype-Based Continual Learning with Label-free Replay Buffer and Cluster Preservation Loss

arXiv 2504.07240 ↗First posted 9 Apr 2025cs.LGcited by 9

Not on the map. Why?

Abstract (arXiv)

Continual learning techniques employ simple replay sample selection processes and use them during subsequent tasks. Typically, they rely on labeled data. In this paper, we depart from this by automatically selecting prototypes stored without labels, preserving cluster structures in the latent space across tasks. By eliminating label dependence in the replay buffer and introducing cluster preservation loss, it is demonstrated that the proposed method can maintain essential information from previously encountered tasks while ensuring adaptation to new tasks. "Push-away" and "pull-toward" mechanisms over previously learned prototypes are also introduced for class-incremental and domain-incremental scenarios. These mechanisms ensure the retention of previously learned information as well as adaptation to new classes or domain shifts. The proposed method is evaluated on several benchmarks, including SplitCIFAR100, SplitImageNet32, SplitTinyImageNet, and SplitCaltech256 for class-incremental, as well as R-MNIST and CORe50 for domain-incremental setting using pre-extracted DINOv2 features. Experimental results indicate that the label-free replay-based technique outperforms state-of-the-art continual learning methods and, in some cases, even surpasses offline learning. An unsupervised variant of the proposed technique for the class-incremental setting, avoiding labels use even on incoming data, also demonstrated competitive performance, outperforming particular supervised baselines in some cases. These findings underscore the effectiveness of the proposed framework in retaining prior information and facilitating continual adaptation.

Key facts. Cited by 9 papers in the map (data through 14 Oct 2026). Builds on 22 of its 38 references that are in the map. First posted on arXiv 9 Apr 2025.

Builds on

22 of 38 references.

References · 22

  1. 2023DINOv2: Learning Robust Visual Features without Supervisioncited by 7,974
  2. 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
  3. 2020Supervised Contrastive Learningcited by 2,829
  4. 2016Learning without Forgettingcited by 2,496
  5. 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,333
  6. 2017Gradient Episodic Memory for Continual Learningcited by 1,898
  7. 2018Continual Lifelong Learning with Neural Networks: A Reviewcited by 1,330
  8. 2020Dark Experience for General Continual Learning: a Strong, Simple Baselinecited by 911
  9. 2013An Empirical Investigation of Catastrophic Forgetting in Gradient-Based Neural Networkscited by 722
  10. 2017A Downsampled Variant of ImageNet as an Alternative to the CIFAR datasetscited by 377
  11. 2017CORe50: a New Dataset and Benchmark for Continuous Object Recognitioncited by 289
  12. 2021New Insights on Reducing Abrupt Representation Change in Online Continual Learningcited by 219
10 more
  1. 2020SS-IL: Separated Softmax for Incremental Learningcited by 126
  2. 2019Continual Learning for Robotics: Definition, Framework, Learning Strategies, Opportunities and Challengescited by 93
  3. 2021Continual Learning for Real-World Autonomous Systems: Algorithms, Challenges and Frameworkscited by 56
  4. 2023Continual Learning on Dynamic Graphs via Parameter Isolationcited by 36
  5. 2023Prototype-Sample Relation Distillation: Towards Replay-Free Continual Learningcited by 35
  6. 2024Adaptive Memory Replay for Continual Learningcited by 22
  7. 2024PUDD: Towards Robust Multi-modal Prototype-based Deepfake Detectioncited by 10
  8. 2024Dynamic Transformer Architecture for Continual Learning of Multimodal Taskscited by 8
  9. 2024Self-Supervised Representation Learning for Adversarial Attack Detectioncited by 4
  10. 2024Train-On-Request: An On-Device Continual Learning Workflow for Adaptive Real-World Brain Machine Interfacescited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 4; 2026: 5.

9 papers.