Stable Routing for Mixture-of-Experts in Class-Incremental Learning
On the map: Mixture-of-experts → Expert routing strategies
Abstract (arXiv)
Class-incremental learning (CIL) requires models to learn new classes sequentially while preserving prior knowledge. Recently, approaches that combine pre-trained models with mixture-of-experts (MoE) have received increasing attention in CIL: they typically expand experts during learning and employ a router to assign weights across experts. However, existing MoE methods often overlook routing drift induced by expert expansion. Once new experts are introduced, the router may reassign samples from earlier classes to newly added experts, thereby perturbing previously established expert compositions and causing interference even when old experts remain frozen. We argue that expandable MoE in CIL requires two complementary properties: stable old-class routing for knowledge preservation and sufficient capacity utilization for new-class adaptation. To this end, we propose Stable Routing for MoE (StaR-MoE), a routing-level framework for expandable MoE in CIL. By incorporating sensitivity-aware routing alignment, StaR-MoE aligns current old-class routing behavior with historical routing distributions through sensitivity-guided constraints. Complementarily, StaR-MoE introduces asymmetric capacity regularization to encourage effective utilization of the expanded expert pool without compromising class-specific routing specialization. Extensive experiments across four standard CIL benchmarks demonstrate that StaR-MoE consistently improves both average and last accuracy over state-of-the-art methods, highlighting the importance of stable routing.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Placed in Expert routing strategies, one of 12 directions in Mixture-of-experts. Builds on 42 of its 54 references that are in the map. First posted on arXiv 17 May 2026.
Builds on
42 of 54 references.
Closest ancestors · 1
Same direction, newest first
- 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsity11 Jan
Other references · 41
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
- 2021Emerging Properties in Self-Supervised Vision Transformerscited by 6,968
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
- 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,509
- 2016Learning without Forgettingcited by 2,496
- 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,333
- 2017Gradient Episodic Memory for Continual Learningcited by 1,898
- 2020The Many Faces of Robustness: A Critical Analysis of Out-of-Distribution Generalizationcited by 1,850
- 2022Visual Prompt Tuningcited by 1,681
- 2019Natural Adversarial Examplescited by 1,408
- 2017Memory Aware Synapses: Learning what (not) to forgetcited by 1,105
29 more
- 2021Learning to Prompt for Continual Learningcited by 944
- 2020Dark Experience for General Continual Learning: a Strong, Simple Baselinecited by 911
- 2021Towards a Unified View of Parameter-Efficient Transfer Learningcited by 872
- 2023A Comprehensive Survey of Continual Learning: Theory, Method and Applicationcited by 872
- 2022AdaptFormer: Adapting Vision Transformers for Scalable Visual Recognitioncited by 719
- 2017Lifelong Learning with Dynamically Expandable Networkscited by 694
- 2022DualPrompt: Complementary Prompting for Rehearsal-free Continual Learningcited by 642
- 2022CODA-Prompt: COntinual Decomposed Attention-based Prompting for Rehearsal-Free Continual Learningcited by 450
- 2020Class-incremental learning: survey and performance evaluation on image classificationcited by 449
- 2019A Large-scale Study of Representation Learning with the Visual Task Adaptation Benchmarkcited by 425
- 2019Learn to Grow: A Continual Structure Learning Framework for Overcoming Catastrophic Forgettingcited by 302
- 2023Class-Incremental Learning: A Surveycited by 209
- 2024Boosting Continual Learning of Vision-Language Models via Mixture-of-Experts Adapterscited by 199
- 2024InfLoRA: Interference-Free Low-Rank Adaptation for Continual Learningcited by 198
- 2023Revisiting Class-Incremental Learning with Pre-Trained Models: Generalizability and Adaptivity are All You Needcited by 184
- 2023SLCA: Slow Learner with Classifier Alignment for Continual Learning on a Pre-trained Modelcited by 180
- 2023Hierarchical Decomposition of Prompt-Based Continual Learning: Rethinking Obscured Sub-optimalitycited by 121
- 2024Expandable Subspace Ensemble for Pre-Trained Model-Based Class-Incremental Learningcited by 117
- 2023PILOT: A Pre-Trained Model-Based Continual Learning Toolboxcited by 64
- 2025SD-LoRA: Scalable Decoupled Low-Rank Adaptation for Class Incremental Learningcited by 63
- 2020SpaceNet: Make Free Space For Continual Learningcited by 53
- 2024Self-Expansion of Pre-trained Models with Mixture of Adapters for Continual Learningcited by 53
- 2024Class-Incremental Learning with CLIP: Adaptive Representation Adjustment and Parameter Fusioncited by 47
- 2022Exploring Example Influence in Continual Learningcited by 44
- 2025CL-MoE: Enhancing Multimodal Large Language Model with Dual Momentum Mixture-of-Experts for Continual Visual Question Answeringcited by 37
- 2024MOS: Model Surgery for Pre-Trained Model-Based Class-Incremental Learningcited by 36
- 2021Dual-Teacher Class-Incremental Learning With Data-Free Generative Replaycited by 31
- 2025Addressing Imbalanced Domain-Incremental Learning through Dual-Balance Collaborative Expertscited by 13
- 2025One-Prompt Strikes Back: Sparse Mixture of Experts for Prompt-based Continual Learningcited by 2
Built on by
Citing papers per year: 2026: 1.
1 paper.
Similar, not cited
Close in wording, no citation either way
- 2026Scaling Continual Learning to 300+ Tasks with Bi-Level Routing Mixture-of-Experts
- 2025Guided by the Experts: Provable Feature Learning Dynamic of Soft-Routed Mixture-of-Experts
- 2026Share First, Route What Remains: A Unified Framework for Token-Adaptive MoE Computation
- 2026Routing by Analogy: kNN-Augmented Expert Assignment for Mixture-of-Experts
- 2026Towards a Statistical Understanding of Mixture-of-Experts
- 2026Hierarchical Mixture-of-Experts with Two-Stage Optimization
- 2026MoE2-LoRA: When MoE Models Meet MoE-style Low-Rank Adaptation
- 2025How Many Experts Are Enough? Towards Optimal Semantic Specialization for Mixture-of-Experts