mlsanityData to 14 Oct 2026

Preserving Long-Tailed Expert Information in Mixture-of-Experts Tuning

arXiv 2604.23036 ↗First posted 24 Apr 2026cs.LG cs.CLcited by 1

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

Abstract (arXiv)

Despite MoE models leading many benchmarks, supervised fine-tuning (SFT) for the MoE architectures remains difficult because its router layers are fragile. Methods such as DenseMixer and ESFT mitigate router collapse with dense mixing or auxiliary load-balancing losses, but these introduce noisy gradients that often degrade performance. In preliminary experiments, we systematically pruned experts and observed that while certain super experts are activated far more frequently, discarding less used experts still leads to notable performance degradation. This suggests that even rarely activated experts encode non-trivial knowledge useful for downstream tasks. Motivated by this, we propose an auxiliary-loss-free MoE SFT framework that combines bias-driven sparsification with always-active gated condenser experts. Rather than enforcing balanced activation across all experts, our method encourages task-relevant experts to remain active while pushing long-tailed experts toward inactivity. The condenser experts provide a persistent, learnable pathway that alleviates gradient starvation and facilitates consolidation of information that would otherwise remain fragmented across sparsely activated experts. Analysis further suggest that this design better preserves long-tailed expert information under sparse routing. Experiments on large-scale MoE models demonstrate that our approach outperforms state-of-the-art SFT baselines such as DenseMixer and ESFT, achieving average gain of 2.5%+ on both mathematical reasoning and commonsenseQA benchmarks.

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 24 of its 35 references that are in the map. First posted on arXiv 24 Apr 2026.

Builds on

24 of 35 references.

Closest ancestors · 2

Same direction, newest first

  1. 2024Auxiliary-Loss-Free Load Balancing Strategy for Mixture-of-Experts28 Aug
  2. 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsity11 Jan

Other references · 22

  1. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
  2. 2021Training Verifiers to Solve Math Word Problemscited by 10,109
  3. 2025Qwen3 Technical Reportcited by 8,820
  4. 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,944
  5. 2023GPQA: A Graduate-Level Google-Proof Q&A Benchmarkcited by 2,879
  6. 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,079
  7. 2020GShard: Scaling Giant Models with Conditional Computation and Automatic Shardingcited by 1,631
  8. 2025s1: Simple test-time scalingcited by 1,341
  9. 2024DeepSeek-V2: A Strong, Economical, and Efficient Mixture-of-Experts Language Modelcited by 1,135
  10. 2021Are NLP Models really able to Solve Simple Math Word Problems?cited by 878
  11. 2024DoRA: Weight-Decomposed Low-Rank Adaptationcited by 758
  12. 2017Program Induction by Rationale Generation : Learning to Solve and Explain Algebraic Word Problemscited by 650
10 more
  1. 2016Solving General Arithmetic Word Problemscited by 360
  2. 2021ZeRO-Offload: Democratizing Billion-Scale Model Trainingcited by 341
  3. 2023LLM-Adapters: An Adapter Family for Parameter-Efficient Fine-Tuning of Large Language Modelscited by 324
  4. 2024Not All Experts are Equal: Efficient Expert Pruning and Skipping for Mixture-of-Experts Large Language Modelscited by 146
  5. 2025mHC: Manifold-Constrained Hyper-Connectionscited by 88
  6. 2024Hyper-Connectionscited by 84
  7. 2024The Super Weight in Large Language Modelscited by 52
  8. 2024Let the Expert Stick to His Last: Expert-Specialized Fine-Tuning for Sparse Architectural Large Language Modelscited by 21
  9. 2025Unveiling Super Experts in Mixture-of-Experts Large Language Modelscited by 17
  10. 2024Sparse Matrix in Large Language Model Fine-tuningcited by 8

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.

Similar, not cited

Close in wording, no citation either way

  1. 2025TT-LoRA MoE: Unifying Parameter-Efficient Fine-Tuning and Sparse Mixture-of-Experts
  2. 2026Hierarchical Mixture-of-Experts with Two-Stage Optimization
  3. 2024Beyond Parameter Count: Implicit Bias in Soft Mixture of Experts
  4. 2022Task-Specific Expert Pruning for Sparse Mixture-of-Experts
  5. 2026Towards a Statistical Understanding of Mixture-of-Experts
  6. 2026It Takes a MAESTRO To Prune Bad Experts
  7. 2024A Provably Effective Method for Pruning Experts in Fine-tuned Sparse Mixture-of-Experts
  8. 2026MoE-Sieve: Routing-Guided LoRA for Efficient MoE Fine-Tuning