Condense, Don't Just Prune: Enhancing Efficiency and Performance in MoE Layer Pruning
On the map: Mixture-of-experts → MoE large language models
Abstract (arXiv)
Mixture-of-Experts (MoE) has garnered significant attention for its ability to scale up neural networks while utilizing the same or even fewer active parameters. However, MoE does not alleviate the massive memory requirements of networks, which limits their practicality in real-world applications, especially in the era of large language models (LLMs). While recent work explores the possibility of removing entire layers of MoE to reduce memory, the performance degradation is still notable. In this paper, we propose ConDense-MoE (CD-MoE), which, instead of dropping the entire MoE layer, condenses the large, sparse MoE layer into a smaller, denser layer with only a few experts activated for all tokens, while maintaining hardware friendliness. Our approach is specifically designed for fine-grained MoE with shared experts, where Feed-Forward Networks are split into many small experts, with certain experts isolated to serve as shared experts that are always activated, such as DeepSeekMoE and QwenMoE. We demonstrate the effectiveness of our method. Specifically, for the DeepSeekMoE-16B model, our approach maintains 90% of the average accuracy while reducing memory usage by 27.5% and increasing inference speed by 1.26 times. Moreover, we show that by applying lightweight expert fine-tuning -- only to the condensed layers -- and using 5 hours on a single 80G A100 GPU, we can successfully recover 98% of the original performance. Our code is available at: https://github.com/duterscmy/CD-MoE/tree/main.
Key facts. Cited by 10 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 34 of its 44 references that are in the map. First posted on arXiv 26 Nov 2024.
Builds on
34 of 44 references.
Closest ancestors · 3
Same direction, newest first
- 2024Not All Experts are Equal: Efficient Expert Pruning and Skipping for Mixture-of-Experts Large Language Models22 Feb
- 2024DeepSeekMoE: Towards Ultimate Expert Specialization in Mixture-of-Experts Language Models11 Jan
- 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer23 Jan
Other references · 31
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 13,958
- 2021Training Verifiers to Solve Math Word Problemscited by 9,743
- 2021Evaluating Large Language Models Trained on Codecited by 8,053
- 2020Measuring Massive Multitask Language Understandingcited by 7,768
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
- 2020wav2vec 2.0: A Framework for Self-Supervised Learning of Speech Representationscited by 3,853
- 2022OPT: Open Pre-trained Transformer Language Modelscited by 3,464
- 2024Gemini 1.5: Unlocking multimodal understanding across millions of tokens of contextcited by 3,175
- 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,014
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
19 more
- 2020The Pile: An 800GB Dataset of Diverse Text for Language Modelingcited by 2,346
- 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,140
- 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,114
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
- 2021Train Short, Test Long: Attention with Linear Biases Enables Input Length Extrapolationcited by 1,085
- 2019What Does BERT Look At? An Analysis of BERT's Attentioncited by 994
- 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 776
- 2020Movement Pruning: Adaptive Sparsity by Fine-Tuningcited by 398
- 2018Implicit Self-Regularization in Deep Neural Networks: Evidence from Random Matrix Theory and Implications for Learningcited by 211
- 2024Emilia: An Extensive, Multilingual, and Diverse Speech Dataset for Large-Scale Speech Generationcited by 200
- 2023Outlier Weighed Layerwise Sparsity (OWL): A Missing Secret Sauce for Pruning LLMs to High Sparsitycited by 163
- 2022On the Representation Collapse of Sparse Mixture of Expertscited by 156
- 2019Traditional and Heavy-Tailed Self Regularization in Neural Network Modelscited by 104
- 2023Merge, Then Compress: Demystify Efficient SMoE with Hints from Its Routing Policycited by 104
- 2019Heavy-Tailed Universality Predicts Trends in Test Accuracies for Very Large Pre-Trained Deep Neural Networkscited by 43
- 2024SEER-MoE: Sparse Expert Efficiency through Regularization for Mixture-of-Expertscited by 40
- 2023Towards Efficient Fine-tuning of Pre-trained Code Models: An Experimental Study and Beyondcited by 20
- 2024Is C4 Dataset Optimal for Pruning? An Investigation of Calibration Data for LLM Pruningcited by 19
- 2023Heavy-Tailed Regularization of Weight Matrices in Deep Neural Networkscited by 7
Built on by
Citing papers per year: 2025: 3; 2026: 7.
10 papers.
- 2025Dropping Experts, Recombining Neurons: Retraining-Free Pruning for Sparse Mixture-of-Experts LLMscited by 25
- 2025Domain-Specific Pruning of Large Mixture-of-Experts Models with Few-shot Demonstrationscited by 16
- 2025MoE Pathfinder: Trajectory-driven Expert Pruningcited by 7
- 2026SlimQwen: Exploring the Pruning and Distillation in Large MoE Model Pre-trainingcited by 4
- 2026SHAPE: Coalition-Aware Expert Pruning for Sparse Mixture-of-Experts LLMscited by 3
- 2026TENP: Trapezoidal Expert Neuron Pruning For Mixture-of-Expertscited by 0
- 2026Attribution-Guided and Coverage-Maximized Pruning for Structural MoE Compressioncited 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
- 2026EStream: Fast and Memory-Efficient MoE Prefill through Expert Virtualization on Mobile NPUscited by 0
- 2026EStream: Fast and Memory-Efficient MoE Prefill through Expert Virtualization on Mobile NPUs6 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
- 2026Attribution-Guided and Coverage-Maximized Pruning for Structural MoE Compression16 Jun 2026
- 2026SHAPE: Coalition-Aware Expert Pruning for Sparse Mixture-of-Experts LLMs3 Jun 2026
- 2026TENP: Trapezoidal Expert Neuron Pruning For Mixture-of-Experts3 Jun 2026
- 2026SlimQwen: Exploring the Pruning and Distillation in Large MoE Model Pre-training9 May 2026
- 2025MoE Pathfinder: Trajectory-driven Expert Pruning20 Dec 2025
- 2025Dropping Experts, Recombining Neurons: Retraining-Free Pruning for Sparse Mixture-of-Experts LLMs12 Sep 2025
- 2025Domain-Specific Pruning of Large Mixture-of-Experts Models with Few-shot Demonstrations9 Apr 2025
Similar, not cited
Close in wording, no citation either way
- 2024MoE-Pruner: Pruning Mixture-of-Experts Large Language Model using the Hints from Its Router
- 2024Diversifying the Expert Knowledge for Task-Agnostic Pruning in Sparse Mixture-of-Experts
- 2026Does a Global Perspective Help Prune Sparse MoEs Elegantly?
- 2026Pruning and Distilling Mixture-of-Experts into Dense Language Models
- 2024A Provably Effective Method for Pruning Experts in Fine-tuned Sparse Mixture-of-Experts
- 2025Symphony-MoE: Harmonizing Disparate Pre-trained Models into a Coherent Mixture-of-Experts
- 2025Sigma-MoE-Tiny Technical Report
- 2025Cluster-Driven Expert Pruning for Mixture-of-Experts Large Language Models