mlsanityData to 7 Oct 2026

On the Convergence of Continual Learning with Adaptive Methods

arXiv 2404.05555 ↗First posted 8 Apr 2024cs.LG cs.AI stat.MLcited by 7

Not on the map. Why?

Abstract (arXiv)

One of the objectives of continual learning is to prevent catastrophic forgetting in learning multiple tasks sequentially, and the existing solutions have been driven by the conceptualization of the plasticity-stability dilemma. However, the convergence of continual learning for each sequential task is less studied so far. In this paper, we provide a convergence analysis of memory-based continual learning with stochastic gradient descent and empirical evidence that training current tasks causes the cumulative degradation of previous tasks. We propose an adaptive method for nonconvex continual learning (NCCL), which adjusts step sizes of both previous and current tasks with the gradients. The proposed method can achieve the same convergence rate as the SGD method when the catastrophic forgetting term which we define in the paper is suppressed at each iteration. Further, we demonstrate that the proposed algorithm improves the performance of continual learning over existing methods for several image classification tasks.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 28 of its 37 references that are in the map. First posted on arXiv 8 Apr 2024.

Builds on

28 of 37 references.

References · 28

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
  3. 2016Learning without Forgettingcited by 2,465
  4. 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,313
  5. 2016Matching Networks for One Shot Learningcited by 2,246
  6. 2017Gradient Episodic Memory for Continual Learningcited by 1,871
  7. 2018Efficient Lifelong Learning with A-GEMcited by 1,044
  8. 2019On the Convergence of Adam and Beyondcited by 834
  9. 2013Stochastic First- and Zeroth-order Methods for Nonconvex Stochastic Programmingcited by 716
  10. 2017Lifelong Learning with Dynamically Expandable Networkscited by 689
  11. 2019Gradient based sample selection for online continual learningcited by 568
  12. 2018Learning to Learn without Forgetting by Maximizing Transfer and Minimizing Interferencecited by 511
16 more
  1. 2019Online Continual Learning with Maximally Interfered Retrievalcited by 376
  2. 2017Variational Continual Learningcited by 335
  3. 2020Supermasks in Superpositioncited by 223
  4. 2019A Tail-Index Analysis of Stochastic Gradient Noise in Deep Neural Networkscited by 213
  5. 2020Understanding the Role of Training Regimes in Continual Learningcited by 177
  6. 2020Using Hindsight to Anchor Past Knowledge in Continual Learningcited by 160
  7. 2020Linear Mode Connectivity in Multitask and Continual Learningcited by 144
  8. 2016Stochastic Variance Reduction for Nonconvex Optimizationcited by 143
  9. 2020A Neural Dirichlet Process Mixture Model for Task-Free Continual Learningcited by 133
  10. 2019Overcoming Catastrophic Forgetting with Unlabeled Data in the Wildcited by 111
  11. 2019Uncertainty-guided Continual Learning with Bayesian Neural Networkscited by 100
  12. 2020Continual Learning in Low-rank Orthogonal Subspacescited by 99
  13. 2020Optimal Continual Learning has Perfect Memory and is NP-hardcited by 86
  14. 2020Gradient-based Editing of Memory Examples for Online Task-free Continual Learningcited by 62
  15. 2017Non-convex Finite-Sum Optimization Via SCSG Methodscited by 61
  16. 2020Fractional Underdamped Langevin Dynamics: Retargeting SGD with Momentum under Heavy-Tailed Gradient Noisecited by 33

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 1; 2025: 2; 2026: 4.

7 papers.