The Structural Scalpel: Automated Contiguous Layer Pruning for Large Language Models
Not on the map. Why?
Abstract (arXiv)
Although large language models (LLMs) have achieved revolutionary breakthroughs in many fields, their large model size and high computational cost pose significant challenges for practical deployment on resource-constrained edge devices. To this end, layer pruning has been proposed to reduce the computational overhead by directly removing redundant layers. However, existing layer pruning methods typically rely on hand-crafted metrics to evaluate and remove individual layers, while ignoring the dependencies between layers. This can disrupt the model's information flow and severely degrade performance. To address these issues, we propose CLP, a novel continuous layer pruning framework that introduces two key innovations: a differentiable concave gate algorithm that automatically identifies the best continuous layer segments for pruning via gradient-based optimization; and a cutoff endpoint tuning strategy that effectively restores model performance by fine-tuning only the layers adjacent to the pruned segments. Extensive experiments across multiple model architectures (including LLaMA2, LLaMA3 and Qwen) and sizes (from 7B to 70B parameters) show that CLP significantly outperforms existing state-of-the-art baselines. For example, at a pruning rate of 20%, CLP achieves an average performance retention of 95.34% on LLaMA3-70B, outperforming baselines by 4.29%-30.52%. Furthermore, CLP can be seamlessly combined with quantization to further compress the model with only a slight performance loss.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 55 of its 70 references that are in the map. First posted on arXiv 25 Oct 2025.
Builds on
55 of 70 references.
References · 55
- 2023GPT-4 Technical Reportcited by 18,132
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
- 2024The Llama 3 Herd of Modelscited by 14,192
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 12,865
- 2025Qwen3 Technical Reportcited by 8,195
- 2020Measuring Massive Multitask Language Understandingcited by 7,768
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
- 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,355
- 2023Qwen Technical Reportcited by 3,273
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
38 more
- 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,114
- 2022GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformerscited by 1,838
- 2019Similarity of Neural Network Representations Revisitedcited by 1,695
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
- 2024Qwen2.5-Math Technical Report: Toward Mathematical Expert Model via Self-Improvementcited by 1,057
- 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 776
- 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 643
- 2024MathVerse: Does Your Multi-modal LLM Truly See the Diagrams in Visual Math Problems?cited by 573
- 2024SpinQuant: LLM quantization with learned rotationscited by 446
- 2024Contrastive Preference Optimization: Pushing the Boundaries of LLM Performance in Machine Translationcited by 390
- 2024SliceGPT: Compress Large Language Models by Deleting Rows and Columnscited by 378
- 2024ShortGPT: Layers in Large Language Models are More Redundant Than You Expectcited by 369
- 2025Layer by Layer: Uncovering Hidden Representations in Language Modelscited by 293
- 2024Large Language Models for Mathematical Reasoning: Progresses and Challengescited by 283
- 2024A Survey on Knowledge Distillation of Large Language Modelscited by 276
- 2024SVD-LLM: Truncation-aware Singular Value Decomposition for Large Language Model Compressioncited by 231
- 2024The Unreasonable Ineffectiveness of the Deeper Layerscited by 219
- 2024A Survey on Recent Advances in LLM-Based Multi-turn Dialogue Systemscited by 170
- 2022AdaMix: Mixture-of-Adaptations for Parameter-efficient Model Tuningcited by 137
- 2024LaCo: Large Language Model Pruning via Layer Collapsecited by 124
- 2023Fluctuation-based Adaptive Structured Pruning for Large Language Modelscited by 110
- 2024Beyond Functional Correctness: Exploring Hallucinations in LLM-Generated Codecited by 106
- 2024SLEB: Streamlining LLMs through Redundancy Verification and Elimination of Transformer Blockscited by 96
- 2023Can ChatGPT Defend its Belief in Truth? Evaluating LLM Reasoning via Debatecited by 92
- 2024Enhancing Code LLMs with Reinforcement Learning in Code Generation: A Surveycited by 82
- 2024Shortened LLaMA: Depth Pruning for Large Language Models with Comparison of Retraining Methodscited by 80
- 2024From LLM to NMT: Advancing Low-Resource Machine Translation with Claudecited by 57
- 2024SlimGPT: Layer-wise Structured Pruning for Large Language Modelscited by 43
- 2025SCORE: Story Coherence and Retrieval Enhancement for AI Narrativescited by 42
- 2025SepPrune: Structured Pruning for Efficient Deep Speech Separationcited by 31
- 2021Redesigning the Transformer Architecture with Insights from Multi-particle Dynamical Systemscited by 29
- 2024FinerCut: Finer-grained Interpretable Layer Pruning for Large Language Modelscited by 26
- 2024Reassessing Layer Pruning in LLMs: New Insights and Methodscited by 23
- 2024Efficient Fine-Tuning of Large Language Models for Automated Medical Documentationcited by 16
- 2025You Only Prune Once: Designing Calibration-Free Model Compression With Policy Learningcited by 16
- 2025Sensitivity-LoRA: Low-Load Sensitivity-Based Fine-Tuning for Large Language Modelscited by 14
- 2024On the Benchmarking of LLMs for Open-Domain Dialogue Evaluationcited by 10
- 2024Adaptive Feature-based Low-Rank Compression of Large Language Models via Bayesian Optimizationcited by 9
50 most cited of 55 All 55 (JSON)
Built on by
Citing papers per year: 2025: 1.
1 paper.