Learning in the Null Space: Small Singular Values for Continual Learning
Not on the map. Why?
Abstract (arXiv)
Alleviating catastrophic forgetting while enabling further learning is a primary challenge in continual learning (CL). Orthogonal-based training methods have gained attention for their efficiency and strong theoretical properties, and many existing approaches enforce orthogonality through gradient projection. In this paper, we revisit orthogonality and exploit the fact that small singular values correspond to directions that are nearly orthogonal to the input space of previous tasks. Building on this principle, we introduce NESS (Null-space Estimated from Small Singular values), a CL method that applies orthogonality directly in the weight space rather than through gradient manipulation. Specifically, NESS constructs an approximate null space using the smallest singular values of each layer's input representation and parameterizes task-specific updates via a compact low-rank adaptation (LoRA-style) formulation constrained to this subspace. The subspace basis is fixed to preserve the null-space constraint, and only a single trainable matrix is learned for each task. This design ensures that the resulting updates remain approximately in the null space of previous inputs while enabling adaptation to new tasks. Our theoretical analysis and experiments on three benchmark datasets demonstrate competitive performance, low forgetting, and stable accuracy across tasks, highlighting the role of small singular values in continual learning. The code is available at https://github.com/pacman-ctm/NESS.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 24 of its 28 references that are in the map. First posted on arXiv 25 Feb 2026.
Builds on
24 of 28 references.
References · 24
- 2017mixup: Beyond Empirical Risk Minimizationcited by 5,155
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
- 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,313
- 2016Matching Networks for One Shot Learningcited by 2,246
- 2017Gradient Episodic Memory for Continual Learningcited by 1,871
- 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,404
- 2017Continual Learning with Deep Generative Replaycited by 1,152
- 2018Experience Replay for Continual Learningcited by 1,074
- 2018Efficient Lifelong Learning with A-GEMcited by 1,044
- 2018Overcoming catastrophic forgetting with hard attention to the taskcited by 672
- 2019Orthogonal Gradient Descent for Continual Learningcited by 361
- 2021Gradient Projection Memory for Continual Learningcited by 338
12 more
- 2020How Does Mixup Help With Robustness and Generalization?cited by 193
- 2018Continual Learning of Context-dependent Processing in Neural Networkscited by 178
- 2020Adversarial Continual Learningcited by 140
- 2022TRGP: Trust Region Gradient Projection for Continual Learningcited by 79
- 2024Continual Learning and Catastrophic Forgettingcited by 73
- 2021Flattening Sharpness for Dynamic Gradient Projection Memory Benefits Continual Learningcited by 71
- 2023A Comprehensive Survey of Forgetting in Deep Learning Beyond Continual Learningcited by 66
- 2023Continual Learning with Scaled Gradient Projectioncited by 33
- 2025Parameter-Efficient Continual Fine-Tuning: A Surveycited by 11
- 2024CODE-CL: Conceptor-Based Gradient Projection for Deep Continual Learningcited by 4
- 2025Pay Attention to Small Weightscited by 3
- 2026FlexRank: Nested Low-Rank Knowledge Decomposition for Adaptive Model Deploymentcited by 2
Built on by
Citing papers per year: 2026: 1.
1 paper.