Mixtures of SubExperts for Large Language Continual Learning
Not on the map. Why?
Abstract (arXiv)
Enabling lifelong learning in LLMs demands resolving the stability-plasticity dilemma (i.e., models must incorporate new knowledge without overwriting prior representations) while maintaining scalability under bounded parameter growth. Existing PEFT methods fail to satisfy this triad; shared-parameter approaches suffer from catastrophic interference, while task-isolated expansions preclude knowledge transfer and scale linearly. We propose Mixtures of SubExperts (MoSEs), a modular and sparse framework that factorizes model capacity into reusable, compositional primitives. MoSEs augment transformer layers with lightweight SubExperts and a learned sub-routing function that dynamically selects and composes a sparse subset of modules conditioned on task inputs. This induces a structured decomposition of the parameter space where knowledge is localized yet accessible, mitigating interference while preserving reuse. Specifically, MoSEs balance the dilemma via three pillars: (i) stability by isolating knowledge within sparsely activated modules, (ii) plasticity through routing-driven recombination and selective expansion, and (iii) scalability via sublinear growth in effective capacity. Notably, the routing mechanism enables compositional generalization, allowing new tasks to be represented as combinations of previously acquired sub-functions. We empirically validate MoSEs on TRACE and SuperNI, showing reduced forgetting, improved forward transfer, and better parameter efficiency over strong PEFT baselines. MoSEs establish a new Pareto frontier, achieving state-of-the-art performance while maintaining strict parameter budgets. Our results suggest that modular sparsity and compositional routing are key inductive biases for building foundation models that continually learn without saturation.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 45 of its 53 references that are in the map. First posted on arXiv 9 Nov 2025.
Builds on
45 of 53 references.
References · 45
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 13,958
- 2020Measuring Massive Multitask Language Understandingcited by 7,768
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
- 2019Parameter-Efficient Transfer Learning for NLPcited by 4,195
- 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,878
- 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
- 2022Self-Instruct: Aligning Language Models with Self-Generated Instructionscited by 2,674
- 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,313
- 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,140
33 more
- 2017Gradient Episodic Memory for Continual Learningcited by 1,871
- 2022Challenging BIG-Bench Tasks and Whether Chain-of-Thought Can Solve Themcited by 1,767
- 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
- 2018Efficient Lifelong Learning with A-GEMcited by 1,044
- 2021Learning to Prompt for Continual Learningcited by 938
- 2020Dark Experience for General Continual Learning: a Strong, Simple Baselinecited by 895
- 2021GLaM: Efficient Scaling of Language Models with Mixture-of-Expertscited by 890
- 2022Super-NaturalInstructions: Generalization via Declarative Instructions on 1600+ NLP Taskscited by 858
- 2017Lifelong Learning with Dynamically Expandable Networkscited by 689
- 2022DualPrompt: Complementary Prompting for Rehearsal-free Continual Learningcited by 635
- 2020TyDi QA: A Benchmark for Information-Seeking Question Answering in Typologically Diverse Languagescited by 486
- 2023Safety-Tuned LLaMAs: Lessons From Improving the Safety of Large Language Models that Follow Instructionscited by 377
- 2021Gradient Projection Memory for Continual Learningcited by 338
- 2023AdaLoRA: Adaptive Budget Allocation for Parameter-Efficient Fine-Tuningcited by 337
- 2019On Tiny Episodic Memories in Continual Learningcited by 299
- 2020Supermasks in Superpositioncited by 223
- 2024InfLoRA: Interference-Free Low-Rank Adaptation for Continual Learningcited by 189
- 2023Self-Alignment with Instruction Backtranslationcited by 149
- 2023Hierarchical Decomposition of Prompt-Based Continual Learning: Rethinking Obscured Sub-optimalitycited by 121
- 2023TRACE: A Comprehensive Benchmark for Continual Learning in Large Language Modelscited by 59
- 2023PCR: Proxy-based Contrastive Replay for Online Class-Incremental Continual Learningcited by 50
- 2024Theory on Mixture-of-Experts in Continual Learningcited by 50
- 2024Mixture of Experts Meets Prompt-Based Continual Learningcited by 43
- 2024OLoRA: Orthonormal Low-Rank Adaptation of Large Language Modelscited by 39
- 2024SAPT: A Shared Attention Framework for Parameter-Efficient Continual Learning of Large Language Modelscited by 37
- 2024HiDe-PET: Continual Learning via Hierarchical Decomposition of Parameter-Efficient Tuningcited by 20
- 2024TaSL: Continual Dialog State Tracking via Task Skill Localization and Consolidationcited by 18
- 2025Gated Integration of Low-Rank Adaptation for Continual Learning of Large Language Modelscited by 12
- 2024SEEKR: Selective Attention-Guided Knowledge Retention for Continual Learning of Large Language Modelscited by 11
- 2025TreeLoRA: Efficient Continual Learning via Layer-Wise LoRAs Guided by a Hierarchical Gradient-Similarity Treecited by 11
- 2023Prompt Learning to Mitigate Catastrophic Forgetting in Cross-lingual Transfer for Open-domain Dialogue Generationcited by 4
Built on by
Not cited yet.