提出新方法让LoRA在持续学习中更好共享与隔离知识
Task-Driven Subspace Decomposition for Knowledge Sharing and Isolation in LoRA-based Continual Learning
- 按任务需求分解子空间,区分通用与专属更新方向
- 在多个数据集上优于现有方法,最高提升6.2%准确率
- 适合需要高效适应新任务且不遗忘旧知识的场景
持续学习要求模型在不遗忘旧知识的前提下顺序适应新任务。近年来,低秩适配(LoRA)作为一种代表性参数高效微调方法,在持续学习中受到越来越多关注。现有基于LoRA的持续学习方法通过将更新空间分离来减少任务间干扰,通常从过往任务的零空间估计构建新空间。然而,这些方法存在两个问题:(i) 忽略了任务共享方向,抑制了知识迁移;(ii) 由于旧任务的‘零基’在相关任务下可能几乎不活跃,难以捕捉真正有效的特定任务方向。为此,我们从投影能量角度研究LoRA的学习能力,提出低秩分解与适配(LoDA)。LoDA通过求解两个能量目标,实现任务驱动的分解,构建通用与真实任务特定的LoRA子空间,从而解耦知识共享与隔离方向。LoDA固定在两个子空间上的低维投影,并通过梯度对齐优化(GAO)学习鲁棒的上投影。每次任务后,在将LoRA更新整合到主干网络前,LoDA推导出闭式校准,近似沿任务共享方向的特征级联合最优。实验表明,LoDA优于现有持续学习方法。代码已公开于 https://github.com/HHHLF/LoDA_ICML2026。
原文摘要 · Abstract (English)
Continual Learning (CL) requires models to sequentially adapt to new tasks without forgetting old knowledge. Recently, Low-Rank Adaptation (LoRA), a representative Parameter-Efficient Fine-Tuning (PEFT) method, has gained increasing attention in CL. Several LoRA-based CL methods reduce interference across tasks by separating their update spaces, typically building the new space from the estimated null space of past tasks. However, they (i) overlook task-shared directions, which suppresses knowledge transfer, and (ii) fail to capture truly effective task-specific directions since these ``null bases" of old tasks can remain nearly inactive for new task under correlated tasks. To address this, we study LoRA learning capability from a projection energy perspective, and propose Low-rank Decomposition and Adaptation (LoDA). It performs a task-driven decomposition to build general and truly task-specific LoRA subspaces by solving two energy-based objectives, decoupling directions for knowledge sharing and isolation. LoDA fixes LoRA down-projections on two subspaces and learns robust up-projections via a Gradient-Aligned Optimization (GAO) approach. After each task, before integrating the LoRA updates into the backbone, LoDA derives a closed-form recalibration for the general update, approximating a feature-level joint optimum along this task-shared direction. Experiments indicate that LoDA outperforms existing CL methods. Our code is available at https://github.com/HHHLF/LoDA_ICML2026.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。