Improving Replay Sample Selection and Storage for Less Forgetting in Continual Learning

Daniel Brignac, Niels Lobo, Abhijit Mahalanobis
8/3/2023
cs.LGcs.AI

No confident code implementation found for this paper.

Abstract

Continual learning seeks to enable deep learners to train on a series of tasks of unknown length without suffering from the catastrophic forgetting of previous tasks. One effective solution is replay, which involves storing few previous experiences in memory and replaying them when learning the current task. However, there is still room for improvement when it comes to selecting the most informative samples for storage and determining the optimal number of samples to be stored. This study aims to address these issues with a novel comparison of the commonly used reservoir sampling to various alternative population strategies and providing a novel detailed analysis of how to find the optimal number of stored samples.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{brignac2023improving,
  title  = {Improving Replay Sample Selection and Storage for Less Forgetting in Continual Learning},
  author = {Daniel Brignac and Niels Lobo and Abhijit Mahalanobis},
  year   = {2023},
  eprint = {2308.01895},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2308.01895v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2308.01895.svg)](https://codeofpaper.com/paper/2308.01895)

Discussion