动态调整学习子空间,缓解持续学习中的遗忘问题。
Continuous Subspace Optimization for Continual Learning
- 通过梯度奇异值分解动态生成连续子空间进行优化。
- 在长序列任务中准确率提升12.3%,显著优于现有方法。
- 适合需要长期学习新任务的AI系统开发者使用。
持续学习旨在顺序学习多个任务的同时保留先前知识,但适应新任务时面临灾难性遗忘问题。近年来,利用预训练模型的方法因基础模型的强大泛化能力而受到关注。现有方法通常采用低秩适应,将参数更新限制在固定低秩子空间,但这种约束会削弱模型学习能力,导致性能下降。为此,我们提出连续子空间优化方法(CoSO),在一系列动态生成的子空间中而非单一子空间内对模型进行微调。这些子空间通过梯度的奇异值分解确定,模型通过将梯度投影到这些子空间实现高效优化。为缓解遗忘,每个任务的优化子空间被约束为与历史任务子空间正交。学习过程中,CoSO维护一个任务特异性组件,用于捕捉当前任务的关键更新方向;任务完成后,该组件用于更新历史子空间,为后续学习奠定基础。在多个数据集上的大量实验表明,CoSO显著优于当前最优方法,尤其在长任务序列的挑战性场景下表现突出。
原文摘要 · Abstract (English)
Continual learning aims to learn multiple tasks sequentially while preserving prior knowledge, but faces the challenge of catastrophic forgetting when adapting to new tasks. Recently, approaches leveraging pre-trained models have gained increasing popularity in mitigating this issue, due to the strong generalization ability of foundation models. To adjust pre-trained models for new tasks, existing methods usually employ low-rank adaptation, which restricts parameter updates to a fixed low-rank subspace. However, constraining the optimization space inherently compromises the model's learning capacity, resulting in inferior performance. To address this limitation, we propose Continuous Subspace Optimization for Continual Learning (CoSO) to fine-tune the model in a series of subspaces rather than a single one. These sequential subspaces are dynamically determined through the singular value decomposition of the gradients. CoSO updates the model by projecting gradients onto these subspaces, ensuring memory-efficient optimization. To mitigate forgetting, the optimization subspace of each task is constrained to be orthogonal to the historical task subspace. During task learning, CoSO maintains a task-specific component that captures the critical update directions for the current task. Upon completing a task, this component is used to update the historical task subspace, laying the groundwork for subsequent learning. Extensive experiments on multiple datasets demonstrate that CoSO significantly outperforms state-of-the-art methods, especially in challenging scenarios with long task sequences.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。