Task Switching Without Forgetting via Proximal Decoupling
Not on the map. Why?
Abstract (arXiv)
In continual learning, the primary challenge is to learn new information without forgetting old knowledge. A common solution addresses this trade-off through regularization, penalizing changes to parameters critical for previous tasks. In most cases, this regularization term is directly added to the training loss and optimized with standard gradient descent, which blends learning and retention signals into a single update and does not explicitly separate essential parameters from redundant ones. As task sequences grow, this coupling can over-constrain the model, limiting forward transfer and leading to inefficient use of capacity. We propose a different approach that separates task learning from stability enforcement via operator splitting. The learning step focuses on minimizing the current task loss, while a proximal stability step applies a sparse regularizer to prune unnecessary parameters and preserve task-relevant ones. This turns the stability-plasticity into a negotiated update between two complementary operators, rather than a conflicting gradient. We provide theoretical justification for the splitting method on the continual-learning objective, and demonstrate that our proposed solver achieves state-of-the-art results on standard benchmarks, improving both stability and adaptability without the need for replay buffers, Bayesian sampling, or meta-learning components.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 49 of its 76 references that are in the map. First posted on arXiv 20 Apr 2026.
Builds on
49 of 76 references.
References · 49
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
- 2016Progressive Neural Networkscited by 1,361
- 2018Continual Lifelong Learning with Neural Networks: A Reviewcited by 1,330
- 2017Memory Aware Synapses: Learning what (not) to forgetcited by 1,105
- 2018Efficient Lifelong Learning with A-GEMcited by 1,058
- 2017Lifelong Learning with Dynamically Expandable Networkscited by 694
- 2018Overcoming catastrophic forgetting with hard attention to the taskcited by 681
- 2016MS-Celeb-1M: A Dataset and Benchmark for Large-Scale Face Recognitioncited by 624
- 2017Measuring Catastrophic Forgetting in Neural Networkscited by 360
- 2019REMIND Your Neural Network to Prevent Catastrophic Forgettingcited by 197
- 2019Meta-Learning Representations for Continual Learningcited by 189
37 more
- 2017OSQP: An Operator Splitting Solver for Quadratic Programscited by 161
- 2019Uncertainty-based Continual Learning with Adaptive Regularizationcited by 146
- 2023Loss of Plasticity in Continual Deep Reinforcement Learningcited by 121
- 2024Disentangling the Causes of Plasticity Loss in Neural Networkscited by 86
- 2021Continual Backprop: Stochastic Gradient Descent with Persistent Randomnesscited by 80
- 2024Continual Learning and Catastrophic Forgettingcited by 77
- 2023Deep Reinforcement Learning with Plasticity Injectioncited by 74
- 2023No One Left Behind: Real-World Federated Class-Incremental Learningcited by 53
- 2024Addressing Loss of Plasticity and Catastrophic Forgetting in Continual Learningcited by 50
- 2023Achieving a Better Stability-Plasticity Trade-off via Auxiliary Networks in Continual Learningcited by 41
- 2023Continual Learning with Scaled Gradient Projectioncited by 34
- 2021FedDR -- Randomized Douglas-Rachford Splitting Algorithms for Nonconvex Federated Composite Optimizationcited by 29
- 2023Continual Learning via Sequential Function-Space Variational Inferencecited by 29
- 2019Bayesian Structure Adaptation for Continual Learningcited by 21
- 2022spred: Solving L1 Penalty with SGDcited by 17
- 2014Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problemscited by 15
- 2019Overcoming Catastrophic Forgetting by Generative Regularizationcited by 13
- 2024Layerwise Proximal Replay: A Proximal Point Method for Online Continual Learningcited by 13
- 2023Recasting Continual Learning as Sequence Modelingcited by 11
- 2021A Fast and Accurate Splitting Method for Optimal Transport: Analysis and Implementationcited by 9
- 2024EVCL: Elastic Variational Continual Learning with Weight Consolidationcited by 9
- 2025BECAME: BayEsian Continual Learning with Adaptive Model MErgingcited by 9
- 2025Bayesian continual learning and forgetting in neural networkscited by 9
- 2019COSMO: A conic operator splitting method for convex conic problemscited by 8
- 2024Learning to Continually Learn with the Bayesian Principlecited by 8
- 2025STAR: Stability-Inducing Weight Perturbation for Continual Learningcited by 8
- 2019The Douglas-Rachford Algorithm for Convex and Nonconvex Feasibility Problemscited by 7
- 2022Progressive Learning without Forgettingcited by 7
- 2021TAG: Task-based Accumulated Gradients for Lifelong learningcited by 5
- 2022Proximal Residual Flows for Bayesian Inverse Problemscited by 5
- 2023Approximate Bayesian Class-Conditional Models under Continuous Representation Shiftcited by 5
- 2024Tight Verification of Probabilistic Robustness in Bayesian Neural Networkscited by 5
- 2024Continual Domain Adversarial Adaptation via Double-Head Discriminatorscited by 4
- 2015A Statistical Theory of Deep Learning via Proximal Splittingcited by 2
- 2024Accelerated forward-backward and Douglas-Rachford splitting dynamicscited by 2
- 2024A Three-Operator Splitting Scheme Derived from Three-Block ADMMcited by 2
- 2025Flashbacks to Harmonize Stability and Plasticity in Continual Learningcited by 2
Built on by
Not cited yet.