This work reveals 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" in SPIN, which explicitly decouples plasticity and stability by interpolating between a fast-moving"plasticity"sequence and an adaptive"stability"sequence.
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.
EoupCT effectively preserves both task-specific proficiency and inherent general-purpose knowledge, successfully mitigating the catastrophic forgetting, and forms a multi-objective optimization problem and introduces a first-order efficient Pareto optimizer.
Bing Wang, C. Li, Xin-Qiang Cai et al.· 2 citations
We explore catastrophic forgetting in the context of large pre-trained models. By considering forgetting as a geometric problem in the input space of each weight matrix, we uncover a natural retention objective under which updates produced by gradient-based optimizers are suboptimal. Following this observation, we prop...
Assaf Ben-Kish, Akarsh Kumar, James R. Glass et al.· 0 citations
This work proposes Hybrid Momentum (HyM), which combines a linearly weighted average of past gradients with a geometrically discounted fast momentum, and proposes HyMUON, which applies Newton--Schulz orthogonalization to the hybrid direction.
Hai-Feng Xu, Yi-Jin Ren, Chenyu Zhou et al.· 0 citations
Domain-specific continual adaptation of LLMs risks catastrophic forgetting, creating a fundamental tension between acquiring new capabilities and preserving those learned during pretraining. PEFT mitigates this problem by restricting the number of trainable parameters, but existing methods lack a principled unit for de...
Ling-Xiang Wang, Hai-Nan Zhang, Liang Pang et al.· 0 citations
This work introduces Sparse Autoencoder Geometric Anchoring (SAGA), which converts a Sparse Autoencoder (SAE) trained at each task boundary into local, low-rank constraints on representation drift, and establishes its local relation to latent code matching, define its spectral truncation error, and derive a conditional...
A central challenge in continual learning is to acquire new knowledge without forgetting what the model has already learned. This challenge appears in language model training when training data comes from various domain-, user-, or task-specific distributions that are encountered unevenly over time. In such settings, s...
Anton Baumann, Jonas Hübotter, Zeynep Akata et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.