MoNE: Replacing Redundant Experts with Lightweight Novices for Structured Pruning of MoE
On the map: Mixture-of-experts → MoE large language models
Abstract (arXiv)
Mixture-of-Experts (MoE) enables efficient scaling of large language models by activating only a subset of experts per input token. However, deploying MoE-based models incurs significant memory overhead due to the need to retain all experts in memory. While structured pruning is promising to reduce memory costs, existing methods often show suboptimal performance and unstable degradation in three dimensions: model architectures, calibration data sources, and calibration sample sizes. This paper proposes Mixture-of-Novices-and-Experts (MoNE), a novel expert pruning method that replaces redundant experts with lightweight novices to achieve effective and robust model compression. MoNE evaluates expert redundancy based on two metrics: access frequency and output variance. Experts exhibiting low usage and stable outputs are pruned and replaced with lightweight novices-unbiased estimations of their original outputs-minimizing performance degradation. Extensive experiments demonstrate that MoNE consistently outperforms baseline methods with minimal accuracy degradation across the three dimensions, confirming its effectiveness and robustness. Notably, it outperforms baselines by up to 2.72 for the average zero shot accuracy across nine downstream tasks under 25% pruning ratio, with only 0.14 performance drop for Qwen2-57B-A14B. The code is available at https://github.com/zxgx/mode-pd.
Key facts. Cited by 13 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 38 of its 47 references that are in the map. First posted on arXiv 1 Jul 2025.
Builds on
38 of 47 references.
Closest ancestors · 9
Same direction, newest first
- 2025Qwen3 Technical Report14 May
- 2024MoE-Pruner: Pruning Mixture-of-Experts Large Language Model using the Hints from Its Router15 Oct
- 2024Mixture Compressor for Mixture-of-Experts LLMs Gains More8 Oct
- 2024OLMoE: Open Mixture-of-Experts Language Models3 Sep
- 2024Revisiting SMoE Language Models by Evaluating Inefficiencies with Task Specific Expert Pruning2 Sep
- 2024DeepSeek-V2: A Strong, Economical, and Efficient Mixture-of-Experts Language Model7 May
- 2024Not All Experts are Equal: Efficient Expert Pruning and Skipping for Mixture-of-Experts Large Language Models22 Feb
- 2024Mixtral of Experts8 Jan
- 2020GShard: Scaling Giant Models with Conditional Computation and Automatic Sharding30 Jun
Other references · 29
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
- 2020Measuring Massive Multitask Language Understandingcited by 7,963
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
- 2023Let's Verify Step by Stepcited by 3,789
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
- 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
- 2019SuperGLUE: A Stickier Benchmark for General-Purpose Language Understanding Systemscited by 1,729
- 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
- 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 800
- 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 650
17 more
- 2024Taming Throughput-Latency Tradeoff in LLM Inference with Sarathi-Servecited by 526
- 2019Reducing Transformer Depth on Demand with Structured Dropoutcited by 439
- 2025Muon is Scalable for LLM Trainingcited by 428
- 2023Sheared LLaMA: Accelerating Language Model Pre-training via Structured Pruningcited by 415
- 2024The Unreasonable Ineffectiveness of the Deeper Layerscited by 226
- 2023TPU v4: An Optically Reconfigurable Supercomputer for Machine Learning with Hardware Support for Embeddingscited by 202
- 2025ZebraLogic: On the Scaling Limits of LLMs for Logical Reasoningcited by 201
- 2024Compact Language Models via Pruning and Knowledge Distillationcited by 148
- 2023Fluctuation-based Adaptive Structured Pruning for Large Language Modelscited by 111
- 2023Merge, Then Compress: Demystify Efficient SMoE with Hints from Its Routing Policycited by 108
- 2025SWE-bench Goes Live!cited by 80
- 2022Task-Specific Expert Pruning for Sparse Mixture-of-Expertscited by 72
- 2023FlashDecoding++: Faster Large Language Model Inference on GPUscited by 71
- 2024MARLIN: Mixed-Precision Auto-Regressive Parallel Inference on Large Language Modelscited by 52
- 2024SlimGPT: Layer-wise Structured Pruning for Large Language Modelscited by 44
- 2024SparseLLM: Towards Global Pruning for Pre-trained Language Modelscited by 23
- 2024Zyda-2: a 5 Trillion Token High-Quality Datasetcited by 13
Built on by
Citing papers per year: 2025: 1; 2026: 12.
13 papers.
Sort:
By area:
- 2026SkillDAG: Self-Evolving Typed Skill Graphs for LLM Skill Selection at Scalecited by 16
- 2025MoE Pathfinder: Trajectory-driven Expert Pruningcited by 7
- 2026Is Retraining-Free Enough? The Necessity of Router Calibration for Efficient MoE Compressioncited by 4
- 2026SegMoTE: Token-Level Mixture of Experts for Medical Image Segmentationcited by 2
- 2026MAPLE: MoE Adaptive Plug-and-play Layer-wise Expert allocationcited by 1
- 2026FlexMoE: One-for-All Nested Intra-Expert Pruning for MoE Language Modelscited by 0
- 2026Beyond Retraining-Free MoE Compression: A Cost-Normalized Study of Post-Compression Adjustmentcited by 0
- 2026What Breaks Under Pruning in Smart Homes, and When? Evaluating LLM Degradation Across Architectures and Task Complexitycited by 0
- 2026OMP-MoE: Efficient Expert Pruning for Mixture-of-Experts LLMs via Orthogonal Matching Pursuitcited by 0
- 2026DIET: Deletion-response Expert Trimming for Video Diffusion Transformerscited by 0
- 2026MoRA: MoE Pruning via Router Bias Learning and Expert Approximationcited by 0
- 2026ITC-MoE: Importance-guided Token-aware Compression for MoE Diffusion Language Modelscited by 0
1 more
- 2026SLEM: Spectrum-Aware Latent Expert Mergingcited by 0
- 2026SLEM: Spectrum-Aware Latent Expert Merging12 Oct 2026
- 2026ITC-MoE: Importance-guided Token-aware Compression for MoE Diffusion Language Models1 Oct 2026
- 2026MoRA: MoE Pruning via Router Bias Learning and Expert Approximation30 Sep 2026
- 2026DIET: Deletion-response Expert Trimming for Video Diffusion Transformers29 Sep 2026
- 2026What Breaks Under Pruning in Smart Homes, and When? Evaluating LLM Degradation Across Architectures and Task Complexity15 Sep 2026
- 2026OMP-MoE: Efficient Expert Pruning for Mixture-of-Experts LLMs via Orthogonal Matching Pursuit9 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
- 2026FlexMoE: One-for-All Nested Intra-Expert Pruning for MoE Language Models26 Jun 2026
- 2026SkillDAG: Self-Evolving Typed Skill Graphs for LLM Skill Selection at Scale2 Jun 2026
- 2026SegMoTE: Token-Level Mixture of Experts for Medical Image Segmentation22 Feb 2026
- 2026Is Retraining-Free Enough? The Necessity of Router Calibration for Efficient MoE Compression10 Feb 2026
1 more
- 2025MoE Pathfinder: Trajectory-driven Expert Pruning20 Dec 2025
- 2025MoE Pathfinder: Trajectory-driven Expert Pruningcited by 7
- 2026Is Retraining-Free Enough? The Necessity of Router Calibration for Efficient MoE Compressioncited by 4
- 2026SegMoTE: Token-Level Mixture of Experts for Medical Image Segmentationcited by 2
- 2026MAPLE: MoE Adaptive Plug-and-play Layer-wise Expert allocationcited by 1
- 2026FlexMoE: One-for-All Nested Intra-Expert Pruning for MoE Language Modelscited by 0
- 2026Beyond Retraining-Free MoE Compression: A Cost-Normalized Study of Post-Compression Adjustmentcited by 0
- 2026OMP-MoE: Efficient Expert Pruning for Mixture-of-Experts LLMs via Orthogonal Matching Pursuitcited by 0
- 2026MoRA: MoE Pruning via Router Bias Learning and Expert Approximationcited by 0
- 2026SLEM: Spectrum-Aware Latent Expert Mergingcited by 0
- 2026SLEM: Spectrum-Aware Latent Expert Merging12 Oct 2026
- 2026MoRA: MoE Pruning via Router Bias Learning and Expert Approximation30 Sep 2026
- 2026OMP-MoE: Efficient Expert Pruning for Mixture-of-Experts LLMs via Orthogonal Matching Pursuit9 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
- 2026FlexMoE: One-for-All Nested Intra-Expert Pruning for MoE Language Models26 Jun 2026
- 2026SegMoTE: Token-Level Mixture of Experts for Medical Image Segmentation22 Feb 2026
- 2026Is Retraining-Free Enough? The Necessity of Router Calibration for Efficient MoE Compression10 Feb 2026
- 2025MoE Pathfinder: Trajectory-driven Expert Pruning20 Dec 2025
Similar, not cited
Close in wording, no citation either way
- 2026Pruning and Distilling Mixture-of-Experts into Dense Language Models
- 2026Does a Global Perspective Help Prune Sparse MoEs Elegantly?
- 2024Diversifying the Expert Knowledge for Task-Agnostic Pruning in Sparse Mixture-of-Experts
- 2024Towards Efficient Mixture of Experts: A Holistic Study of Compression Techniques
- 2025Cluster-Driven Expert Pruning for Mixture-of-Experts Large Language Models
- 2026LightMoE: Reducing Mixture-of-Experts Redundancy through Expert Replacing
- 2026PRIME: Frequency-Aware Unified Pruning and Merging for MoE Compression
- 2025Efficiently Editing Mixture-of-Experts Models with Compressed Experts