GradPruner: Gradient-Guided Layer Pruning Enabling Efficient Fine-Tuning and Inference for LLMs
Not on the map. Why?
Abstract (arXiv)
Fine-tuning Large Language Models (LLMs) with downstream data is often considered time-consuming and expensive. Structured pruning methods are primarily employed to improve the inference efficiency of pre-trained models. Meanwhile, they often require additional time and memory for training, knowledge distillation, structure search, and other strategies, making efficient model fine-tuning challenging to achieve. To simultaneously enhance the training and inference efficiency of downstream task fine-tuning, we introduce GradPruner, which can prune layers of LLMs guided by gradients in the early stages of fine-tuning. GradPruner uses the cumulative gradients of each parameter during the initial phase of fine-tuning to compute the Initial Gradient Information Accumulation Matrix (IGIA-Matrix) to assess the importance of layers and perform pruning. We sparsify the pruned layers based on the IGIA-Matrix and merge them with the remaining layers. Only elements with the same sign are merged to reduce interference from sign variations. We conducted extensive experiments on two LLMs across eight downstream datasets. Including medical, financial, and general benchmark tasks. The results demonstrate that GradPruner has achieved a parameter reduction of 40% with only a 0.99% decrease in accuracy. Our code is publicly available.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 32 of its 36 references that are in the map. First posted on arXiv 27 Jan 2026.
Builds on
32 of 36 references.
References · 32
- 2024The Llama 3 Herd of Modelscited by 14,715
- 2019BERTScore: Evaluating Text Generation with BERTcited by 5,512
- 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
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
- 2019PubMedQA: A Dataset for Biomedical Research Question Answeringcited by 1,288
- 2023TIES-Merging: Resolving Interference When Merging Modelscited by 818
- 2024Parameter-Efficient Fine-Tuning for Large Models: A Comprehensive Surveycited by 656
- 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 650
- 2023Instruction Tuning for Large Language Models: A Surveycited by 623
- 2021Merging Models with Fisher-Weighted Averagingcited by 621
20 more
- 2022MedMCQA : A Large-scale Multi-Subject Multi-Choice Dataset for Medical domain Question Answeringcited by 543
- 2020Pruning neural networks without any data by iteratively conserving synaptic flowcited by 479
- 2024ShortGPT: Layers in Large Language Models are More Redundant Than You Expectcited by 383
- 2023FinGPT: Open-Source Financial Large Language Modelscited by 253
- 2024Compact Language Models via Pruning and Knowledge Distillationcited by 148
- 2024LaCo: Large Language Model Pruning via Layer Collapsecited by 126
- 2023Zhongjing: Enhancing the Chinese Medical Capabilities of Large Language Model through Expert Feedback and Real-world Multi-turn Dialoguecited by 119
- 2019BillSum: A Corpus for Automatic Summarization of US Legislationcited by 117
- 2021Do We Actually Need Dense Over-Parameterization? In-Time Over-Parameterization in Sparse Trainingcited by 110
- 2024What Matters in Transformers? Not All Attention is Neededcited by 84
- 2023Model Merging by Uncertainty-Based Gradient Matchingcited by 77
- 2019The Difficulty of Training Sparse Neural Networkscited by 62
- 2022The State of Sparse Training in Deep Reinforcement Learningcited by 61
- 2024SlimGPT: Layer-wise Structured Pruning for Large Language Modelscited by 44
- 2024APT: Adaptive Pruning and Tuning Pretrained Language Models for Efficient Training and Inferencecited by 29
- 2024Pruning via Merging: Compressing LLMs via Manifold Alignment Based Layer Mergingcited by 19
- 2024NegMerge: Sign-Consensual Weight Merging for Machine Unlearningcited by 9
- 2023NASH: A Simple Unified Framework of Structured Pruning for Accelerating Encoder-Decoder Language Modelscited by 7
- 2024ScaleOT: Privacy-utility-scalable Offsite-tuning with Dynamic LayerReplace and Selective Rank Compressioncited by 6
- 2024Sparsity-Accelerated Training for Large Language Modelscited by 5
Built on by
Citing papers per year: 2026: 3.
3 papers.
Similar, not cited
Close in wording, no citation either way
- 2026GradMAP: Faster Layer Pruning with Gradient Metric and Projection Compensation
- 2024FinerCut: Finer-grained Interpretable Layer Pruning for Large Language Models
- 2025Accurate Sublayer Pruning for Large Language Models by Exploiting Latency and Tunability Information
- 2024Bypass Back-propagation: Optimization-based Structural Pruning for Large Language Models via Policy Gradient
- 2026LLMs can Compress LLMs: Adaptive Pruning by Agents
- 2025Wanda++: Pruning Large Language Models via Regional Gradients
- 2025Pruning Laws for Large Language Models
- 2025E3-Pruner: Towards Efficient, Economical, and Effective Layer Pruning for Large Language Models