mlsanityData to 7 Oct 2026

Mixture-of-Experts with Gradient Conflict-Driven Subspace Topology Pruning for Emergent Modularity

arXiv 2512.20291 ↗First posted 23 Dec 2025cs.LGcited by 0

On the map: Mixture-of-experts → Expert routing strategies

Abstract (arXiv)

Mixture-of-Experts (MoE) architectures achieve parameter efficiency through conditional computation, yet contemporary designs suffer from two fundamental limitations: structural parameter isolation that causes catastrophic forgetting, and instruction-overfitting that degrades performance in instruction-free scenarios. We propose CDSP-MoE (Conflict-Driven Subspace Pruning MoE), a framework that addresses these issues through a paradigm shift from isolated expert containers to dynamic expert instantiation within a shared physical subspace. Grounded in the Universal Weight Subspace Hypothesis, CDSP-MoE maintains a super-complete parameter backbone where logical experts are carved out via learnable topology masks. Unlike prior work that uses gradient conflict for token reassignment or optimization surgery, we leverage it as a structural supervisory signal: a Lagged Gradient Game penalizes interfering connections in the shared manifold, enabling the topology to spontaneously prune conflicting pathways and evolve interpretable modular structures. Experimental results demonstrate that CDSP-MoE achieves robust content-driven routing without human-defined task labels, maintaining semantic specialization even under strict blind inference protocols where explicit instructions are absent. Code is available at: https://github.com/konodiodaaaaa1/Conflict-Driven-Subspace-Pruning-Mixture-of-Experts

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Placed in Expert routing strategies, one of 12 directions in Mixture-of-experts. Builds on 29 of its 44 references that are in the map. First posted on arXiv 23 Dec 2025.

Builds on

29 of 44 references.

Closest ancestors · 2

Same direction, newest first

  1. 2022Mixture-of-Experts with Expert Choice Routing18 Feb
  2. 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsity11 Jan

Other references · 27

  1. 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
  2. 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,413
  3. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  4. 2017Gradient Episodic Memory for Continual Learningcited by 1,871
  5. 2020GShard: Scaling Giant Models with Conditional Computation and Automatic Shardingcited by 1,601
  6. 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,366
  7. 2017Multi-Task Learning Using Uncertainty to Weigh Losses for Scene Geometry and Semanticscited by 1,345
  8. 2020Gradient Surgery for Multi-Task Learningcited by 1,210
  9. 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,194
  10. 2017Memory Aware Synapses: Learning what (not) to forgetcited by 1,094
  11. 2018Efficient Lifelong Learning with A-GEMcited by 1,044
  12. 2021GLaM: Efficient Scaling of Language Models with Mixture-of-Expertscited by 890
15 more
  1. 2024DeepSeekMoE: Towards Ultimate Expert Specialization in Mixture-of-Experts Language Modelscited by 834
  2. 2018Multi-Task Learning as Multi-Objective Optimizationcited by 809
  3. 2017An Overview of Multi-Task Learning in Deep Neural Networkscited by 791
  4. 2021Scaling Vision with Sparse Mixture of Expertscited by 740
  5. 2018Loss Surfaces, Mode Connectivity, and Fast Ensembling of DNNscited by 585
  6. 2022ST-MoE: Designing Stable and Transferable Sparse Expert Modelscited by 391
  7. 2019Which Tasks Should Be Learned Together in Multi-task Learning?cited by 367
  8. 2019Orthogonal Gradient Descent for Continual Learningcited by 361
  9. 2023AdaLoRA: Adaptive Budget Allocation for Parameter-Efficient Fine-Tuningcited by 337
  10. 2018Essentially No Barriers in Neural Network Energy Landscapecited by 328
  11. 2022Unified Scaling Laws for Routed Language Modelscited by 249
  12. 2017Routing Networks: Adaptive Selection of Non-linear Functions for Multi-Task Learningcited by 125
  13. 2021Learning Neural Network Subspacescited by 82
  14. 2025The Universal Weight Subspace Hypothesiscited by 22
  15. 2024Solving Token Gradient Conflict in Mixture-of-Experts for Large Vision-Language Modelcited by 11

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2026Beyond Magnitude: Contrastive Routing for Modular Mixture-of-Experts
  2. 2026SHAPE: Coalition-Aware Expert Pruning for Sparse Mixture-of-Experts LLMs
  3. 2026The Illusion of Specialization: Unveiling the Domain-Invariant "Standing Committee" in Mixture-of-Experts Models
  4. 2026IntBMoE: Integrating Block-Level Conditioning into Expert Composition for Full-Participation Mixture-of-Experts
  5. 2025Mixture-of-Clustered-Experts: Advancing Expert Specialization and Generalization in Instruction Tuning
  6. 2026MAPLE: MoE Adaptive Plug-and-play Layer-wise Expert allocation
  7. 2026STAR: Rethinking MoE Routing as Structure-Aware Subspace Learning
  8. 2026Grassmannian Mixture-of-Experts: Concentration-Controlled Routing on Subspace Manifolds