SEAP: Training-free Sparse Expert Activation Pruning Unlock the Brainpower of Large Language Models
Not on the map. Why?
Abstract (arXiv)
Large Language Models have achieved remarkable success across various natural language processing tasks, yet their high computational cost during inference remains a major bottleneck. This paper introduces Sparse Expert Activation Pruning (SEAP), a training-free pruning method that selectively retains task-relevant parameters to reduce inference overhead. Inspired by the clustering patterns of hidden states and activations in LLMs, SEAP identifies task-specific expert activation patterns and prunes the model while preserving task performance and enhancing computational efficiency. Experimental results demonstrate that SEAP significantly reduces computational overhead while maintaining competitive accuracy. Notably, at 50% pruning, SEAP surpasses both WandA and FLAP by over 20%, and at 20% pruning, it incurs only a 2.2% performance drop compared to the dense model. These findings highlight SEAP's scalability and effectiveness, making it a promising approach for optimizing large-scale LLMs.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 28 of its 37 references that are in the map. First posted on arXiv 10 Mar 2025.
Builds on
28 of 37 references.
References · 28
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
- 2021Training Verifiers to Solve Math Word Problemscited by 10,109
- 2020Measuring Massive Multitask Language Understandingcited by 7,963
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
- 2023Mamba: Linear-Time Sequence Modeling with Selective State Spacescited by 4,718
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
- 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,509
- 2016Pointer Sentinel Mixture Modelscited by 3,096
- 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,073
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
- 2023A Survey of Large Language Modelscited by 2,576
- 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,183
16 more
- 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,164
- 2020GShard: Scaling Giant Models with Conditional Computation and Automatic Shardingcited by 1,631
- 2023AWQ: Activation-aware Weight Quantization for LLM Compression and Accelerationcited by 1,298
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
- 2023RWKV: Reinventing RNNs for the Transformer Eracited by 827
- 2019Are Sixteen Heads Really Better than One?cited by 816
- 2022ZeroQuant: Efficient and Affordable Post-Training Quantization for Large-Scale Transformerscited by 526
- 2021BASE Layers: Simplifying Training of Large, Sparse Modelscited by 320
- 2020BinaryBERT: Pushing the Limit of BERT Quantizationcited by 178
- 2021Primer: Searching for Efficient Transformers for Language Modelingcited by 164
- 2021MoEfication: Transformer Feed-forward Layers are Mixtures of Expertscited by 152
- 2024Everybody Prune Now: Structured Pruning of LLMs with only Forward Passescited by 43
- 2024Turbo Sparse: Achieving LLM SOTA Performance with Minimal Activated Parameterscited by 38
- 2024Q-Sparse: All Large Language Models can be Fully Sparsely-Activatedcited by 25
- 2024Greedy Output Approximation: Towards Efficient Structured Pruning for LLMs Without Retrainingcited by 8
- 2024Post-Training Statistical Calibration for Higher Activation Sparsitycited by 5
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.