High-Fidelity Pruning for Large Language Models
Not on the map. Why?
Abstract (arXiv)
Large Language Models (LLMs) have demonstrated exceptional performance across a wide range of tasks, yet their significant computational and memory requirements present major challenges for deployment. A common approach uses Taylor expansion on the loss function to estimate neuron importance. However, its reliance on one-hot cross entropy loss, a key limitation is that it narrowly assesses importance based only on the probability assigned to the single predicted next token, thereby ignoring the other potential predictions of the original model. An intuitive solution to address this is to employ self distillation criterion for importance evaluation. However, this approach introduces significant computational overhead by requiring a separate teacher model for supervision. To this end, we propose a simple but effective criterion, information entropy of the model's output distribution, to efficiently evaluate importance scores of neurons with Taylor pruning without requirement of additional teacher. Compared to plain cross entropy criterion, it provides a more holistic criterion for Taylor pruning to prune neurons with the least impact on the prediction of model in a global manner, thereby preserving the fidelity of the model's predictive capabilities. Experimental results on extensive zero-shot benchmarks demonstrate that our method consistently outperforms existing pruning methods across the LLaMA and Qwen series models. The source code and trained weights are availabel at https://github.com/visresearch/HFPrune.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 28 of its 36 references that are in the map. First posted on arXiv 9 Mar 2026.
Builds on
28 of 36 references.
References · 28
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
- 2020Scaling Laws for Neural Language Modelscited by 6,411
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
- 2021TruthfulQA: Measuring How Models Mimic Human Falsehoodscited by 2,919
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
- 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,140
- 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,114
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
- 2017RACE: Large-scale ReAding Comprehension Dataset From Examinationscited by 851
- 2019Analyzing Multi-Head Self-Attention: Specialized Heads Do the Heavy Lifting, the Rest Can Be Prunedcited by 844
- 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 776
- 2020CrowS-Pairs: A Challenge Dataset for Measuring Social Biases in Masked Language Modelscited by 703
16 more
- 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 643
- 2019Importance Estimation for Neural Network Pruningcited by 531
- 2024ShortGPT: Layers in Large Language Models are More Redundant Than You Expectcited by 369
- 2022Language model compression with weighted low-rank factorizationcited by 192
- 2023Outlier Weighed Layerwise Sparsity (OWL): A Missing Secret Sauce for Pruning LLMs to High Sparsitycited by 163
- 2024Compact Language Models via Pruning and Knowledge Distillationcited by 142
- 2023LaMini-LM: A Diverse Herd of Distilled Models from Large-Scale Instructionscited by 124
- 2023Fluctuation-based Adaptive Structured Pruning for Large Language Modelscited by 110
- 2024SlimGPT: Layer-wise Structured Pruning for Large Language Modelscited by 43
- 2024Streamlining Redundant Layers to Compress Large Language Modelscited by 32
- 2023Compresso: Structured Pruning with Collaborative Prompting Learns Compact Large Language Modelscited by 19
- 2024LoRAP: Transformer Sub-Layers Deserve Differentiated Structured Compression for Large Language Modelscited by 12
- 2025DenoiseRotator: Enhance Pruning Robustness for LLMs via Importance Concentrationcited by 6
- 2025Olica: Efficient Structured Pruning of Large Language Models without Retrainingcited by 6
- 2025Learning Compact Vision Tokens for Efficient Large Multimodal Modelscited by 3
- 2025Diversity-Guided MLP Reduction for Efficient Large Vision Transformerscited by 3
Built on by
Citing papers per year: 2026: 1.
1 paper.