mlsanityData to 7 Oct 2026

KOPPA: Improving Prompt-based Continual Learning with Key-Query Orthogonal Projection and Prototype-based One-Versus-All

arXiv 2311.15414 ↗First posted 26 Nov 2023cs.LG cs.CVcited by 6

Not on the map. Why?

Abstract (arXiv)

Drawing inspiration from prompt tuning techniques applied to Large Language Models, recent methods based on pre-trained ViT networks have achieved remarkable results in the field of Continual Learning. Specifically, these approaches propose to maintain a set of prompts and allocate a subset of them to learn each task using a key-query matching strategy. However, they may encounter limitations when lacking control over the correlations between old task queries and keys of future tasks, the shift of features in the latent space, and the relative separation of latent vectors learned in independent tasks. In this work, we introduce a novel key-query learning strategy based on orthogonal projection, inspired by model-agnostic meta-learning, to enhance prompt matching efficiency and address the challenge of shifting features. Furthermore, we introduce a One-Versus-All (OVA) prototype-based component that enhances the classification head distinction. Experimental results on benchmark datasets demonstrate that our method empowers the model to achieve results surpassing those of current state-of-the-art approaches by a large margin of up to 20%.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 26 of its 34 references that are in the map. First posted on arXiv 26 Nov 2023.

Builds on

26 of 34 references.

References · 26

  1. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
  2. 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,861
  3. 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,878
  4. 2016Learning without Forgettingcited by 2,465
  5. 2021Learning to Prompt for Vision-Language Modelscited by 2,269
  6. 2018Moment Matching for Multi-Source Domain Adaptationcited by 1,327
  7. 2017Memory Aware Synapses: Learning what (not) to forgetcited by 1,094
  8. 2021Learning to Prompt for Continual Learningcited by 938
  9. 2020Dark Experience for General Continual Learning: a Strong, Simple Baselinecited by 895
  10. 2017PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruningcited by 882
  11. 2022DualPrompt: Complementary Prompting for Rehearsal-free Continual Learningcited by 635
  12. 2019Three scenarios for continual learningcited by 610
14 more
  1. 2022CODA-Prompt: COntinual Decomposed Attention-based Prompting for Rehearsal-Free Continual Learningcited by 446
  2. 2021Gradient Projection Memory for Continual Learningcited by 338
  3. 2020Semantic Drift Compensation for Class-Incremental Learningcited by 241
  4. 2020Supermasks in Superpositioncited by 223
  5. 2023RanPAC: Random Projections and Pre-trained Models for Continual Learningcited by 162
  6. 2021Supervised Contrastive Replay: Revisiting the Nearest Class Mean Classifier in Online Class-Incremental Continual Learningcited by 140
  7. 2022Unsupervised Prompt Learning for Vision-Language Modelscited by 125
  8. 2023Hierarchical Decomposition of Prompt-Based Continual Learning: Rethinking Obscured Sub-optimalitycited by 121
  9. 2021Online Coreset Selection for Rehearsal-based Continual Learningcited by 114
  10. 2021OVANet: One-vs-All Network for Universal Domain Adaptationcited by 92
  11. 2022Probing Representation Forgetting in Supervised and Unsupervised Continual Learningcited by 74
  12. 2022A Closer Look at Rehearsal-Free Continual Learningcited by 54
  13. 2022Energy-based Latent Aligner for Incremental Learningcited by 37
  14. 2022Learning Bayesian Sparse Networks with Full Experience Replay for Continual Learningcited by 27

Built on by

Cited by year

Citing papers per year: 2024: 5; 2025: 1.

6 papers.