How to Score Experts for One-Shot MoE Expert Pruning: A Unified Formulation and Selection Principle
On the map: Mixture-of-experts → MoE large language models
Abstract (arXiv)
Mixture-of-Experts (MoE) language models reduce per-token computation through sparse expert activation, yet deployment still requires storing the full expert pool, making one-shot expert pruning a practical approach for reducing memory usage. Although effective, existing criteria are largely heuristic, and no single criterion is universally optimal. Thus, establishing a principle for selecting pruning criteria suited to different deployment objectives remains an important yet largely underexplored problem in one-shot expert pruning. To this end, we introduce a unified formulation for one-shot MoE expert pruning organized around three factors: routing frequency, gate weighting, and activation strength. The formulation yields a criteria selection principle: task-agnostic pruning should favor routed-token-averaged, gate-free activation-based criteria, whereas task-specific pruning can benefit from retaining routing-frequency and gate-weight information. Beyond this principle, the formulation also provides a systematic view of existing heuristic criteria and gives rise to two new task-agnostic criteria, Mean Activation Norm (MAN) and Mean Squared Activation Norm (MSAN). Across four representative MoE models and 16 diverse benchmarks, MAN and MSAN are consistently strong in the task-agnostic setting, obtain the top-two average ranks, and improve average performance by up to 8.8 points over the strongest baseline.
Key facts. Cited by 6 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 43 of its 53 references that are in the map. First posted on arXiv 14 Jun 2026.
Builds on
43 of 53 references.
Closest ancestors · 20
Same direction, newest first
- 2026REAM: Merging Improves Pruning of Experts in LLMs6 Apr
- 2026AIMER: Calibration-Free Task-Agnostic MoE Expert Pruning19 Mar
- 2026EvoESAP: Non-Uniform Expert Pruning for Sparse MoE6 Mar
- 2025REAP the Experts: Why Pruning Prevails for One-Shot MoE compression15 Oct
- 2025DiEP: Adaptive Mixture-of-Experts Compression through Differentiable Expert Pruning19 Sep
- 2025Dropping Experts, Recombining Neurons: Retraining-Free Pruning for Sparse Mixture-of-Experts LLMs12 Sep
- 2025Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging29 Jun
- 2025Efficiently Editing Mixture-of-Experts Models with Compressed Experts1 Mar
- 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
8 more
- 2024STUN: Structured-Then-Unstructured Pruning for Scalable MoE Pruning10 Sep
- 2024OLMoE: Open Mixture-of-Experts Language Models3 Sep
- 2024Diversifying the Expert Knowledge for Task-Agnostic Pruning in Sparse Mixture-of-Experts12 Jul
- 2024Efficient Expert Pruning for Sparse Mixture-of-Experts Language Models: Enhancing Performance and Reducing Inference Costs1 Jul
- 2024Towards Efficient Mixture of Experts: A Holistic Study of Compression Techniques4 Jun
- 2024DeepSeek-V2: A Strong, Economical, and Efficient Mixture-of-Experts Language Model7 May
- 2023Merging Experts into One: Improving Computational Efficiency of Mixture of Experts15 Oct
- 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer23 Jan
Other references · 23
- 2020Measuring Massive Multitask Language Understandingcited by 7,963
- 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,371
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
- 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,073
- 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,183
- 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,164
- 2024LiveCodeBench: Holistic and Contamination Free Evaluation of Large Language Models for Codecited by 2,004
- 2023Is Your Code Generated by ChatGPT Really Correct? Rigorous Evaluation of Large Language Models for Code Generationcited by 1,391
- 2025gpt-oss-120b & gpt-oss-20b Model Cardcited by 1,386
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
- 2023WizardCoder: Empowering Code Large Language Models with Evol-Instructcited by 733
11 more
- 2026GLM-5: from Vibe Coding to Agentic Engineeringcited by 587
- 2023Sheared LLaMA: Accelerating Language Model Pre-training via Structured Pruningcited by 415
- 2024WildBench: Benchmarking LLMs with Challenging Tasks from Real Users in the Wildcited by 218
- 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
- 2024A Survey on Inference Optimization Techniques for Mixture of Experts Modelscited by 47
- 2024SEER-MoE: Sparse Expert Efficiency through Regularization for Mixture-of-Expertscited by 40
- 2022Memory-efficient NLLB-200: Language-specific Expert Pruning of a Massively Multilingual Machine Translation Modelcited by 36
- 2025Finding Fantastic Experts in MoEs: A Unified Study for Expert Dropping Strategies and Observationscited by 20
- 2025Domain-Specific Pruning of Large Mixture-of-Experts Models with Few-shot Demonstrationscited by 16
- 2026HodgeCover: Higher-Order Topological Coverage Drives Compression of Sparse Mixture-of-Expertscited by 1
Built on by
Citing papers per year: 2026: 6.
6 papers.
- 2026Half the Experts, All the Code: One-Shot Domain Pruning of Mixture-of-Experts LLMs for Codingcited by 3
- 2026Higher-order pruning of experts in mixture-of-experts language modelscited by 1
- 2026When Compression Scores Cannot Decide: Information Boundaries for Group-Robust LLM Pruningcited by 0
- 2026MoEMB: Scaling Universal Multimodal Embeddings with Efficient Mixture-of-Experts Modelscited by 0
- 2026RAZOR: Pruning Replaceable Experts in LLMscited by 0
- 2026DIET: Deletion-response Expert Trimming for Video Diffusion Transformerscited by 0
- 2026DIET: Deletion-response Expert Trimming for Video Diffusion Transformers29 Sep 2026
- 2026RAZOR: Pruning Replaceable Experts in LLMs24 Sep 2026
- 2026Higher-order pruning of experts in mixture-of-experts language models16 Sep 2026
- 2026MoEMB: Scaling Universal Multimodal Embeddings with Efficient Mixture-of-Experts Models8 Sep 2026
- 2026When Compression Scores Cannot Decide: Information Boundaries for Group-Robust LLM Pruning3 Aug 2026
- 2026Half the Experts, All the Code: One-Shot Domain Pruning of Mixture-of-Experts LLMs for Coding18 Jul 2026
Similar, not cited
Close in wording, no citation either way
- 2025MoE Pathfinder: Trajectory-driven Expert Pruning
- 2026It Takes a MAESTRO To Prune Bad Experts
- 2026MoRA: MoE Pruning via Router Bias Learning and Expert Approximation
- 2026Slicing and Dicing: Configuring Optimal Mixtures of Experts
- 2026When Load-Balancing Goes Too Far: Expert Pruning in Over-Dispersed Mixture-of-Experts Models
- 2026You Only Need 2/3 of the Chosen Experts: An Empirical Study of Dynamic Expert Pruning in Fine-Grained MoE LLMs
- 2026PCoMoE: Shifting MoE Inference from Monolithic Expert Selection to Fine-Grained Path Composition
- 2025Cluster-Driven Expert Pruning for Mixture-of-Experts Large Language Models