mlsanityData to 7 Oct 2026

You Only Prune Once: Designing Calibration-Free Model Compression With Policy Learning

arXiv 2501.15296 ↗First posted 25 Jan 2025cs.CLcited by 16

Not on the map. Why?

Abstract (arXiv)

The ever-increasing size of large language models (LLMs) presents significant challenges for deployment due to their heavy computational and memory requirements. Current model pruning techniques attempt to alleviate these issues by relying heavily on external calibration datasets to determine which parameters to prune or compress, thus limiting their flexibility and scalability across different compression ratios. Moreover, these methods often cause severe performance degradation, particularly in downstream tasks, when subjected to higher compression rates. In this paper, we propose PruneNet, a novel model compression method that addresses these limitations by reformulating model pruning as a policy learning process. PruneNet decouples the pruning process from the model architecture, eliminating the need for calibration datasets. It learns a stochastic pruning policy to assess parameter importance solely based on intrinsic model properties while preserving the spectral structure to minimize information loss. PruneNet can compress the LLaMA-2-7B model in just 15 minutes, achieving over 80% retention of its zero-shot performance with a 30% compression ratio, outperforming existing methods that retain only 75% performance. Furthermore, on complex multitask language understanding tasks, PruneNet demonstrates its robustness by preserving up to 80% performance of the original model, proving itself a superior alternative to conventional structured compression techniques.

Key facts. Cited by 16 papers in the map (data through 7 Oct 2026). Builds on 17 of its 27 references that are in the map. First posted on arXiv 25 Jan 2025.

Builds on

17 of 27 references.

References · 17

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2020Measuring Massive Multitask Language Understandingcited by 7,768
  3. 2016Layer Normalizationcited by 5,579
  4. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
  5. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
  6. 2016Pointer Sentinel Mixture Modelscited by 2,992
  7. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
  8. 2016The Concrete Distribution: A Continuous Relaxation of Discrete Random Variablescited by 1,135
  9. 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
  10. 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 643
  11. 2024SliceGPT: Compress Large Language Models by Deleting Rows and Columnscited by 378
  12. 2024ShortGPT: Layers in Large Language Models are More Redundant Than You Expectcited by 369
5 more
  1. 2024SVD-LLM: Truncation-aware Singular Value Decomposition for Large Language Model Compressioncited by 231
  2. 2022Language model compression with weighted low-rank factorizationcited by 192
  3. 2023ASVD: Activation-aware Singular Value Decomposition for Compressing Large Language Modelscited by 156
  4. 2024LaCo: Large Language Model Pruning via Layer Collapsecited by 124
  5. 2023ReLU Strikes Back: Exploiting Activation Sparsity in Large Language Modelscited by 91

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 7; 2026: 9.

16 papers.

Sort:

By area: