Navigating Memory Construction by Global Pseudo-Task Simulation for Continual Learning
Yejia Liu, Wang Zhu, Shaolei Ren

TL;DR
This paper introduces a novel global pseudo-task simulation method for experience replay in continual learning, effectively reducing catastrophic forgetting by optimizing memory construction across tasks.
Contribution
It formulates dynamic memory construction as a combinatorial optimization problem and proposes GPS, a new approach that improves accuracy and unifies existing memory policies.
Findings
GPS consistently improves accuracy on vision benchmarks
The method effectively mitigates catastrophic forgetting
GPS can unify various memory construction policies
Abstract
Continual learning faces a crucial challenge of catastrophic forgetting. To address this challenge, experience replay (ER) that maintains a tiny subset of samples from previous tasks has been commonly used. Existing ER works usually focus on refining the learning objective for each task with a static memory construction policy. In this paper, we formulate the dynamic memory construction in ER as a combinatorial optimization problem, which aims at directly minimizing the global loss across all experienced tasks. We first apply three tactics to solve the problem in the offline setting as a starting point. To provide an approximate solution to this problem in the online continual learning setting, we further propose the Global Pseudo-task Simulation (GPS), which mimics future catastrophic forgetting of the current task by permutation. Our empirical results and analyses suggest that the GPS…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
Taxonomy
TopicsMultimodal Machine Learning Applications · Domain Adaptation and Few-Shot Learning
MethodsExperience Replay · Greedy Policy Search
