Two-Stage Regularization-Based Structured Pruning for LLMs
Not on the map. Why?
Abstract (arXiv)
The deployment of large language models (LLMs) is largely hindered by their large number of parameters. Structural pruning has emerged as a promising solution. Prior structured pruning methods directly remove unimportant parameters based on certain metrics, which often causes knowledge loss and necessitates extensive retraining. To overcome this, we introduce a novel pruning method TRSP: Two-Stage Regularization-Based Structured Pruning for LLMs. Specifically, we multiply the output of each transformer layer by an initial learnable weight and iteratively learn these weights by adding their ℓ1-norm as a regularization term to the loss function, serving as the first-stage regularization. Subsequently, we apply additional regularization to the difference between the output and input of layers with smaller weights, encouraging the shift of knowledge to the preserved layers. This serves as the second-stage regularization. TRSP retains more knowledge and better preserves model performance than direct parameter elimination. Through extensive experimentation we show that TRSP outperforms strong layer-wise structured pruning methods without requiring retraining. As a layer-wise pruning method, it delivers notable end-to-end acceleration, making it a promising solution for efficient LLM deployment.Code is available at https://github.com/fmk345/TRSP.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 27 of its 58 references that are in the map. First posted on arXiv 23 May 2025.
Builds on
27 of 58 references.
References · 27
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
- 2016Pointer Sentinel Mixture Modelscited by 3,096
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
- 2021Convex optimizationcited by 2,515
- 2019HuggingFace's Transformers: State-of-the-art Natural Language Processingcited by 2,218
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
- 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 676
15 more
- 2022ZeroQuant: Efficient and Affordable Post-Training Quantization for Large-Scale Transformerscited by 526
- 2023Sheared LLaMA: Accelerating Language Model Pre-training via Structured Pruningcited by 415
- 2024SliceGPT: Compress Large Language Models by Deleting Rows and Columnscited by 385
- 2024ShortGPT: Layers in Large Language Models are More Redundant Than You Expectcited by 383
- 2023SpQR: A Sparse-Quantized Representation for Near-Lossless LLM Weight Compressioncited by 367
- 2023Outlier Weighed Layerwise Sparsity (OWL): A Missing Secret Sauce for Pruning LLMs to High Sparsitycited by 165
- 2024LaCo: Large Language Model Pruning via Layer Collapsecited by 126
- 2024SLEB: Streamlining LLMs through Redundancy Verification and Elimination of Transformer Blockscited by 97
- 2022The Effects of Regularization and Data Augmentation are Class Dependentcited by 67
- 2024Beyond Examples: High-level Automated Reasoning Paradigm in In-Context Learning via MCTScited by 54
- 2024BESA: Pruning Large Language Models with Blockwise Parameter-Efficient Sparsity Allocationcited by 45
- 2024PhD: A ChatGPT-Prompted Visual hallucination Evaluation Datasetcited by 45
- 2025TemplateRL: Structured Template-Guided Reinforcement Learning for LLM Reasoningcited by 28
- 2025AStar: Boosting Multimodal Reasoning with Automated Structured Thinkingcited by 25
- 2025DReSS: Data-driven Regularized Structured Streamlining for Large Language Modelscited by 3
Built on by
Citing papers per year: 2026: 3.
3 papers.
- 2026TACO: Tool-Augmented Credit Optimization for Agentic Tool Usecited by 5
- 2026Late-Layer Fusion is Enough: Dual-Path Vision Token Routing for Multimodal Large Language Models under Visual Saturationcited by 0
- 2026Decoupled Visual Processing: Efficient Multimodal Adaptation via Modality-Specific Transformer Substitutioncited by 0
- 2026Decoupled Visual Processing: Efficient Multimodal Adaptation via Modality-Specific Transformer Substitution29 Jul 2026
- 2026TACO: Tool-Augmented Credit Optimization for Agentic Tool Use29 Jun 2026
- 2026Late-Layer Fusion is Enough: Dual-Path Vision Token Routing for Multimodal Large Language Models under Visual Saturation8 Jun 2026