Sparse Subspace-to-Expert Sharing for Task-Agnostic Continual Learning
Not on the map. Why?
Abstract (arXiv)
Continual learning in Large Language Models (LLMs) is hindered by the plasticity-stability dilemma, where acquiring new capabilities often leads to catastrophic forgetting of previous knowledge. Existing methods typically treat parameters uniformly, failing to distinguish between specific task knowledge and shared capabilities. We introduce Mixture of Sparse Experts for Task Agnostic Continual Learning (SETA), a framework that resolves the plasticity-stability conflict through adaptive sparse subspace decomposition into task-specific expert modules. Unlike standard updates, where tasks compete for the same parameters, SETA separates knowledge into unique experts, designed to isolate task-specific patterns, and shared experts, responsible for capturing common features. This structure is maintained through adaptive elastic anchoring and a routing-aware regularization that jointly protect shared knowledge at both the weight and routing levels and enable a unified gating network to automatically retrieve the correct expert combination during inference. Extensive experiments across diverse domain-specific benchmarks demonstrate that SETA achieves competitive or superior overall performance relative to state-of-the-art continual learning baselines, with particularly strong retention of early-task knowledge and improved backward transfer on LLaMA-2 7B and Qwen3-4B.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 32 of its 49 references that are in the map. First posted on arXiv 5 Jun 2026.
Builds on
32 of 49 references.
References · 32
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
- 2019Parameter-Efficient Transfer Learning for NLPcited by 4,195
- 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,878
- 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,769
- 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,413
- 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,014
- 2016Learning without Forgettingcited by 2,465
- 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,313
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
- 2022Learn to Explain: Multimodal Reasoning via Thought Chains for Science Question Answeringcited by 1,881
- 2017Gradient Episodic Memory for Continual Learningcited by 1,871
20 more
- 2020GShard: Scaling Giant Models with Conditional Computation and Automatic Shardingcited by 1,601
- 2016Progressive Neural Networkscited by 1,332
- 2018Continual Lifelong Learning with Neural Networks: A Reviewcited by 1,313
- 2021BitFit: Simple Parameter-efficient Fine-tuning for Transformer-based Masked Language-modelscited by 1,234
- 2023An Empirical Study of Catastrophic Forgetting in Large Language Models During Continual Fine-tuningcited by 622
- 2022Mixture-of-Experts with Expert Choice Routingcited by 611
- 2019Rigging the Lottery: Making All Tickets Winnerscited by 491
- 2019Orthogonal Gradient Descent for Continual Learningcited by 361
- 2021BASE Layers: Simplifying Training of Large, Sparse Modelscited by 315
- 2021Hash Layers For Large Sparse Modelscited by 236
- 2023ReLoRA: High-Rank Training Through Low-Rank Updatescited by 200
- 2023Progressive Prompts: Continual Learning for Language Modelscited by 195
- 2022NumGLUE: A Suite of Fundamental yet Challenging Mathematical Reasoning Taskscited by 110
- 2023MeetingBank: A Benchmark Dataset for Meeting Summarizationcited by 81
- 2023Trillion Dollar Words: A New Financial Dataset, Task & Market Analysiscited by 73
- 2024Analyzing and Reducing Catastrophic Forgetting in Parameter Efficient Tuningcited by 59
- 2024AdaMoLE: Fine-Tuning Large Language Models with Adaptive Mixture of Low-Rank Adaptation Expertscited by 33
- 2024AdaZeta: Adaptive Zeroth-Order Tensor-Train Adaption for Memory-Efficient Large Language Models Fine-Tuningcited by 25
- 2024SLIM: Let LLM Learn More and Forget Less with Soft LoRA and Identity Mixturecited by 19
- 2025Low-Rank Adapters Meet Neural Architecture Search for LLM Compressioncited by 4
Built on by
Not cited yet.