FASP: Fast and Accurate Structured Pruning of Large Language Models
Not on the map. Why?
Abstract (arXiv)
The rapid increase in the size of large language models (LLMs) has significantly escalated their computational and memory demands, posing challenges for efficient deployment, especially on resource-constrained devices. Structured pruning has emerged as an effective model compression method that can reduce these demands while preserving performance. In this paper, we introduce FASP (Fast and Accurate Structured Pruning), a novel structured pruning framework for LLMs that emphasizes both speed and accuracy. FASP employs a distinctive pruning structure that interlinks sequential layers, allowing for the removal of columns in one layer while simultaneously eliminating corresponding rows in the preceding layer without incurring additional performance loss. The pruning metric, inspired by Wanda, is computationally efficient and effectively selects components to prune. Additionally, we propose a restoration mechanism that enhances model fidelity by adjusting the remaining weights post-pruning. We evaluate FASP on the OPT and LLaMA model families, demonstrating superior performance in terms of perplexity and accuracy on downstream tasks compared to state-of-the-art methods. Our approach achieves significant speed-ups, pruning models such as OPT-125M in 17 seconds and LLaMA-30B in 15 minutes on a single NVIDIA RTX 4090 GPU, making it a highly practical solution for optimizing LLMs.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 16 Jan 2025.
Builds on
0 of 0 references.
No references here yet.
Built on by
Citing papers per year: 2025: 3; 2026: 1.
4 papers.
- 2025SPAP: Structured Pruning via Alternating Optimization and Penalty Methodscited by 1
- 2025StructPrune: Structured Global Pruning asymptotics with O(√N) GPU Memorycited by 1
- 2025Interpret, prune and distill Donut : towards lightweight VLMs for VQA on documentcited by 0
- 2026POP: Online Structural Pruning Enables Efficient Inference of Large Foundation Modelscited by 0
- 2026POP: Online Structural Pruning Enables Efficient Inference of Large Foundation Models6 Feb 2026
- 2025Interpret, prune and distill Donut : towards lightweight VLMs for VQA on document30 Sep 2025
- 2025StructPrune: Structured Global Pruning asymptotics with O(√N) GPU Memory25 Sep 2025
- 2025SPAP: Structured Pruning via Alternating Optimization and Penalty Methods6 May 2025