PASER: Post-Training Data Selection for Efficient Pruned Large Language Model Recovery
Not on the map. Why?
Abstract (arXiv)
Model pruning is an effective approach for compressing large language models (LLMs). However, this process often leads to significant degradation of model capabilities. While post-training techniques such as instruction tuning are commonly employed to recover model performance, existing methods often overlook the uneven deterioration of model capabilities and incur high computational costs. Moreover, some irrelevant instructions may also introduce negative effects to model capacity recovery. To address these challenges, we propose the Post-training dAta Selection method for Efficient pruned large language model Recovery (PASER). PASER aims to identify instructions to recover the most compromised model capacities with a certain data budget. Our approach first applies manifold learning and spectral clustering to group recovery instructions in the semantic space, revealing capability-specific instruction sets. Then, the data budget is adaptively allocated across clusters by the degree of corresponding model capability degradation. In each cluster, we prioritize data samples that lead to the most decline of model performance. To mitigate potential negative tuning effects, we also detect and filter out conflicting or irrelevant recovery data. Extensive experiments demonstrate that PASER significantly outperforms conventional baselines, effectively recovering the general capabilities of pruned LLMs while utilizing merely 4%-20% of the original post-training data. We provide the code repository in hrefhttps://github.com/BokwaiHo/PASERLink.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 63 of its 76 references that are in the map. First posted on arXiv 18 Feb 2025.
Builds on
63 of 76 references.
References · 63
- 2024The Llama 3 Herd of Modelscited by 14,715
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
- 2021Training Verifiers to Solve Math Word Problemscited by 10,109
- 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,170
- 2021Evaluating Large Language Models Trained on Codecited by 8,320
- 2020Measuring Massive Multitask Language Understandingcited by 7,963
- 2020Scaling Laws for Neural Language Modelscited by 6,586
- 2024Qwen2.5 Technical Reportcited by 4,942
- 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
- 2021Finetuned Language Models Are Zero-Shot Learnerscited by 3,780
- 2021Program Synthesis with Large Language Modelscited by 3,637
38 more
- 2016Pointer Sentinel Mixture Modelscited by 3,096
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
- 2022Self-Instruct: Aligning Language Models with Self-Generated Instructionscited by 2,724
- 2022Locating and Editing Factual Associations in GPTcited by 2,691
- 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,183
- 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,164
- 2024Mixtral of Expertscited by 1,823
- 2018CommonsenseQA: A Question Answering Challenge Targeting Commonsense Knowledgecited by 1,822
- 2021Multitask Prompted Training Enables Zero-Shot Task Generalizationcited by 1,470
- 2022Solving Quantitative Reasoning Problems with Language Modelscited by 1,392
- 2023AWQ: Activation-aware Weight Quantization for LLM Compression and Accelerationcited by 1,298
- 2019TinyBERT: Distilling BERT for Natural Language Understandingcited by 1,167
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
- 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 800
- 2023The Flan Collection: Designing Data and Methods for Effective Instruction Tuningcited by 739
- 2023Baichuan 2: Open Large-scale Language Modelscited by 670
- 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 650
- 2021Knowledge Neurons in Pretrained Transformerscited by 601
- 2024LESS: Selecting Influential Data for Targeted Instruction Tuningcited by 532
- 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
- 2022Optimal Brain Compression: A Framework for Accurate Post-Training Quantization and Pruningcited by 322
- 2023From Quantity to Quality: Boosting LLM Performance with Self-Guided Data Selection for Instruction Tuningcited by 307
- 2022Datamodels: Predicting Predictions from Training Datacited by 189
- 2023Outlier Weighed Layerwise Sparsity (OWL): A Missing Secret Sauce for Pruning LLMs to High Sparsitycited by 165
- 2024DistiLLM: Towards Streamlined Distillation for Large Language Modelscited by 163
- 2024Compact Language Models via Pruning and Knowledge Distillationcited by 148
- 2023LaMini-LM: A Diverse Herd of Distilled Models from Large-Scale Instructionscited by 124
- 2023Fluctuation-based Adaptive Structured Pruning for Large Language Modelscited by 111
- 2022LUT-GEMM: Quantized Matrix Multiplication based on LUTs for Efficient Inference in Large-Scale Generative Language Modelscited by 105
- 2024SLEB: Streamlining LLMs through Redundancy Verification and Elimination of Transformer Blockscited by 97
- 2024Speculative Knowledge Distillation: Bridging the Teacher-Student Gap Through Interleaved Samplingcited by 90
- 2023Test-Time Training on Nearest Neighbors for Large Language Modelscited by 88
- 2024A Survey on Data Selection for LLM Instruction Tuningcited by 77
- 2023Instruction Mining: Instruction Data Selection for Tuning Large Language Modelscited by 58
- 2023LoRAPrune: Structured Pruning Meets Low-Rank Parameter-Efficient Fine-Tuningcited by 53
- 2024BESA: Pruning Large Language Models with Blockwise Parameter-Efficient Sparsity Allocationcited by 45
50 most cited of 63 All 63 (JSON)
Built on by
Citing papers per year: 2026: 4.
4 papers.
- 2026One Algorithm, Two Goals: Dual Scoring for Parameter and Data Selection in LLM Fine-Tuningcited by 0
- 2026Scaling Mobile Agent Systems: From Capability Density to Collective Intelligencecited by 0
- 2026Distributionally Robust Set Representation Learning Under Inference-Time Element Corruptioncited by 0
- 2026FidelityQ: Preserving Predictive Fidelity in Ultra-Low-Bit Language Model Quantizationcited by 0
- 2026FidelityQ: Preserving Predictive Fidelity in Ultra-Low-Bit Language Model Quantization10 Oct 2026
- 2026Distributionally Robust Set Representation Learning Under Inference-Time Element Corruption28 May 2026
- 2026One Algorithm, Two Goals: Dual Scoring for Parameter and Data Selection in LLM Fine-Tuning7 May 2026
- 2026Scaling Mobile Agent Systems: From Capability Density to Collective Intelligence29 Apr 2026