mlsanityData to 14 Oct 2026

Less is MoE: Trimming Experts in Domain-Specialist Language Models

arXiv 2606.05538 ↗First posted 4 Jun 2026cs.LG cs.CLcited by 2

On the map: Mixture-of-experts → MoE large language models

Abstract (arXiv)

Mixture-of-Experts (MoE) models achieve strong performance through conditional computation, but their large parameter footprint poses deployment challenges. Prior MoE compression approaches catastrophically fail when evaluated on general-purpose benchmarks beyond commonsense reasoning. We trace this failure to the granularity of compression: important capabilities are distributed across experts but concentrated in FFN sparse intermediate dimensions. To identify these dimensions, we use Fisher importance which outperforms activation-, router-score-, and magnitude-based alternatives, and identifies tiny sets of task-critical dimensions: in Qwen1.5-MoE, removing as few as 12 of 1.35M routed-FFN intermediate dimensions collapses GSM8K accuracy while largely preserving factual-knowledge performance. Building on this, we propose Fisher-MoE, which operates within FFN to remove intermediate dimensions ranked by Fisher importance. At the same 50% MoE compression ratio, Fisher-MoE preserves model capability, while reducing weight memory by ~45% and improving inference throughput by 21%. These findings suggest intermediate dimension granularity is an effective unit for both compression and ranking where capability concentrates in MoE models.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Placed in MoE large language models, one of 12 directions in Mixture-of-experts. Builds on 31 of its 45 references that are in the map. First posted on arXiv 4 Jun 2026.

Builds on

31 of 45 references.

Closest ancestors · 8

Same direction, newest first

  1. 2025Delta Decompression for MoE-based LLMs Compression24 Feb
  2. 2024MoE-I2: Compressing Mixture of Experts Models through Inter-Expert Pruning and Intra-Expert Low-Rank Decomposition1 Nov
  3. 2024MoE-Pruner: Pruning Mixture-of-Experts Large Language Model using the Hints from Its Router15 Oct
  4. 2024Retraining-Free Merging of Sparse MoE via Hierarchical Clustering11 Oct
  5. 2024STUN: Structured-Then-Unstructured Pruning for Scalable MoE Pruning10 Sep
  6. 2024Towards Efficient Mixture of Experts: A Holistic Study of Compression Techniques4 Jun
  7. 2020GShard: Scaling Giant Models with Conditional Computation and Automatic Sharding30 Jun
  8. 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer23 Jan

Other references · 23

  1. 2021Training Verifiers to Solve Math Word Problemscited by 10,109
  2. 2021Evaluating Large Language Models Trained on Codecited by 8,320
  3. 2020Measuring Massive Multitask Language Understandingcited by 7,963
  4. 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,944
  5. 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,371
  6. 2021Program Synthesis with Large Language Modelscited by 3,637
  7. 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,073
  8. 2023GPQA: A Graduate-Level Google-Proof Q&A Benchmarkcited by 2,879
  9. 2022Locating and Editing Factual Associations in GPTcited by 2,691
  10. 2023Efficient Streaming Language Models with Attention Sinkscited by 2,186
  11. 2020Transformer Feed-Forward Layers Are Key-Value Memoriescited by 1,336
  12. 2023AWQ: Activation-aware Weight Quantization for LLM Compression and Accelerationcited by 1,298
11 more
  1. 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
  2. 2019Analyzing Multi-Head Self-Attention: Specialized Heads Do the Heavy Lifting, the Rest Can Be Prunedcited by 856
  3. 2019Are Sixteen Heads Really Better than One?cited by 816
  4. 2023CMMLU: Measuring massive multitask language understanding in Chinesecited by 449
  5. 2016Solving General Arithmetic Word Problemscited by 360
  6. 2021ZeRO-Offload: Democratizing Billion-Scale Model Trainingcited by 341
  7. 2019Limitations of the Empirical Fisher Approximation for Natural Gradient Descentcited by 217
  8. 2023Merge, Then Compress: Demystify Efficient SMoE with Hints from Its Routing Policycited by 108
  9. 2022Task-Specific Expert Pruning for Sparse Mixture-of-Expertscited by 72
  10. 2024SEER-MoE: Sparse Expert Efficiency through Regularization for Mixture-of-Expertscited by 40
  11. 2026Preserving Long-Tailed Expert Information in Mixture-of-Experts Tuningcited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 2.

2 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2025Efficiently Editing Mixture-of-Experts Models with Compressed Experts
  2. 2026Pruning and Distilling Mixture-of-Experts into Dense Language Models
  3. 2026Towards Principled Design of Mixture-of-Experts Language Models under Memory and Inference Constraints
  4. 2025Cluster-Driven Expert Pruning for Mixture-of-Experts Large Language Models
  5. 2026PRIME: Frequency-Aware Unified Pruning and Merging for MoE Compression
  6. 2025Parameters vs FLOPs: Scaling Laws for Optimal Sparsity for Mixture-of-Experts Language Models
  7. 2024Scaling Laws for Fine-Grained Mixture of Experts
  8. 2021Efficient Large Scale Language Modeling with Mixtures of Experts