mlsanityData to 7 Oct 2026

Hierarchical Prompts for Rehearsal-free Continual Learning

arXiv 2401.11544 ↗First posted 21 Jan 2024cs.CVcited by 1

Not on the map. Why?

Abstract (arXiv)

Continual learning endeavors to equip the model with the capability to integrate current task knowledge while mitigating the forgetting of past task knowledge. Inspired by prompt tuning, prompt-based methods maintain a frozen backbone and train with slight learnable prompts to minimize the catastrophic forgetting that arises due to updating a large number of backbone parameters. Nonetheless, these learnable prompts tend to concentrate on the discriminatory knowledge of the current task while ignoring past task knowledge, leading to that learnable prompts still suffering from catastrophic forgetting. This paper introduces a novel rehearsal-free paradigm for continual learning termed Hierarchical Prompts (H-Prompts), comprising three categories of prompts -- class prompt, task prompt, and general prompt. To effectively depict the knowledge of past classes, class prompt leverages Bayesian Distribution Alignment to model the distribution of classes in each task. To reduce the forgetting of past task knowledge, task prompt employs Cross-task Knowledge Excavation to amalgamate the knowledge encapsulated in the learned class prompts of past tasks and current task knowledge. Furthermore, general prompt utilizes Generalized Knowledge Exploration to deduce highly generalized knowledge in a self-supervised manner. Evaluations on two benchmarks substantiate the efficacy of the proposed H-Prompts, exemplified by an average accuracy of 87.8% in Split CIFAR-100 and 70.6% in Split ImageNet-R.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 56 of its 73 references that are in the map. First posted on arXiv 21 Jan 2024.

Builds on

56 of 73 references.

References · 56

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  3. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  4. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
  5. 2015U-Net: Convolutional Networks for Biomedical Image Segmentationcited by 19,604
  6. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
  7. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
  8. 2017Mask R-CNNcited by 7,259
  9. 2022Generative Adversarial Networkscited by 5,603
  10. 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
  11. 2015Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learningcited by 4,416
  12. 2019Parameter-Efficient Transfer Learning for NLPcited by 4,195
38 more
  1. 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,769
  2. 2020Supervised Contrastive Learningcited by 2,803
  3. 2016Learning without Forgettingcited by 2,465
  4. 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,313
  5. 2021Learning to Prompt for Vision-Language Modelscited by 2,269
  6. 2021Pre-train, Prompt, and Predict: A Systematic Survey of Prompting Methods in Natural Language Processingcited by 2,222
  7. 2020The Many Faces of Robustness: A Critical Analysis of Out-of-Distribution Generalizationcited by 1,842
  8. 2022Visual Prompt Tuningcited by 1,674
  9. 2018Unsupervised Representation Learning by Predicting Image Rotationscited by 1,586
  10. 2016Progressive Neural Networkscited by 1,332
  11. 2017Memory Aware Synapses: Learning what (not) to forgetcited by 1,094
  12. 2021CLIP-Adapter: Better Vision-Language Models with Feature Adapterscited by 1,021
  13. 2019How Can We Know What Language Models Know?cited by 953
  14. 2021Learning to Prompt for Continual Learningcited by 938
  15. 2020Dark Experience for General Continual Learning: a Strong, Simple Baselinecited by 895
  16. 2017PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruningcited by 882
  17. 2019Large Scale Incremental Learningcited by 727
  18. 2022DualPrompt: Complementary Prompting for Rehearsal-free Continual Learningcited by 635
  19. 2022Vision Transformer Adapter for Dense Predictionscited by 564
  20. 2018Progress & Compress: A scalable framework for continual learningcited by 516
  21. 2021Tip-Adapter: Training-free CLIP-Adapter for Better Vision-Language Modelingcited by 429
  22. 2021DER: Dynamically Expandable Representation for Class Incremental Learningcited by 355
  23. 2023Visual-Language Prompt Tuning with Knowledge-guided Context Optimizationcited by 307
  24. 2021DyTox: Transformers for Continual Learning with DYnamic TOken eXpansioncited by 291
  25. 2022S-Prompts Learning with Pre-trained Transformers: An Occam's Razor for Domain Incremental Learningcited by 246
  26. 2021Co2L: Contrastive Continual Learningcited by 243
  27. 2020Supermasks in Superpositioncited by 223
  28. 2022A Model or 603 Exemplars: Towards Memory-Efficient Class-Incremental Learningcited by 152
  29. 2021OpenPrompt: An Open-source Framework for Prompt-learningcited by 148
  30. 2018Memory Efficient Experience Replay for Streaming Learningcited by 128
  31. 2022Class-Incremental Continual Learning into the eXtended DER-versecited by 121
  32. 2022FeTrIL: Feature Translation for Exemplar-Free Class-Incremental Learningcited by 120
  33. 2022Conv-Adapter: Exploring Parameter Efficient Transfer Learning for ConvNetscited by 62
  34. 2021Essentials for Class Incremental Learningcited by 57
  35. 2019A Comprehensive guide to Bayesian Convolutional Neural Network with Variational Inferencecited by 51
  36. 2022A Continual Deepfake Detection Benchmark: Dataset, Methods, and Essentialscited by 45
  37. 2022Isolation and Impartial Aggregation: A Paradigm of Incremental Learning without Interferencecited by 44
  38. 2017Bayesian Recurrent Neural Networkscited by 39

50 most cited of 56 All 56 (JSON)

Built on by

Cited by year

Citing papers per year: 2024: 1.

1 paper.