Challenge: Existing compression approaches remove entire experts, disrupting routing topology and harming performance, or rely on unstructured weight pruning with limited practical efficiency.
Approach: They propose a structured **T**rapezoidal **E**xpert **N**euron **P**running framework that uses a trapezoidal pattern to identify and retain important experts while applying expert neuron pruning (ENP) to less important experts.
Outcome: The proposed framework outperforms the full-parameter model by 10% on code generation tasks under a sparse activation of experts and a 40% routing sparsity.

Similar Papers

Dropping Experts, Recombining Neurons: Retraining-Free Pruning for Sparse Mixture-of-Experts LLMs (2025.findings-emnlp)

Copied to clipboard

Challenge: Sparse Mixture-of-Experts (SMoE) architectures require loading all expert parameters . previous work focused on expert pruning and merging but focused on neuron-level structure .
Approach: They propose a task-agnostic framework for expert pruning and reconstruction . it prunes redundant experts using router statistics, then decomposes them into neuron-level expert segments .
Outcome: The proposed framework reduces the number of experts and memory usage, making it easier to deploy.
Not All Experts are Equal: Efficient Expert Pruning and Skipping for Mixture-of-Experts Large Language Models (2024.acl-long)

Copied to clipboard

Challenge: Mixture-of-Experts (MoE) LLMs achieve higher performance with fewer active parameters, but are still difficult to deploy due to their immense parameter sizes.
Approach: They propose expert-level sparsification techniques to enhance the deployment efficiency of large language models by introducing plug-and-play expert pruning and skipping techniques.
Outcome: The proposed methods reduce model sizes and increase inference speed while maintaining satisfactory performance across a wide range of tasks.
Diversifying the Expert Knowledge for Task-Agnostic Pruning in Sparse Mixture-of-Experts (2025.findings-acl)

Copied to clipboard

Challenge: Large Language Models (LLMs) have outstanding performance by learning a large number of model parameters on large amounts of data.
Approach: They propose a method of grouping and pruning similar experts to improve the model’s parameter efficiency by a range of natural language tasks.
Outcome: The proposed method outperforms other model pruning methods on a range of natural language tasks.
Pruning General Large Language Models into Customized Expert Models (2025.findings-acl)

Copied to clipboard

Challenge: Large language models (LLMs) require significant computational resources to maintain their general capabilities.
Approach: They propose a Custom Pruning method to prune a large general model into a smaller lightweight expert model, positioned along the "language", "domain" and "task" dimensions.
Outcome: The proposed method outperforms existing pruning methods and achieves minimal loss in both expert and general capabilities across models from different model families and sizes.
BlockPruner: Fine-grained Pruning for Large Language Models (2025.findings-acl)

Copied to clipboard

Challenge: Large language models (LLMs) have significant computational and memory costs associated with training and inference.
Approach: They propose a training-free structured pruning approach that targets redundancies in MHA and MLP blocks.
Outcome: The proposed pruning approach achieves more granular and effective pruning compared to state-of-the-art pruning methods.
A Closer Look into Mixture-of-Experts in Large Language Models (2025.findings-naacl)

Copied to clipboard

Challenge: Mixture-of-experts (MoE) architectures are gaining increasing attention for their unique properties and remarkable performance.
Approach: They propose a mixture-of-experts architecture that allows for model scaling without sacrificing computational efficiency.
Outcome: The proposed model increases model size without sacrificing computational efficiency . the proposed model is modular and can be used by a broad spectrum of practitioners .
DSMoE: Matrix-Partitioned Experts with Dynamic Routing for Computation-Efficient Dense LLMs (2025.emnlp-main)

Copied to clipboard

Challenge: Existing sparsification methods like pruning can lose model knowledge through parameter removal.
Approach: They propose a novel approach that achieves sparsification by partitioning pre-trained FFN layers into computational blocks.
Outcome: The proposed approach achieves superior performance across language modeling and downstream tasks under equivalent computational constraints.
Approximating Two-Layer Feedforward Networks for Efficient Transformers (2023.findings-emnlp)

Copied to clipboard

Challenge: Recent work uses sparse Mixtures of Experts (MoEs) to build resource-efficient large language models.
Approach: They propose a general framework that unifies various methods to build two-layer NNs . they propose methods to improve both MoEs and PKMs based on their results .
Outcome: The proposed framework improves both MoEs and product-key memories (PKMs) it shows that MoE's are competitive with dense Transformer-XL on two different scales while being much more resource efficient.
FlexiGPT: Pruning and Extending Large Language Models with Low-Rank Weight Sharing (2025.naacl-long)

Copied to clipboard

Challenge: Empirical evaluations demonstrate substantial performance gains over existing methods .
Approach: They propose a method to prune LLMs that selectively prunes model blocks based on an importance score and replaces them with a low-parameter replacement strategy.
Outcome: The proposed method achieves state-of-the-art performance on 5/6 and 6/6 benchmarks with a compression rate of 30% and 40%.
STUN: Structured-Then-Unstructured Pruning for Scalable MoE Pruning (2025.acl-long)

Copied to clipboard

Challenge: Mixture-of-experts (MoEs) have been adopted for reducing inference costs by sparsely activating experts in large language models (LLMs).
Approach: They propose a structured-then-unstructured approach outperforming both of structured and unstructured pruning for MoEs.
Outcome: The proposed approach outperforms both of structured and unstructured pruning, especially for MoEs with hundreds of experts.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations