FETCH: A Memory-Efficient Replay Approach for Continual Learning in Image Classification

Markus Weißflog, Peter Protzel, Peer Neubert
7/17/2024
cs.CVcs.LG

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

Class-incremental continual learning is an important area of research, as static deep learning methods fail to adapt to changing tasks and data distributions. In previous works, promising results were achieved using replay and compressed replay techniques. In the field of regular replay, GDumb achieved outstanding results but requires a large amount of memory. This problem can be addressed by compressed replay techniques. The goal of this work is to evaluate compressed replay in the pipeline of GDumb. We propose FETCH, a two-stage compression approach. First, the samples from the continual datastream are encoded by the early layers of a pre-trained neural network. Second, the samples are compressed before being stored in the episodic memory. Following GDumb, the remaining classification head is trained from scratch using only the decompressed samples from the reply memory. We evaluate FETCH in different scenarios and show that this approach can increase accuracy on CIFAR10 and CIFAR100. In our experiments, simple compression methods (e.g., quantization of tensors) outperform deep autoencoders. In the future, FETCH could serve as a baseline for benchmarking compressed replay learning in constrained memory scenarios.

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. 1 weaker match is hidden by default — 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{weiflog2024fetch,
  title  = {FETCH: A Memory-Efficient Replay Approach for Continual Learning in Image Classification},
  author = {Markus Weißflog and Peter Protzel and Peer Neubert},
  year   = {2024},
  eprint = {2407.12375},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2407.12375v1}
}

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/2407.12375.svg)](https://codeofpaper.com/paper/2407.12375)

Discussion