Adaptive Memory Replay for Continual Learning
James Seale Smith, Lazar Valkov, Shaunak Halbe, Vyshnavi Gutta,, Rogerio Feris, Zsolt Kira, Leonid Karlinsky

TL;DR
This paper introduces an adaptive memory replay framework for continual learning that dynamically selects past data using a multi-armed bandit approach, improving performance and reducing forgetting in large models with abundant data.
Contribution
It proposes a novel adaptive sampling method for continual learning that outperforms traditional replay strategies by framing data selection as a multi-armed bandit problem.
Findings
Reduces forgetting by up to 10%
Maintains training efficiency while improving performance
Effective on both vision and language tasks
Abstract
Foundation Models (FMs) have become the hallmark of modern AI, however, these models are trained on massive data, leading to financially expensive training. Updating FMs as new data becomes available is important, however, can lead to `catastrophic forgetting', where models underperform on tasks related to data sub-populations observed too long ago. This continual learning (CL) phenomenon has been extensively studied, but primarily in a setting where only a small amount of past data can be stored. We advocate for the paradigm where memory is abundant, allowing us to keep all previous data, but computational resources are limited. In this setting, traditional replay-based CL approaches are outperformed by a simple baseline which replays past data selected uniformly at random, indicating that this setting necessitates a new approach. We address this by introducing a framework of adaptive…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDomain Adaptation and Few-Shot Learning
