PapersWithELO
← ICLR 2024 leaderboard

Q-Tuning: Continual Queue-based Prompt Tuning for Language Models

Yanhui Guo, Shaoyuan Xu, Jinmiao Fu, Jia Liu, Chaosheng Dong, Bryan Wang

transfer & meta learningContinual LeanringPrompt TuningContinual Prompt TuningLanguage Model
80.00100
Fused
band ≈ ±16 pct pts (from σ = 0.32)
76.80100
Mimo
band ≈ ±22 pct pts (from σ = 0.45)
80.90100
DeepSeek
band ≈ ±22 pct pts (from σ = 0.44)

OpenReview ground truth

Rejected

TL;DR — This paper introduces a continual prompt tuning method called Q-tuning that, to our knowledge, is the first technique for achieving lifelong learning on extremely long task sequences through prompt tuning.

Abstract

This paper introduces **Q-tuning**, a novel approach for continual prompt tuning that enables the lifelong learning of a pretrained language model on a sequence of tasks. For each new task, Q-tuning trains a task-specific prompt by adding it to the prompt queue consisting of the prompts from older tasks. To better transfer the knowledge of older tasks, we design an ensemble mechanism that reweighs previous prompts in queue with a learnable low-rank matrix that reflects their relevance to the current task. To facilitate training and inference with manageable complexity, once the prompt queue reaches its maximum capacity, we leverage a PCA-based eviction rule to reduce the queue's size, allowing the newly trained prompt to be added while preserving the primary knowledge of older tasks. In order to mitigate the accumulation of information loss caused by the eviction, we additionally propose a globally shared prefix prompt and a memory retention regularization based on the information theory. Extensive experiments demonstrate that our approach outperforms the state-of-the-art methods substantially on both short and long task sequences. Moreover, our approach enables the lifelong learning on an extremely long task sequence while requiring only $\mathcal{O}(1)$ complexity for training and inference, which could not be achieved by existing technologies.

Author context

Most prolific author: 7 submissions (credibility 1.00).

No mass-submission penalty for this paper (authors within normal submission volume).

Aggregate statistics only — no individual author rankings.

Ranking trajectory

Percentile by tournament round — convergence indicates rating stability.

Judge assessments

Mean overall score 0.0 ± 0.0 (n = 30)