How Efficient Are Today's Continual Learning Algorithms?

Md Yousuf Harun, Jhair Gallardo, Tyler L. Hayes, Christopher Kanan
3/29/2023
cs.CVcs.AIcs.LG

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

Abstract

Supervised Continual learning involves updating a deep neural network (DNN) from an ever-growing stream of labeled data. While most work has focused on overcoming catastrophic forgetting, one of the major motivations behind continual learning is being able to efficiently update a network with new information, rather than retraining from scratch on the training dataset as it grows over time. Despite recent continual learning methods largely solving the catastrophic forgetting problem, there has been little attention paid to the efficiency of these algorithms. Here, we study recent methods for incremental class learning and illustrate that many are highly inefficient in terms of compute, memory, and storage. Some methods even require more compute than training from scratch! We argue that for continual learning to have real-world applicability, the research community cannot ignore the resources used by these algorithms. There is more to continual learning than mitigating catastrophic forgetting.

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{harun2023efficient,
  title  = {How Efficient Are Today's Continual Learning Algorithms?},
  author = {Md Yousuf Harun and Jhair Gallardo and Tyler L. Hayes and Christopher Kanan},
  year   = {2023},
  eprint = {2303.18171},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2303.18171v2}
}

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

Discussion