mlsanityData to 14 Oct 2026

Rapid Adaptation in Online Continual Learning: Are We Evaluating It Right?

arXiv 2305.09275 ↗First posted 16 May 2023cs.LG cs.AI cs.CVcited by 10

Not on the map. Why?

Abstract (arXiv)

We revisit the common practice of evaluating adaptation of Online Continual Learning (OCL) algorithms through the metric of online accuracy, which measures the accuracy of the model on the immediate next few samples. However, we show that this metric is unreliable, as even vacuous blind classifiers, which do not use input images for prediction, can achieve unrealistically high online accuracy by exploiting spurious label correlations in the data stream. Our study reveals that existing OCL algorithms can also achieve high online accuracy, but perform poorly in retaining useful information, suggesting that they unintentionally learn spurious label correlations. To address this issue, we propose a novel metric for measuring adaptation based on the accuracy on the near-future samples, where spurious correlations are removed. We benchmark existing OCL approaches using our proposed metric on large-scale datasets under various computational budgets and find that better generalization can be achieved by retaining and reusing past seen information. We believe that our proposed metric can aid in the development of truly adaptive OCL methods. We provide code to reproduce our results at https://github.com/drimpossible/EvalOCL.

Key facts. Cited by 10 papers in the map (data through 14 Oct 2026). Builds on 27 of its 31 references that are in the map. First posted on arXiv 16 May 2023.

Builds on

27 of 31 references.

References · 27

  1. 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
  2. 2016Learning without Forgettingcited by 2,496
  3. 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,333
  4. 2016Membership Inference Attacks against Machine Learning Modelscited by 2,281
  5. 2017Gradient Episodic Memory for Continual Learningcited by 1,898
  6. 2018Efficient Lifelong Learning with A-GEMcited by 1,058
  7. 2020In Search of Lost Domain Generalizationcited by 1,054
  8. 2020Dark Experience for General Continual Learning: a Strong, Simple Baselinecited by 911
  9. 2023A Comprehensive Survey of Continual Learning: Theory, Method and Applicationcited by 872
  10. 2021Generalizing to Unseen Domains: A Survey on Domain Generalizationcited by 766
  11. 2018Riemannian Walk for Incremental Learning: Understanding Forgetting and Intransigencecited by 742
  12. 2018Exploring the Limits of Weakly Supervised Pretrainingcited by 605
15 more
  1. 2019Gradient based sample selection for online continual learningcited by 571
  2. 2019Online Continual Learning with Maximally Interfered Retrievalcited by 379
  3. 2021Rainbow Memory: Continual Learning with a Memory of Diverse Samplescited by 273
  4. 2021New Insights on Reducing Abrupt Representation Change in Online Continual Learningcited by 219
  5. 2022Reconstructing Training Data from Trained Neural Networkscited by 133
  6. 2022The CLEAR Benchmark: Continual LEArning on Real-World Imagerycited by 93
  7. 2019Lifelong Machine Learning with Deep Streaming Linear Discriminant Analysiscited by 92
  8. 2022Towards Adversarial Evaluations for Inexact Machine Unlearningcited by 84
  9. 2021Online Continual Learning with Natural Distribution Shifts: An Empirical Study with Visual Datacited by 69
  10. 2021Online Continual Learning on Class Incremental Blurry Task Configuration with Anytime Inferencecited by 67
  11. 2022Continual Learning with Foundation Models: An Empirical Study of Latent Replaycited by 61
  12. 2023Computationally Budgeted Continual Learning: What Does Matter?cited by 61
  13. 2022Class-Incremental Learning with Strong Pre-trained Modelscited by 60
  14. 2022A Simple Baseline that Questions the Use of Pretrained-Models in Continual Learningcited by 54
  15. 2022Improving information retention in large scale online continual learningcited by 3

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 7; 2024: 1; 2025: 1; 2026: 1.

10 papers.