Frustratingly Easy Task-aware Pruning for Large Language Models
Not on the map. Why?
Abstract (arXiv)
Pruning provides a practical solution to reduce the resources required to run large language models (LLMs) to benefit from their effective capabilities as well as control their cost for training and inference. Research on LLM pruning often ranks the importance of LLM parameters using their magnitudes and calibration-data activations and removes (or masks) the less important ones, accordingly reducing LLMs' size. However, these approaches primarily focus on preserving the LLM's ability to generate fluent sentences, while neglecting performance on specific domains and tasks. In this paper, we propose a simple yet effective pruning approach for LLMs that preserves task-specific capabilities while shrinking their parameter space. We first analyze how conventional pruning minimizes loss perturbation under general-domain calibration and extend this formulation by incorporating task-specific feature distributions into the importance computation of existing pruning algorithms. Thus, our framework computes separate importance scores using both general and task-specific calibration data, partitions parameters into shared and exclusive groups based on activation-norm differences, and then fuses their scores to guide the pruning process. This design enables our method to integrate seamlessly with various foundation pruning techniques and preserve the LLM's specialized abilities under compression. Experiments on widely used benchmarks demonstrate that our approach is effective and consistently outperforms the baselines with identical pruning ratios and different settings.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 51 of its 60 references that are in the map. First posted on arXiv 26 Oct 2025.
Builds on
51 of 60 references.
References · 51
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2023GPT-4 Technical Reportcited by 18,396
- 2022Training language models to follow instructions with human feedbackcited by 15,971
- 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
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
- 2020Measuring Massive Multitask Language Understandingcited by 7,963
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
- 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,375
- 2023Qwen Technical Reportcited by 3,344
- 2016Pointer Sentinel Mixture Modelscited by 3,096
38 more
- 2022Training Compute-Optimal Large Language Modelscited by 3,019
- 2023Sparks of Artificial General Intelligence: Early experiments with GPT-4cited by 2,592
- 2022Emergent Abilities of Large Language Modelscited by 2,512
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,329
- 2018Deep contextualized word representationscited by 2,290
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
- 2020What Disease does this Patient Have? A Large-scale Open Domain Question Answering Dataset from Medical Examscited by 1,356
- 2023GQA: Training Generalized Multi-Query Transformer Models from Multi-Head Checkpointscited by 1,346
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
- 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 812
- 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 800
- 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 650
- 2017Learning Sparse Neural Networks through L0 Regularizationcited by 583
- 2019Importance Estimation for Neural Network Pruningcited by 541
- 2021Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networkscited by 527
- 2019Rigging the Lottery: Making All Tickets Winnerscited by 495
- 2020Pruning neural networks without any data by iteratively conserving synaptic flowcited by 479
- 2019The State of Sparsity in Deep Neural Networkscited by 476
- 2020Movement Pruning: Adaptive Sparsity by Fine-Tuningcited by 403
- 2024SliceGPT: Compress Large Language Models by Deleting Rows and Columnscited by 385
- 2018Filter Pruning via Geometric Median for Deep Convolutional Neural Networks Accelerationcited by 367
- 2019Edge Intelligence: Paving the Last Mile of Artificial Intelligence with Edge Computingcited by 228
- 2016Network Trimming: A Data-Driven Neuron Pruning Approach towards Efficient Deep Architecturescited by 221
- 2015Quantized Convolutional Neural Networks for Mobile Devicescited by 215
- 2019Structured Pruning of Large Language Modelscited by 203
- 2023DepGraph: Towards Any Structural Pruningcited by 203
- 2019What Do Compressed Deep Neural Networks Forget?cited by 171
- 2023Fluctuation-based Adaptive Structured Pruning for Large Language Modelscited by 111
- 2021Dynamic Sparse Training for Deep Reinforcement Learningcited by 49
- 2023Pruning vs Quantization: Which is Better?cited by 46
- 2023ChiMed-GPT: A Chinese Medical Large Language Model with Full Training Regime and Better Alignment to Human Preferencescited by 43
- 2023Gradient-Free Structured Pruning with Unlabeled Datacited by 26
- 2025Wanda++: Pruning Large Language Models via Regional Gradientscited by 26
- 2024SparseLLM: Towards Global Pruning for Pre-trained Language Modelscited by 23
- 2021ZEN 2.0: Continue Training and Adaption for N-gram Enhanced Text Encoderscited by 22
- 2023PERP: Rethinking the Prune-Retrain Paradigm in the Era of LLMscited by 14
- 2024The Iterative Optimal Brain Surgeon: Faster Sparse Recovery by Leveraging Second-Order Informationcited by 8
50 most cited of 51 All 51 (JSON)
Built on by
Citing papers per year: 2025: 1.
1 paper.
- 2025MoE Pathfinder: Trajectory-driven Expert Pruningcited by 7
- 2025MoE Pathfinder: Trajectory-driven Expert Pruning20 Dec 2025