Towards Efficient Automatic Self-Pruning of Large Language Models
Not on the map. Why?
Abstract (arXiv)
Despite exceptional capabilities, Large Language Models (LLMs) still face deployment challenges due to their enormous size. Post-training structured pruning is a promising solution that prunes LLMs without the need for retraining, reducing computational overhead, and it is hardware-deployment friendly. However, the training-free nature of post-training structured pruning leads to significant performance degradation. We argue that the key to mitigating this issue lies in accurately determining the pruning rate for each layer. Meanwhile, we find that LLMs may have prior knowledge about their own redundancy. Based on this insight, we introduce Self-Pruner an end-to-end automatic self-pruning framework for LLMs, which efficiently search layer-wise pruning rates. Specifically, Self-Pruner leverages LLMs to autonomously execute the entire evolutionary search process to search for pruning rate configurations. In this process, LLMs are used to generate populations, select parent solutions from the current population, and perform crossover and mutation operations to produce offspring solutions. In this way, LLMs automatically generate and evaluate a large number of candidate solutions, effectively converging to find the pruning rate configurations with minimal human intervention. Extensive experiments demonstrate Self-Pruner's better performance compared to existing state-of-the-art methods. Notably, Self-Pruner prunes LLaMA-2-70B to 49B level with only 0.80% drop in accuracy across seven commonsense reasoning tasks, achieving a 1.39× speedup on NVIDIA A100 80GB GPU. Further pruning to 35B level resulted in only a 3.80% decrease in accuracy while obtaining a 1.70× speedup.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). First posted on arXiv 20 Feb 2025.
Builds on
0 of 0 references.
No references here yet.
Built on by
Citing papers per year: 2026: 1.
1 paper.
Similar, not cited
Close in wording, no citation either way
- 2025Automatic Pruning Discovery for Large Language Models
- 2025SPAP: Structured Pruning via Alternating Optimization and Penalty Methods
- 2025Pruning Laws for Large Language Models
- 2023Compresso: Structured Pruning with Collaborative Prompting Learns Compact Large Language Models
- 2025From Local to Global: Revisiting Structured Pruning Paradigms for Large Language Models
- 2026LLMs can Compress LLMs: Adaptive Pruning by Agents
- 2026MI-PRUN: Optimize Large Language Model Pruning via Mutual Information
- 2025Accurate Sublayer Pruning for Large Language Models by Exploiting Latency and Tunability Information