analiza aiqbench
This paper proposes SPIN, an optimizer for online continual learning that separates a fast "plasticity" update sequence from a slower, adaptive "stability" sequence, with the authors claiming a Tikhonov-style regularization effect against forgetting. The gains are reported across several OCL methods, but the results are from the authors' own experiments and need independent replication, especially in the rehearsal-free and memory-constrained settings they highlight. For ML practitioners, the main takeaway is that optimizer choice is being treated as a lever for catastrophic forgetting rather than a fixed default.
From Generic to Dedicated: A Novel Optimizer for Online Continual Learning
arXiv:2610.27835v1 Announce Type: new Abstract: Online Continual Learning (OCL) requires models to learn from non-stationary data streams under a strict single-pass constraint, making them highly susceptible to catastrophic forgetting. While existing studies have explored various strategies from data, architecture, and optimization perspectives, the optimizer often directly uses generic approaches such as SGD and AdamW. In this work, we reveal a new link between optimization dynamics and OCL needs by recasting Polyak-Ruppert averaging as the engine of "plasticity" and Primal averaging as the anchor of "stability". This inspires our novel optimizer, SPIN (Stability-Plasticity INterpolation), which explicitly decouples plasticity and stability by interpolating between a fast-moving "plasticity" sequence and an adaptive "stability" sequence. We theoretically demonstrate that SPIN implicitly employs an inverse Hessian approximation, providing crucial Tikhonov regularization to damp noisy, single-sample Hessian estimates and mitigate forgetting. More importantly, SPIN can be seamlessly integrated into existing OCL methods by taking resulted gradients as input and replacing standard optimizers. Extensive experiments show that using SPIN instead of standard optimizers yields consistent and significant performance gains across multiple OCL approaches, including the challenging rehearsal-free setting and under strict memory constraints.
Abstract:Online Continual Learning (OCL) requires models to learn from non-stationary data streams under a strict single-pass constraint, making them highly susceptible to catastrophic forgetting. While existing studies have explored various strategies from data, architecture, and optimization perspectives, the optimizer often directly uses generic approaches such as SGD and AdamW. In this work, we reveal a new link between optimization dynamics and OCL needs by recasting Polyak-Ruppert averaging as the engine of "plasticity" and Primal averaging as the anchor of "stability". This inspires our novel optimizer, SPIN (Stability-Plasticity INterpolation), which explicitly decouples plasticity and stability by interpolating between a fast-moving "plasticity" sequence and an adaptive "stability" sequence. We theoretically demonstrate that SPIN implicitly employs an inverse Hessian approximation, providing crucial Tikhonov regularization to damp noisy, single-sample Hessian estimates and mitigate forgetting. More importantly, SPIN can be seamlessly integrated into existing OCL methods by taking resulted gradients as input and replacing standard optimizers. Extensive experiments show that using SPIN instead of standard optimizers yields consistent and significant performance gains across multiple OCL approaches, including the challenging rehearsal-free setting and under strict memory constraints.
Machine Learning (cs.LG); Computer Vision and Pattern Recognition (cs.CV)
arXiv:2610.27835 [cs.LG]
(or arXiv:2610.27835v1 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2610.27835 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 281 cuvinte
Subiecte conexe
DocTrace: Towards Traceable Long Document VQA via Hierarchical Evidence Graph Reasoning
arXiv · 5 aug. 2026
A Resource Estimation Model for the Hardware-Software Co-Design of Distributed Quantum Architectures
arXiv · 28 iul. 2026
Frame the adversary: a structure-aware attack methodology
arXiv · 28 sept. 2026
SSR: Sparse Segment Reduction for Ternary GEMM Acceleration
arXiv · 7 oct. 2026