Key-Value Pair-Free Continual Learner via Task-Specific Prompt-Prototype

Haihua Luo, Xuming Ran, Zhengji Li, Huiyan Xue, Tingting Jiang +4 more
1/8/2026
cs.AI

No confident code implementation found for this paper. 2 possible matches can be shown below.

Abstract

Continual learning aims to enable models to acquire new knowledge while retaining previously learned information. Prompt-based methods have shown remarkable performance in this domain; however, they typically rely on key-value pairing, which can introduce inter-task interference and hinder scalability. To overcome these limitations, we propose a novel approach employing task-specific Prompt-Prototype (ProP), thereby eliminating the need for key-value pairs. In our method, task-specific prompts facilitate more effective feature learning for the current task, while corresponding prototypes capture the representative features of the input. During inference, predictions are generated by binding each task-specific prompt with its associated prototype. Additionally, we introduce regularization constraints during prompt initialization to penalize excessively large values, thereby enhancing stability. Experiments on several widely used datasets demonstrate the effectiveness of the proposed method. In contrast to mainstream prompt-based approaches, our framework removes the dependency on key-value pairs, offering a fresh perspective for future continual learning research.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 2 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{luo2026keyvalue,
  title  = {Key-Value Pair-Free Continual Learner via Task-Specific Prompt-Prototype},
  author = {Haihua Luo and Xuming Ran and Zhengji Li and Huiyan Xue and Tingting Jiang and Jiangrong Shen and Tommi Kärkkäinen and Qi Xu and Fengyu Cong},
  year   = {2026},
  eprint = {2601.04864},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2601.04864v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2601.04864.svg)](https://codeofpaper.com/paper/2601.04864)

Discussion