arXiv:2502.07274cs.LGcs.AI2025-02被引 8

在内存充足时代,让模型持续学习更省算力。

Forget Forgetting: Continual Learning in a World of Abundant Memory

  • 用参数重置恢复学习新任务的能力
  • 结合权重平均提升旧知识稳定性
  • 适合资源有限却需长期更新的系统

持续学习(CL)传统上追求最小化示例存储,但现代系统中主要瓶颈是GPU时间而非存储。本文研究一种更现实的场景:内存充足可避免遗忘,但从头训练仍代价高昂。在此‘中间地带’,核心挑战从稳定性转向可塑性,模型对旧任务产生偏差,难学新内容。相反,提升稳定性后,简单回放基线即可以极低的GPU成本超越当前最先进方法。为此,我们提出权重空间巩固(Weight Space Consolidation),通过(1)基于秩的参数重置恢复可塑性,(2)权重平均增强稳定性。在图像分类和大语言模型持续指令微调任务上验证,该方法优于强基线,同时保持回放的低计算开销,为内存非瓶颈的实际持续学习系统提供高效新基准。

原文摘要 · Abstract (English)

Continual learning (CL) has traditionally focused on minimizing exemplar memory, a constraint often misaligned with modern systems where GPU time, not storage, is the primary bottleneck. This paper challenges this paradigm by investigating a more realistic regime: one where memory is abundant enough to mitigate forgetting, but full retraining from scratch remains prohibitively expensive. In this practical "middle ground", we find that the core challenge shifts from stability to plasticity, as models become biased toward prior tasks and struggle to learn new ones. Conversely, improved stability allows simple replay baselines to outperform the state-of-the-art methods at a fraction of the GPU cost. To address this newly surfaced trade-off, we propose Weight Space Consolidation, a lightweight method that combines (1) rank-based parameter resets to restore plasticity with (2) weight averaging to enhance stability. Validated on both class-incremental learning with image classifiers and continual instruction tuning with large language models, our approach outperforms strong baselines while matching the low computational cost of replay, offering a scalable alternative to expensive full-retraining. These findings challenge long-standing CL assumptions and establish a new, cost-efficient baseline for real-world CL systems where exemplar memory is no longer the limiting factor.

持续学习轻量化大模型

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