Analysis of the Memorization and Generalization Capabilities of AI Agents: Are Continual Learners Robust?
Not on the map. Why?
Abstract (arXiv)
In continual learning (CL), an AI agent (e.g., autonomous vehicles or robotics) learns from non-stationary data streams under dynamic environments. For the practical deployment of such applications, it is important to guarantee robustness to unseen environments while maintaining past experiences. In this paper, a novel CL framework is proposed to achieve robust generalization to dynamic environments while retaining past knowledge. The considered CL agent uses a capacity-limited memory to save previously observed environmental information to mitigate forgetting issues. Then, data points are sampled from the memory to estimate the distribution of risks over environmental change so as to obtain predictors that are robust with unseen changes. The generalization and memorization performance of the proposed framework are theoretically analyzed. This analysis showcases the tradeoff between memorization and generalization with the memory size. Experiments show that the proposed algorithm outperforms memory-based CL baselines across all environments while significantly improving the generalization performance on unseen target environments.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 16 of its 20 references that are in the map. First posted on arXiv 18 Sep 2023.
Builds on
16 of 20 references.
References · 16
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
- 2017Gradient Episodic Memory for Continual Learningcited by 1,871
- 2018Experience Replay for Continual Learningcited by 1,074
- 2020Dark Experience for General Continual Learning: a Strong, Simple Baselinecited by 895
- 2019Gradient based sample selection for online continual learningcited by 568
- 2018Progress & Compress: A scalable framework for continual learningcited by 516
- 2020Using Hindsight to Anchor Past Knowledge in Continual Learningcited by 160
- 2020Optimal Continual Learning has Perfect Memory and is NP-hardcited by 86
- 2023Theory on Forgetting and Generalization of Continual Learningcited by 69
- 2021Online Continual Learning with Natural Distribution Shifts: An Empirical Study with Visual Datacited by 67
- 2022Probable Domain Generalization via Quantile Risk Minimizationcited by 66
- 2022Information-theoretic Online Memory Selection for Continual Learningcited by 42
4 more
- 2023The Ideal Continual Learner: An Agent That Never Forgetscited by 34
- 2021Formalizing the Generalization-Forgetting Trade-off in Continual Learningcited by 24
- 2022Edge Continual Learning for Dynamic Digital Twins over Wireless Networkscited by 13
- 2023Out-of-distribution forgetting: vulnerability of continual learning to intra-class distribution shiftcited by 3
Built on by
Citing papers per year: 2025: 1.
1 paper.