提出新框架,让模型在保留旧知识和快速适应新任务间动态权衡。
To Retain or to Adapt? Generalizing Continual Learning

- 用任务持续时间定义关键阈值,判断旧知识是助力还是负担。
- 理论证明:过度保留会因历史偏差导致新任务学习效率下降。
- 适合关注长期适应能力的智能系统研究者,如机器人、推荐系统。
持续学习(CL)领域长期以缓解灾难性遗忘为目标,其默认假设是终身学习者应逼近联合任务学习(JTL)解并保留全部已有知识。本文挑战这一以保留为核心的范式,指出在非平稳环境中过度强调保留会阻碍实时适应。转而以平均终身误差(ALE)为优化目标,将CL形式化为受环境与学习动态交互影响的在线优化问题。引入迁移效率作为衡量不稳定性(由冲突过往经验带来的偏差)与瞬时误差(从零开始学新任务的代价)之间张力的指标。在弱收敛条件下,该分解推导出一个闭式临界任务持续时间:当历史知识引发正静态偏差时,超过此阈值则旧知识由预热优势转为优化负担。在图像分类与强化学习基准上验证了理论预测。进一步将持续学习与可预测序列的在线学习框架关联,表明JTL仅为更广泛目标族中的特例,并提出新型算法类别——预测性持续学习(Predictive CL),其通过显式更新的未来任务模型优化预期性能。以窗口算法为例,该算法在控制分布漂移下优于JTL与独立任务学习(ITL)。
原文摘要 · Abstract (English)
The Continual Learning (CL) literature has long been driven by the goal of mitigating catastrophic forgetting. This objective rests on a pervasive, often unstated assumption: that a lifelong learner should approximate the Joint-Task Learning (JTL) solution and retain all previously acquired knowledge. We challenge this retention-centered premise, arguing that in non-stationary environments prioritizing retention can impede real-time adaptation. Shifting the focus to the Average Lifelong Error (ALE), we formalize CL as an online optimization problem governed by the interaction between environmental and learning dynamics. We introduce Transfer Efficiency as a quantitative measure of the tension between Instability, the bias inherited from conflicting past experience, and Transient Error, the optimization cost of learning new tasks from scratch. Under mild convergence conditions, holding across linear and neural network models, this decomposition yields a Critical Task Duration: a closed-form threshold beyond which historical knowledge transitions from a warm-start advantage to an optimization liability whenever retention induces a positive stationary bias. We validate these theoretical predictions on continual image classification and reinforcement learning benchmarks. Finally, by connecting continual learning to the online learning framework of predictable sequences, we show that JTL is only one instance of a broader family of objectives, and we propose a new general class of continual learning algorithms, which we call Predictive Continual Learning. Predictive CL algorithms optimize expected future performance under an explicit, dynamically updated model of future tasks. As a proof of concept, we analyze a Window algorithm that interpolates between JTL and Independent-Task Learning (ITL), outperforming both under controlled distributional drift.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。