On the Diminishing Returns of Width for Continual Learning

E. Guha, V. Lakshman
2/12/2026

No confident code implementation found for this paper.

Abstract

While deep neural networks have demonstrated groundbreaking performance in various settings, these models often suffer from \emph{catastrophic forgetting} when trained on new tasks in sequence. Several works have empirically demonstrated that increasing the width of a neural network leads to a decrease in catastrophic forgetting but have yet to characterize the exact relationship between width and continual learning. We design one of the first frameworks to analyze Continual Learning Theory and prove that width is directly related to forgetting in Feed-Forward Networks (FFN). Specifically, we demonstrate that increasing network widths to reduce forgetting yields diminishing returns. We empirically verify our claims at widths hitherto unexplored in prior studies where the diminishing returns are clearly observed as predicted by our theory.

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{guha2026diminishing,
  title  = {On the Diminishing Returns of Width for Continual Learning},
  author = {E. Guha and V. Lakshman},
  year   = {2026},
  eprint = {2403.06398},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2403.06398},
  journal = {ICML 2024 2024}
}

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

Discussion