Frustratingly Easy Task-aware Pruning for Large Language Models
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.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Frustratingly Easy Uncertainty Estimation for Distribution Shift
Distribution shift is an important concern in deep image classification, produced either by corruption of the source images, or a complete change, with the solution involving domain adaptation. While the primary goal is …
Domain Adaptationimage-classificationImage ClassificationUnsupervised Domain AdaptationFrustratingly Easy Cross-Lingual Transfer for Transition-Based Dependency Parsing
Return of Frustratingly Easy Unsupervised Video Domain Adaptation
Unsupervised video domain adaptation (UVDA) is a practical but under-explored problem. In this paper, we propose a frustratingly easy UVDA method, called MetaTrans. Specifically, MetaTrans adopts a concise learning objec…
Action RecognitionDomain AdaptationUsing a Frustratingly Easy Domain and Tagset Adaptation for Creating Slavic Named Entity Recognition Systems
We present a collection of Named Entity Recognition (NER) systems for six Slavic languages: Bulgarian, Czech, Polish, Slovenian, Russian and Ukrainian. These NER systems have been trained using different BERT models and …
Domain AdaptationMiscellaneousnamed-entity-recognitionNamed Entity Recognition+2Return of Frustratingly Easy Domain Adaptation
Unlike human learning, machine learning often fails to handle changes between training (source) and test (target) input distributions. Such domain shifts, common in practical scenarios, severely damage the performance of…
BIG-bench Machine LearningDomain AdaptationUnsupervised Domain Adaptation