SPARS: A Stability-Plasticity-Aware Region Selection Framework for Continual Learning
cs.LG
Submitted: 2026-10-14
Updated: 2026-10-14
Code: https://github.com/teifaldaajani1999-sys/SPARS
License: http://creativecommons.org/licenses/by/4.0/
The gist: Continual learning aims to acquire new knowledge while retaining previously learned knowledge.
Terminology
Abstract
Continual learning aims to acquire new knowledge while retaining previously learned knowledge. However, updating shared parameters when learning new tasks often overwrites existing knowledge, causing catastrophic forgetting. Memory replay methods mitigate catastrophic forgetting but rely on previous samples, raising privacy, memory, and scalability concerns. On the other hand, parameter isolation-based methods preserve learned knowledge but may limit knowledge transfer, whereas regularization promotes adaptability but remains susceptible to interference between old and new tasks. To maintain the stability-plasticity trade-off, this paper proposes Stability-Plasticity-Aware Region Selection (SPARS), a replay-free hybrid framework combining global parameter isolation with localized parameter regularization. SPARS estimates parameter importance using either the Fisher Information Matrix (FIM) or a novel Confidence Score (CS) estimator that leverages logit sensitivity and achieves comparable performance to FIM without requiring labelled data. Based on parameter importance, SPARS partitions parameters into three importance-aware regions namely, winning, neighboring, and non-important parameter regions. Each region receives a different adaptation strategy: selective freezing, soft regularization, or unrestricted learning based on its role in the stability-plasticity trade-off. To mitigate classifier bias in class-incremental learning, we employ Quadratic Discriminant Analysis to improve performance on previously learned classes.Experiments on CIFAR-10 and TinyImageNet demonstrate consistent improvement in average incremental accuracy over existing isolation- and regularization-based methods across task- and class-incremental learning. On TinyImageNet, SPARS achieves the best performance with 6% improvement for class-incremental learning while retaining over 60% of parameters for future tasks.
Sources
- Functional Regularisation for Continual Learning with Gaussian Processes
- Memory Replay with Data Compression for Continual Learning
- Piggyback: Adapting a Single Network to Multiple Tasks by Learning to Mask Weights
- Overcoming catastrophic forgetting with hard attention to the task
- NISPA: Neuro-Inspired Stability-Plasticity Adaptation for Continual Learning in Sparse Networks
- Maintaining Discrimination and Fairness in Class Incremental Learning
- Gradient Episodic Memory for Continual Learning
- Efficient Lifelong Learning with A-GEM
- Continual Learning with Deep Generative Replay
- Memory Replay GANs: learning to generate images from new categories without forgetting
- Dark Experience for General Continual Learning: a Strong, Simple Baseline
- Uncertainty-guided Continual Learning with Bayesian Neural Networks
- Variational Continual Learning
- Optimizing Reusable Knowledge for Continual Learning via Metalearning
- Supermasks in Superposition
- Towards Redundancy-Free Sub-networks in Continual Learning
- Forget-free Continual Learning with Soft-Winning SubNetworks
- Using Hindsight to Anchor Past Knowledge in Continual Learning
- Consistency is the key to further mitigating catastrophic forgetting in continual learning
- No Forgetting Learning: Buffer-free Continual Learning Classification
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks