arXiv:2409.18860cs.CV2024-09被引 10

提出动态增减提示集的方法,让模型自动判断是否新增提示以提升持续学习性能。

LW2G: Learning Whether to Grow for Prompt-based Continual Learning

  • 基于任务差异动态决定是否新增提示集
  • 新方法在多个数据集上显著提升准确率,最高达8.2%
  • 适合需要高效持续学习的场景,如在线推理系统

近期基于提示的持续学习(PCL)在预训练模型上取得了显著成果。这类方法通过在学习过程中扩展提示池,并在推理时选择合适的提示集。然而,以往研究发现,为每个任务单独学习提示集以及选择准确率低,限制了PCL性能。本文提出一种即插即用的方法LW2G,利用任务间差异构建高效提示集池,实现任务内知识共享与协作,同时避免提示池成本无限增长。当多个任务具有共性时使用共享提示集,当新任务与旧任务差异显著时则新增提示集。为此,我们设计了一个叫阻碍前向能力(HFC)的度量指标,用于评估在正交于旧特征空间的方向上修改原始梯度对新任务学习的阻碍程度。结合动态阈值的自适应生长机制,实现是否增长的自动化决策。此外,引入基于梯度的约束,确保更新后的提示与预训练知识一致。大量实验验证了该方法的有效性。代码已开源。

原文摘要 · Abstract (English)

Recent Prompt-based Continual learning (PCL) has achieved remarkable performance with pre-trained models. These approaches expand a prompt pool by adding a new set of prompts while learning and select the correct set during inference. Previous studies have revealed that learning task-wised prompt sets individually and low selection accuracy pose challenges to the performance of PCL. In this paper, we propose a plug-in method, $\textbf{L}$earning $\textbf{W}$hether $\textbf{t}$o $\textbf{G}$row $\textbf{(LW2G)}$, which leverages the disparities between tasks to form an effective and efficient prompt sets pool, thereby achieving intra-task knowledge sharing and cooperation and avoiding the unbounded increase in the cost of the prompt pool. Specifically, a shared set is utilized when several tasks share certain commonalities, and a new set is added when there are significant differences between the new and previous tasks. To achieve this, we develop a metric called Hinder Forward Capability (HFC) to measure the hindrance imposed on learning new tasks by surgically modifying the original gradient onto the orthogonal complement of the old feature space. With HFC, an automated scheme, Dynamic Growing Approach, adaptively learns whether to grow with a dynamic threshold. Furthermore, we design a gradient-based constraint to ensure consistency between the updating prompts and pre-trained knowledge. Extensive experiments show the effectiveness of our method. Code is available at https://github.com/RAIAN08/LW2G.

持续学习提示学习动态增长

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。