Less is MoE: Trimming Experts in Domain-Specialist Language Models
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
- 2025Delta Decompression for MoE-based LLMs Compression24 Feb
- 2024MoE-I2: Compressing Mixture of Experts Models through Inter-Expert Pruning and Intra-Expert Low-Rank Decomposition1 Nov
- 2024MoE-Pruner: Pruning Mixture-of-Experts Large Language Model using the Hints from Its Router15 Oct
- 2024Retraining-Free Merging of Sparse MoE via Hierarchical Clustering11 Oct
- 2024STUN: Structured-Then-Unstructured Pruning for Scalable MoE Pruning10 Sep
- 2024Towards Efficient Mixture of Experts: A Holistic Study of Compression Techniques4 Jun
- 2020GShard: Scaling Giant Models with Conditional Computation and Automatic Sharding30 Jun
- 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer23 Jan
Other references · 23
- 2021Training Verifiers to Solve Math Word Problemscited by 10,109
- 2021Evaluating Large Language Models Trained on Codecited by 8,320
- 2020Measuring Massive Multitask Language Understandingcited by 7,963
- 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,944
- 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,371
- 2021Program Synthesis with Large Language Modelscited by 3,637
- 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,073
- 2023GPQA: A Graduate-Level Google-Proof Q&A Benchmarkcited by 2,879
- 2022Locating and Editing Factual Associations in GPTcited by 2,691
- 2023Efficient Streaming Language Models with Attention Sinkscited by 2,186
- 2020Transformer Feed-Forward Layers Are Key-Value Memoriescited by 1,336
- 2023AWQ: Activation-aware Weight Quantization for LLM Compression and Accelerationcited by 1,298
11 more
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
- 2019Analyzing Multi-Head Self-Attention: Specialized Heads Do the Heavy Lifting, the Rest Can Be Prunedcited by 856
- 2019Are Sixteen Heads Really Better than One?cited by 816
- 2023CMMLU: Measuring massive multitask language understanding in Chinesecited by 449
- 2016Solving General Arithmetic Word Problemscited by 360
- 2021ZeRO-Offload: Democratizing Billion-Scale Model Trainingcited by 341
- 2019Limitations of the Empirical Fisher Approximation for Natural Gradient Descentcited by 217
- 2023Merge, Then Compress: Demystify Efficient SMoE with Hints from Its Routing Policycited by 108
- 2022Task-Specific Expert Pruning for Sparse Mixture-of-Expertscited by 72
- 2024SEER-MoE: Sparse Expert Efficiency through Regularization for Mixture-of-Expertscited by 40
- 2026Preserving Long-Tailed Expert Information in Mixture-of-Experts Tuningcited by 1
Built on by
Citing papers per year: 2026: 2.
2 papers.
Similar, not cited
Close in wording, no citation either way
- 2025Efficiently Editing Mixture-of-Experts Models with Compressed Experts
- 2026Pruning and Distilling Mixture-of-Experts into Dense Language Models
- 2026Towards Principled Design of Mixture-of-Experts Language Models under Memory and Inference Constraints
- 2025Cluster-Driven Expert Pruning for Mixture-of-Experts Large Language Models
- 2026PRIME: Frequency-Aware Unified Pruning and Merging for MoE Compression
- 2025Parameters vs FLOPs: Scaling Laws for Optimal Sparsity for Mixture-of-Experts Language Models
- 2024Scaling Laws for Fine-Grained Mixture of Experts
- 2021Efficient Large Scale Language Modeling with Mixtures of Experts