arXiv:2602.02417cs.LG2026-02

用信任区域+生成回放,让模型快速恢复旧任务性能。

Trust Region Continual Learning as an Implicit Meta-Learner

  • 结合生成回放与费雪信息约束,隐式实现元学习更新。
  • 在图像生成和策略控制任务中表现最佳,恢复旧任务更快。
  • 适合需要长期稳定学习的连续任务场景。

持续学习旨在顺序获取任务而不产生灾难性遗忘,但标准方法面临核心权衡:基于正则化的方法(如EWC)在任务最优解重叠较弱时过度约束更新,而基于回放的方法虽能保持性能却因回放不完美导致漂移。本文提出一种混合视角:信任区域持续学习,将生成回放与费雪度量的信任区域约束相结合。在局部近似下,该更新可解释为类似MAML的单步隐式内循环:回放提供旧任务梯度信号(类查询),费雪加权惩罚实现高效的离线曲率调节(类支持)。这使持续学习模型涌现出元学习特性——在每个任务切换后,模型能快速重新收敛至先前任务的最优解,而无需显式优化双层目标。实验表明,在任务增量扩散图像生成和持续扩散策略控制任务中,该方法达到最优最终性能和保留能力,并始终比EWC、回放及持续元学习基线更快恢复早期任务性能。

原文摘要 · Abstract (English)

Continual learning aims to acquire tasks sequentially without catastrophic forgetting, yet standard strategies face a core tradeoff: regularization-based methods (e.g., EWC) can overconstrain updates when task optima are weakly overlapping, while replay-based methods can retain performance but drift due to imperfect replay. We study a hybrid perspective: \emph{trust region continual learning} that combines generative replay with a Fisher-metric trust region constraint. We show that, under local approximations, the resulting update admits a MAML-style interpretation with a single implicit inner step: replay supplies an old-task gradient signal (query-like), while the Fisher-weighted penalty provides an efficient offline curvature shaping (support-like). This yields an emergent meta-learning property in continual learning: the model becomes an initialization that rapidly \emph{re-converges} to prior task optima after each task transition, without explicitly optimizing a bilevel objective. Empirically, on task-incremental diffusion image generation and continual diffusion-policy control, trust region continual learning achieves the best final performance and retention, and consistently recovers early-task performance faster than EWC, replay, and continual meta-learning baselines.

持续学习元学习生成回放信任区域

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