Efficient Expert Pruning for Sparse Mixture-of-Experts Language Models: Enhancing Performance and Reducing Inference Costs
On the map: Mixture-of-experts → MoE large language models
Abstract (arXiv)
The rapid advancement of large language models (LLMs) has led to architectures with billions to trillions of parameters, posing significant deployment challenges due to their substantial demands on memory, processing power, and energy consumption. Sparse Mixture-of-Experts (SMoE) architectures have emerged as a solution, activating only a subset of parameters per token, thereby achieving faster inference while maintaining performance. However, SMoE models still face limitations in broader deployment due to their large parameter counts and significant GPU memory requirements. In this work, we introduce a gradient-free evolutionary strategy named EEP (Efficient Expert Pruning) to enhance the pruning of experts in SMoE models. EEP relies solely on model inference (i.e., no gradient computation) and achieves greater sparsity while maintaining or even improving performance on downstream tasks. EEP can be used to reduce both the total number of experts (thus saving GPU memory) and the number of active experts (thus accelerating inference). For example, we demonstrate that pruning up to 75% of experts in Mixtral 8×7B-Instruct results in a substantial reduction in parameters with minimal performance loss. Remarkably, we observe improved performance on certain tasks, such as a significant increase in accuracy on the SQuAD dataset (from 53.4% to 75.4%), when pruning half of the experts. With these results, EEP not only lowers the barrier to deploying SMoE models,but also challenges the conventional understanding of model pruning by showing that fewer experts can lead to better task-specific performance without any fine-tuning. Code is available at https://github.com/imagination-research/EEP.
Key facts. Cited by 51 papers in the map (data through 7 Oct 2026). Placed in MoE large language models, one of 12 directions in Mixture-of-experts. Builds on 55 of its 63 references that are in the map. First posted on arXiv 1 Jul 2024.
Builds on
55 of 63 references.
Closest ancestors · 5
Same direction, newest first
- 2024Not All Experts are Equal: Efficient Expert Pruning and Skipping for Mixture-of-Experts Large Language Models22 Feb
- 2024Mixtral of Experts8 Jan
- 2022Sparse Upcycling: Training Mixture-of-Experts from Dense Checkpoints9 Dec
- 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 · 50
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 12,865
- 2020Measuring Massive Multitask Language Understandingcited by 7,768
- 2020Scaling Laws for Neural Language Modelscited by 6,411
- 2022Flamingo: a Visual Language Model for Few-Shot Learningcited by 4,337
- 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,115
- 2020Longformer: The Long-Document Transformercited by 3,362
- 2023Qwen Technical Reportcited by 3,273
- 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,014
- 2023Efficient Streaming Language Models with Attention Sinkscited by 2,115
- 2022Learn to Explain: Multimodal Reasoning via Thought Chains for Science Question Answeringcited by 1,881
- 2020GLU Variants Improve Transformercited by 1,724
38 more
- 2019Generating Long Sequences with Sparse Transformerscited by 1,523
- 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,366
- 2023HuggingGPT: Solving AI Tasks with ChatGPT and its Friends in Hugging Facecited by 1,173
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
- 2019DROP: A Reading Comprehension Benchmark Requiring Discrete Reasoning Over Paragraphscited by 883
- 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 776
- 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 643
- 2022Mixture-of-Experts with Expert Choice Routingcited by 611
- 2020What is the State of Neural Network Pruning?cited by 578
- 2017Evolution Strategies as a Scalable Alternative to Reinforcement Learningcited by 555
- 2022Socratic Models: Composing Zero-Shot Multimodal Reasoning with Languagecited by 513
- 2019Be Your Own Teacher: Improve the Performance of Convolutional Neural Networks via Self Distillationcited by 491
- 2018AMC: AutoML for Model Compression and Acceleration on Mobile Devicescited by 375
- 2023Language Models can Solve Computer Taskscited by 371
- 2023Fine-Tuning Language Models with Just Forward Passescited by 337
- 2021BASE Layers: Simplifying Training of Large, Sparse Modelscited by 315
- 2018Model compression via distillation and quantizationcited by 287
- 2020DynaBERT: Dynamic BERT with Adaptive Width and Depthcited by 246
- 2024Evolutionary Optimization of Model Merging Recipescited by 204
- 2022Tutel: Adaptive Mixture-of-Experts at Scalecited by 199
- 2024A Survey on Efficient Inference for Large Language Modelscited by 197
- 2023Efficient Large Language Models: A Surveycited by 183
- 2022Structured Pruning Learns Compact and Accurate Modelscited by 167
- 2022A Fast Post-Training Pruning Framework for Transformerscited by 161
- 2022On the Representation Collapse of Sparse Mixture of Expertscited by 156
- 2021MoEfication: Transformer Feed-forward Layers are Mixtures of Expertscited by 149
- 2018NetAdapt: Platform-Aware Neural Network Adaptation for Mobile Applicationscited by 146
- 2020On the Effect of Dropping Layers of Pre-trained Transformer Modelscited by 118
- 2019EigenDamage: Structured Pruning in the Kronecker-Factored Eigenbasiscited by 98
- 2022StableMoE: Stable Routing Strategy for Mixture of Expertscited by 98
- 2022Task-Specific Expert Pruning for Sparse Mixture-of-Expertscited by 69
- 2020DSA: More Efficient Budgeted Pruning via Differentiable Sparsity Allocationcited by 47
- 2023OMS-DPM: Optimizing the Model Schedule for Diffusion Probabilistic Modelscited by 44
- 2021MLGO: a Machine Learning Guided Compiler Optimizations Frameworkcited by 40
- 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
- 2023A Unified Sampling Framework for Solver Searching of Diffusion Probabilistic Modelscited by 14
- 2024Linear Combination of Saved Checkpoints Makes Consistency and Diffusion Models Bettercited by 6
Built on by
Citing papers per year: 2024: 6; 2025: 17; 2026: 28.
51 papers.
Sort:
By area:
- 2024ReMoE: Fully Differentiable Mixture-of-Experts with ReLU Routingcited by 53
- 2024A Survey on Inference Optimization Techniques for Mixture of Experts Modelscited by 46
- 2025REAP the Experts: Why Pruning Prevails for One-Shot MoE compressioncited by 40
- 2024Mixture Compressor for Mixture-of-Experts LLMs Gains Morecited by 38
- 2025Delta Decompression for MoE-based LLMs Compressioncited by 32
- 2024STUN: Structured-Then-Unstructured Pruning for Scalable MoE Pruningcited by 30
- 2025Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Mergingcited by 26
- 2025Dropping Experts, Recombining Neurons: Retraining-Free Pruning for Sparse Mixture-of-Experts LLMscited by 25
- 2025DiEP: Adaptive Mixture-of-Experts Compression through Differentiable Expert Pruningcited by 24
- 2025EAC-MoE: Expert-Selection Aware Compressor for Mixture-of-Experts Large Language Modelscited by 18
- 2024Lynx: Enabling Efficient MoE Inference through Dynamic Batch-Aware Expert Selectioncited by 16
- 2025Unveiling Super Experts in Mixture-of-Experts Large Language Modelscited by 15
38 more
- 2025DeRS: Towards Extremely Efficient Upcycled Mixture-of-Experts Modelscited by 10
- 2025MoBE: Mixture-of-Basis-Experts for Compressing MoE-based LLMscited by 9
- 2026XShare: Collaborative in-Batch Expert Sharing for Faster MoE Inferencecited by 7
- 2026EvoESAP: Non-Uniform Expert Pruning for Sparse MoEcited by 7
- 2025Opportunistic Expert Activation: Batch-Aware Expert Routing for Faster Decode Without Retrainingcited by 6
- 2026Effective MoE-based LLM Compression by Exploiting Heterogeneous Inter-Group Experts Routing Frequency and Information Densitycited by 6
- 2026How to Score Experts for One-Shot MoE Expert Pruning: A Unified Formulation and Selection Principlecited by 6
- 2025CAMERA: Multi-Matrix Joint Compression for MoE Models via Micro-Expert Redundancy Analysiscited by 5
- 2025LExI: Layer-Adaptive Active Experts for Efficient MoE Model Inferencecited by 5
- 2026AIMER: Calibration-Free Task-Agnostic MoE Expert Pruningcited by 5
- 2024MoC-System: Efficient Fault Tolerance for Sparse Mixture-of-Experts Model Trainingcited by 4
- 2026Is Retraining-Free Enough? The Necessity of Router Calibration for Efficient MoE Compressioncited by 4
- 2026Post-Trained MoE Can Skip Half Experts via Self-Distillationcited by 4
- 2025HEAPr: Hessian-based Efficient Atomic Expert Pruning in Output Spacecited by 3
- 2026SERE: Similarity-based Expert Re-routing for Efficient Batch Decoding in MoE Modelscited by 3
- 2025FLEx: Personalized Federated Learning for Mixture-of-Experts LLMs via Expert Graftingcited by 2
- 2026Self-evolving Embodied AIcited by 2
- 2026LightMoE: Reducing Mixture-of-Experts Redundancy through Expert Replacingcited by 2
- 2026Does a Global Perspective Help Prune Sparse MoEs Elegantly?cited by 2
- 2026Temporally Extended Mixture-of-Experts Modelscited by 2
- 2026dMoE: dLLMs with Learnable Block Expertscited by 2
- 2025PreMoE: Proactive Inference for Efficient Mixture-of-Expertscited by 1
- 2025MC#: Mixture Compressor for Mixture-of-Experts Large Modelscited by 1
- 2026HodgeCover: Higher-Order Topological Coverage Drives Compression of Sparse Mixture-of-Expertscited by 1
- 2026BEAM: Binary Expert Activation Masking for Dynamic Routing in MoEcited by 1
- 2025Guided Model Merging for Hybrid Data Learning: Leveraging Centralized Data to Refine Decentralized Modelscited by 0
- 2026Yuan3.0 Ultra: A Trillion-Parameter Enterprise-Oriented MoE LLMcited by 0
- 2026BitsMoE: Efficient Spectral Energy-Guided Bit Allocation for MoE LLM Quantizationcited by 0
- 2026TENP: Trapezoidal Expert Neuron Pruning For Mixture-of-Expertscited by 0
- 2026Attribution-Guided and Coverage-Maximized Pruning for Structural MoE Compressioncited by 0
- 2026Director: Accelerating Distributed MoE Serving via Online Proactive Expert Placementcited by 0
- 2026When Compression Scores Cannot Decide: Information Boundaries for Group-Robust LLM Pruningcited by 0
- 2026EdgeXpert: An Edge Device for Memory-Efficient LLM Inference with Mixture-of-Experts and Speculative Decodingcited by 0
- 2026Router Sensitivity Under Lightweight Fine-Tuning Identifies Prunable Experts in Mixture-of-Experts Modelscited by 0
- 2026MoE Proxy Models for Low-Cost Failure Reproduction and Diagnosis in LLM RL Post-Trainingcited by 0
- 2026MAPLE: MoE Adaptive Plug-and-play Layer-wise Expert allocationcited by 0
- 2026Beyond Retraining-Free MoE Compression: A Cost-Normalized Study of Post-Compression Adjustmentcited by 0
- 2026RAZOR: Pruning Replaceable Experts in LLMscited by 0
50 most cited of 51 All 51 (JSON)
- 2026BASE: Batch-Aware Selection of Experts Using Predicted Removal Error for Efficient MoE Decoding28 Sep 2026
- 2026RAZOR: Pruning Replaceable Experts in LLMs24 Sep 2026
- 2026Beyond Retraining-Free MoE Compression: A Cost-Normalized Study of Post-Compression Adjustment5 Sep 2026
- 2026MAPLE: MoE Adaptive Plug-and-play Layer-wise Expert allocation15 Aug 2026
- 2026MoE Proxy Models for Low-Cost Failure Reproduction and Diagnosis in LLM RL Post-Training11 Aug 2026
- 2026Router Sensitivity Under Lightweight Fine-Tuning Identifies Prunable Experts in Mixture-of-Experts Models8 Aug 2026
- 2026EdgeXpert: An Edge Device for Memory-Efficient LLM Inference with Mixture-of-Experts and Speculative Decoding5 Aug 2026
- 2026When Compression Scores Cannot Decide: Information Boundaries for Group-Robust LLM Pruning3 Aug 2026
- 2026Attribution-Guided and Coverage-Maximized Pruning for Structural MoE Compression16 Jun 2026
- 2026How to Score Experts for One-Shot MoE Expert Pruning: A Unified Formulation and Selection Principle14 Jun 2026
- 2026Director: Accelerating Distributed MoE Serving via Online Proactive Expert Placement13 Jun 2026
- 2026TENP: Trapezoidal Expert Neuron Pruning For Mixture-of-Experts3 Jun 2026
38 more
- 2026dMoE: dLLMs with Learnable Block Experts29 May 2026
- 2026BitsMoE: Efficient Spectral Energy-Guided Bit Allocation for MoE LLM Quantization22 May 2026
- 2026Post-Trained MoE Can Skip Half Experts via Self-Distillation18 May 2026
- 2026BEAM: Binary Expert Activation Masking for Dynamic Routing in MoE14 May 2026
- 2026HodgeCover: Higher-Order Topological Coverage Drives Compression of Sparse Mixture-of-Experts13 May 2026
- 2026Temporally Extended Mixture-of-Experts Models22 Apr 2026
- 2026Does a Global Perspective Help Prune Sparse MoEs Elegantly?8 Apr 2026
- 2026AIMER: Calibration-Free Task-Agnostic MoE Expert Pruning19 Mar 2026
- 2026LightMoE: Reducing Mixture-of-Experts Redundancy through Expert Replacing13 Mar 2026
- 2026EvoESAP: Non-Uniform Expert Pruning for Sparse MoE6 Mar 2026
- 2026Is Retraining-Free Enough? The Necessity of Router Calibration for Efficient MoE Compression10 Feb 2026
- 2026Effective MoE-based LLM Compression by Exploiting Heterogeneous Inter-Group Experts Routing Frequency and Information Density10 Feb 2026
- 2026SERE: Similarity-based Expert Re-routing for Efficient Batch Decoding in MoE Models7 Feb 2026
- 2026XShare: Collaborative in-Batch Expert Sharing for Faster MoE Inference6 Feb 2026
- 2026Self-evolving Embodied AI4 Feb 2026
- 2026Yuan3.0 Ultra: A Trillion-Parameter Enterprise-Oriented MoE LLM20 Jan 2026
- 2025Opportunistic Expert Activation: Batch-Aware Expert Routing for Faster Decode Without Retraining4 Nov 2025
- 2025REAP the Experts: Why Pruning Prevails for One-Shot MoE compression15 Oct 2025
- 2025MC#: Mixture Compressor for Mixture-of-Experts Large Models13 Oct 2025
- 2025HEAPr: Hessian-based Efficient Atomic Expert Pruning in Output Space26 Sep 2025
- 2025DiEP: Adaptive Mixture-of-Experts Compression through Differentiable Expert Pruning19 Sep 2025
- 2025Dropping Experts, Recombining Neurons: Retraining-Free Pruning for Sparse Mixture-of-Experts LLMs12 Sep 2025
- 2025LExI: Layer-Adaptive Active Experts for Efficient MoE Model Inference2 Sep 2025
- 2025MoBE: Mixture-of-Basis-Experts for Compressing MoE-based LLMs7 Aug 2025
- 2025CAMERA: Multi-Matrix Joint Compression for MoE Models via Micro-Expert Redundancy Analysis4 Aug 2025
- 2025EAC-MoE: Expert-Selection Aware Compressor for Mixture-of-Experts Large Language Models3 Aug 2025
- 2025Unveiling Super Experts in Mixture-of-Experts Large Language Models31 Jul 2025
- 2025Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging29 Jun 2025
- 2025FLEx: Personalized Federated Learning for Mixture-of-Experts LLMs via Expert Grafting1 Jun 2025
- 2025PreMoE: Proactive Inference for Efficient Mixture-of-Experts23 May 2025
- 2025Guided Model Merging for Hybrid Data Learning: Leveraging Centralized Data to Refine Decentralized Models26 Mar 2025
- 2025DeRS: Towards Extremely Efficient Upcycled Mixture-of-Experts Models3 Mar 2025
- 2025Delta Decompression for MoE-based LLMs Compression24 Feb 2025
- 2024ReMoE: Fully Differentiable Mixture-of-Experts with ReLU Routing19 Dec 2024
- 2024A Survey on Inference Optimization Techniques for Mixture of Experts Models18 Dec 2024
- 2024Lynx: Enabling Efficient MoE Inference through Dynamic Batch-Aware Expert Selection13 Nov 2024
- 2024Mixture Compressor for Mixture-of-Experts LLMs Gains More8 Oct 2024
- 2024STUN: Structured-Then-Unstructured Pruning for Scalable MoE Pruning10 Sep 2024
50 newest of 51 All 51 (JSON)
- 2024ReMoE: Fully Differentiable Mixture-of-Experts with ReLU Routingcited by 53
- 2024A Survey on Inference Optimization Techniques for Mixture of Experts Modelscited by 46
- 2025REAP the Experts: Why Pruning Prevails for One-Shot MoE compressioncited by 40
- 2024Mixture Compressor for Mixture-of-Experts LLMs Gains Morecited by 38
- 2025Delta Decompression for MoE-based LLMs Compressioncited by 32
- 2024STUN: Structured-Then-Unstructured Pruning for Scalable MoE Pruningcited by 30
- 2025Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Mergingcited by 26
- 2025Dropping Experts, Recombining Neurons: Retraining-Free Pruning for Sparse Mixture-of-Experts LLMscited by 25
- 2025DiEP: Adaptive Mixture-of-Experts Compression through Differentiable Expert Pruningcited by 24
- 2025EAC-MoE: Expert-Selection Aware Compressor for Mixture-of-Experts Large Language Modelscited by 18
- 2024Lynx: Enabling Efficient MoE Inference through Dynamic Batch-Aware Expert Selectioncited by 16
- 2025Unveiling Super Experts in Mixture-of-Experts Large Language Modelscited by 15
12 most cited of 47 All 47 (JSON)
- 2026BASE: Batch-Aware Selection of Experts Using Predicted Removal Error for Efficient MoE Decoding28 Sep 2026
- 2026RAZOR: Pruning Replaceable Experts in LLMs24 Sep 2026
- 2026Beyond Retraining-Free MoE Compression: A Cost-Normalized Study of Post-Compression Adjustment5 Sep 2026
- 2026MAPLE: MoE Adaptive Plug-and-play Layer-wise Expert allocation15 Aug 2026
- 2026MoE Proxy Models for Low-Cost Failure Reproduction and Diagnosis in LLM RL Post-Training11 Aug 2026
- 2026Router Sensitivity Under Lightweight Fine-Tuning Identifies Prunable Experts in Mixture-of-Experts Models8 Aug 2026
- 2026EdgeXpert: An Edge Device for Memory-Efficient LLM Inference with Mixture-of-Experts and Speculative Decoding5 Aug 2026
- 2026Attribution-Guided and Coverage-Maximized Pruning for Structural MoE Compression16 Jun 2026
- 2026How to Score Experts for One-Shot MoE Expert Pruning: A Unified Formulation and Selection Principle14 Jun 2026
- 2026Director: Accelerating Distributed MoE Serving via Online Proactive Expert Placement13 Jun 2026
- 2026TENP: Trapezoidal Expert Neuron Pruning For Mixture-of-Experts3 Jun 2026
- 2026dMoE: dLLMs with Learnable Block Experts29 May 2026
12 newest of 47 All 47 (JSON)
- 2025MC#: Mixture Compressor for Mixture-of-Experts Large Models13 Oct 2025
Similar, not cited
Close in wording, no citation either way
- 2025Mosaic Pruning: A Hierarchical Framework for Generalizable Pruning of Mixture-of-Experts Models
- 2024Revisiting SMoE Language Models by Evaluating Inefficiencies with Task Specific Expert Pruning
- 2024Towards Efficient Mixture of Experts: A Holistic Study of Compression Techniques
- 2024Diversifying the Expert Knowledge for Task-Agnostic Pruning in Sparse Mixture-of-Experts
- 2024Dense Training, Sparse Inference: Rethinking Training of Mixture-of-Experts Language Models
- 2025ToMoE: Converting Dense Large Language Models to Mixture-of-Experts through Dynamic Structural Pruning
- 2026It Takes a MAESTRO To Prune Bad Experts
- 2024Mixture of Diverse Size Experts