arXiv:2503.13575cs.LGcs.AI2025-03被引 2

提出ASR方法,在不重放数据情况下实现LLM持续学习中的知识保留。

Analytic Subspace Routing: How Recursive Least Squares Works in Continual Learning of Large Language Model

  • 通过低秩适应隔离任务学习子空间,减少任务间干扰。
  • 使用递归最小二乘法训练路由模型,动态分配任务到合适子空间。
  • 无需历史数据即可保持旧知识,理论保障无遗忘,适合持续学习场景。

大型语言模型(LLMs)具备处理多样化语言任务的通用能力,但微调会削弱其通用性,持续微调更会导致累积知识严重退化。为应对这一挑战,本文提出解析子空间路由(Analytic Subspace Routing, ASR),在不依赖历史数据重放的前提下,实现大模型持续学习。针对每个任务,通过低秩适应将学习限制在深层特征的子空间中,有效避免不同任务间的知识干扰;同时设计解析式路由机制,利用递归最小二乘法训练多任务路由器,使其能动态适应新输入,无需访问历史数据。该路由器可精准将当前任务分配至合适子空间,并在理论上保证对先前任务的无遗忘性。实验表明,该方法在几乎完全保留旧知识的同时,无缝融合新信息,显著优于现有方法。代码将在录用后公开。

原文摘要 · Abstract (English)

Large Language Models (LLMs) possess encompassing capabilities that can process diverse language-related tasks. However, finetuning on LLMs will diminish this general skills and continual finetuning will further cause severe degradation on accumulated knowledge. Recently, Continual Learning (CL) in Large Language Models (LLMs) arises which aims to continually adapt the LLMs to new tasks while maintaining previously learned knowledge and inheriting general skills. Existing techniques either leverage previous data to replay, leading to extra computational costs, or utilize a single parameter-efficient module to learn the downstream task, constraining new knowledge absorption with interference between different tasks. Toward these issues, this paper proposes Analytic Subspace Routing(ASR) to address these challenges. For each task, we isolate the learning within a subspace of deep layers' features via low-rank adaptation, eliminating knowledge interference between different tasks. Additionally, we propose an analytic routing mechanism to properly utilize knowledge learned in different subspaces. Our approach employs Recursive Least Squares to train a multi-task router model, allowing the router to dynamically adapt to incoming data without requiring access to historical data. Also, the router effectively assigns the current task to an appropriate subspace and has a non-forgetting property of previously learned tasks with a solid theoretical guarantee. Experimental results demonstrate that our method achieves near-perfect retention of prior knowledge while seamlessly integrating new information, effectively overcoming the core limitations of existing methods. Our code will be released after acceptance.

持续学习大模型子空间路由无遗忘

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