Reliable Replay through Spatial Coherence in Online Continual Learning
Not on the map. Why?
Abstract (arXiv)
Continually adapting models to new tasks requires retaining earlier knowledge under limited memory and computation. Experience replay addresses this challenge, but priorities based on individual loss increases overlook how related memories respond to the same update and can overemphasize isolated responses. We introduce SPatial coHErent risk control for REplay (SPHERE), a general replay-allocation method applicable across a broad range of learning settings. SPHERE uses a representation kernel to aggregate signed prospective loss changes, attenuating unsupported spikes while retaining coherent increases. It then formulates allocation as entropy-regularized transport, redistributing uniform source mass toward supported high-risk regions while penalizing long-distance transfers. We derive replay coefficients from the transport objective's sensitivity to the original loss changes and blend them with uniform replay to maintain baseline rehearsal. Our analysis establishes conditions under which kernel aggregation improves risk estimation and bounds transport-value inflation due to residual noise and smoothing bias. Experiments demonstrate that SPHERE improves accuracy and reduces forgetting across noisy-label vision tasks, continual language-model instruction tuning, and code-generation reinforcement learning with incomplete test rewards.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 46 of its 53 references that are in the map. First posted on arXiv 27 Sep 2026.
Builds on
46 of 53 references.
References · 46
- 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 8,851
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
- 2016Learning without Forgettingcited by 2,465
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
- 2017Gradient Episodic Memory for Continual Learningcited by 1,871
- 2016Progressive Neural Networkscited by 1,332
- 2025Understanding R1-Zero-Like Training: A Critical Perspectivecited by 1,276
- 2024Qwen2.5-Coder Technical Reportcited by 1,151
- 2017Memory Aware Synapses: Learning what (not) to forgetcited by 1,094
- 2018Experience Replay for Continual Learningcited by 1,074
- 2018Efficient Lifelong Learning with A-GEMcited by 1,044
- 2020Dark Experience for General Continual Learning: a Strong, Simple Baselinecited by 895
34 more
- 2013An Empirical Investigation of Catastrophic Forgetting in Gradient-Based Neural Networkscited by 711
- 2017Lifelong Learning with Dynamically Expandable Networkscited by 689
- 2018Overcoming catastrophic forgetting with hard attention to the taskcited by 672
- 2018An Empirical Study of Example Forgetting during Deep Neural Network Learningcited by 669
- 2018Learning to Learn without Forgetting by Maximizing Transfer and Minimizing Interferencecited by 511
- 2019Online Continual Learning with Maximally Interfered Retrievalcited by 376
- 2019Orthogonal Gradient Descent for Continual Learningcited by 361
- 2022CodeRL: Mastering Code Generation through Pretrained Models and Deep Reinforcement Learningcited by 342
- 2021Gradient Projection Memory for Continual Learningcited by 338
- 2023Orthogonal Subspace Learning for Language Model Continual Learningcited by 296
- 2018Task-Free Continual Learningcited by 219
- 2021New Insights on Reducing Abrupt Representation Change in Online Continual Learningcited by 215
- 2016Stochastic Optimization for Large-scale Optimal Transportcited by 188
- 2019Episodic Memory in Lifelong Language Learningcited by 188
- 2020Understanding the Role of Training Regimes in Continual Learningcited by 177
- 2020Anatomy of Catastrophic Forgetting: Hidden Representations and Task Semanticscited by 158
- 2020Continual Prototype Evolution: Learning Online from Non-Stationary Data Streamscited by 143
- 2021Supervised Contrastive Replay: Revisiting the Nearest Class Mean Classifier in Online Class-Incremental Continual Learningcited by 140
- 2022Class-Incremental Continual Learning into the eXtended DER-versecited by 121
- 2025KodCode: A Diverse, Challenging, and Verifiable Synthetic Dataset for Codingcited by 115
- 2022Learning Fast, Learning Slow: A General Continual Learning Method based on Complementary Learning Systemcited by 110
- 2020Continual Deep Learning by Functional Regularisation of Memorable Pastcited by 104
- 2020Gradient-based Editing of Memory Examples for Online Task-free Continual Learningcited by 62
- 2023Real-Time Evaluation in Online Continual Learning: A New Hopecited by 47
- 2021Co-Transport for Class-Incremental Learningcited by 38
- 2022Online Continual Learning on a Contaminated Data Stream with Blurry Task Boundariescited by 31
- 2022Improving Task-free Continual Learning by Distributionally Robust Memory Evolutioncited by 29
- 2021Continual Learning on Noisy Data Streams via Self-Purified Replaycited by 27
- 2024Forgetting, Ignorance or Myopia: Revisiting Key Challenges in Online Continual Learningcited by 11
- 2023AdaER: An Adaptive Experience Replay Approach for Continual Lifelong Learningcited by 9
- 2022CNLL: A Semi-supervised Approach For Continual Noisy Label Learningcited by 8
- 2024May the Forgetting Be with You: Alternate Replay for Learning with Noisy Labelscited by 2
- 2024Lifelong Event Detection via Optimal Transportcited by 2
- 2026Robust Generalization with Adaptive Optimal Transport Priors for Decision-Focused Learningcited by 2
Built on by
Not cited yet.