You Only Prune Once: Designing Calibration-Free Model Compression With Policy Learning
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
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2020Measuring Massive Multitask Language Understandingcited by 7,768
- 2016Layer Normalizationcited by 5,579
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
- 2016Pointer Sentinel Mixture Modelscited by 2,992
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
- 2016The Concrete Distribution: A Continuous Relaxation of Discrete Random Variablescited by 1,135
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
- 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 643
- 2024SliceGPT: Compress Large Language Models by Deleting Rows and Columnscited by 378
- 2024ShortGPT: Layers in Large Language Models are More Redundant Than You Expectcited by 369
5 more
- 2024SVD-LLM: Truncation-aware Singular Value Decomposition for Large Language Model Compressioncited by 231
- 2022Language model compression with weighted low-rank factorizationcited by 192
- 2023ASVD: Activation-aware Singular Value Decomposition for Compressing Large Language Modelscited by 156
- 2024LaCo: Large Language Model Pruning via Layer Collapsecited by 124
- 2023ReLU Strikes Back: Exploiting Activation Sparsity in Large Language Modelscited by 91
Built on by
Citing papers per year: 2025: 7; 2026: 9.
16 papers.
Sort:
By area:
- 2025EfficientVLA: Training-Free Acceleration and Compression for Vision-Language-Action Modelscited by 89
- 2025Efficient LLMs with AMP: Attention Heads and MLP Pruningcited by 5
- 2025Position: Enough of Scaling LLMs! Lets Focus on Downscalingcited by 5
- 2026AIMER: Calibration-Free Task-Agnostic MoE Expert Pruningcited by 5
- 2026It Takes a MAESTRO To Prune Bad Expertscited by 2
- 2026Understanding Calibration and Truncation Error Propagation in Training-Free Low-Rank Compression for LLMscited by 2
- 2025Pruning Laws for Large Language Modelscited by 1
- 2025Efficient Large Language Model Inference with Neural Block Linearizationcited by 1
- 2025The Structural Scalpel: Automated Contiguous Layer Pruning for Large Language Modelscited by 1
- 2025Towards Efficient VLMs: Information-Theoretic Driven Compression via Adaptive Structural Pruningcited by 1
- 2026Compressing LLMs with MoP: Mixture of Prunerscited by 0
- 2026Decompose, Mix, Adapt: A Unified Framework for Parameter-Efficient Neural Network Recombination and Compressioncited by 0
4 more
- 2026SlimVLM: Sensitivity-aware Dynamic Structured Pruning with Adaptive Visual Token Selection for Efficient Vision-Language Modelscited by 0
- 2026Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimizationcited by 0
- 2026LaMoC: Loss-Aware Modular Compression for LLMscited by 0
- 2026LILA: Calibration-Free Structured Pruning of Large Language Models via Latent Spectral Geometrycited by 0
- 2026LILA: Calibration-Free Structured Pruning of Large Language Models via Latent Spectral Geometry10 Sep 2026
- 2026LaMoC: Loss-Aware Modular Compression for LLMs31 Aug 2026
- 2026Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization13 Aug 2026
- 2026Understanding Calibration and Truncation Error Propagation in Training-Free Low-Rank Compression for LLMs9 Aug 2026
- 2026SlimVLM: Sensitivity-aware Dynamic Structured Pruning with Adaptive Visual Token Selection for Efficient Vision-Language Models4 Aug 2026
- 2026It Takes a MAESTRO To Prune Bad Experts9 Jul 2026
- 2026Decompose, Mix, Adapt: A Unified Framework for Parameter-Efficient Neural Network Recombination and Compression28 Mar 2026
- 2026AIMER: Calibration-Free Task-Agnostic MoE Expert Pruning19 Mar 2026
- 2026Compressing LLMs with MoP: Mixture of Pruners5 Feb 2026
- 2025Towards Efficient VLMs: Information-Theoretic Driven Compression via Adaptive Structural Pruning24 Nov 2025
- 2025The Structural Scalpel: Automated Contiguous Layer Pruning for Large Language Models25 Oct 2025
- 2025EfficientVLA: Training-Free Acceleration and Compression for Vision-Language-Action Models11 Jun 2025
4 more
- 2025Efficient Large Language Model Inference with Neural Block Linearization27 May 2025
- 2025Position: Enough of Scaling LLMs! Lets Focus on Downscaling2 May 2025
- 2025Efficient LLMs with AMP: Attention Heads and MLP Pruning29 Apr 2025
- 2025Pruning Laws for Large Language Models6 Apr 2025
- 2026AIMER: Calibration-Free Task-Agnostic MoE Expert Pruningcited by 5
- 2026It Takes a MAESTRO To Prune Bad Expertscited by 2
- 2025Pruning Laws for Large Language Modelscited by 1
- 2026It Takes a MAESTRO To Prune Bad Experts9 Jul 2026
- 2026AIMER: Calibration-Free Task-Agnostic MoE Expert Pruning19 Mar 2026
- 2025Pruning Laws for Large Language Models6 Apr 2025
- 2025Efficient LLMs with AMP: Attention Heads and MLP Pruningcited by 5
- 2025Position: Enough of Scaling LLMs! Lets Focus on Downscalingcited by 5
- 2026Understanding Calibration and Truncation Error Propagation in Training-Free Low-Rank Compression for LLMscited by 2
- 2025The Structural Scalpel: Automated Contiguous Layer Pruning for Large Language Modelscited by 1
- 2026Compressing LLMs with MoP: Mixture of Prunerscited by 0
- 2026Decompose, Mix, Adapt: A Unified Framework for Parameter-Efficient Neural Network Recombination and Compressioncited by 0
- 2026Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimizationcited by 0
- 2026LaMoC: Loss-Aware Modular Compression for LLMscited by 0
- 2026LILA: Calibration-Free Structured Pruning of Large Language Models via Latent Spectral Geometrycited by 0
- 2026LILA: Calibration-Free Structured Pruning of Large Language Models via Latent Spectral Geometry10 Sep 2026
- 2026LaMoC: Loss-Aware Modular Compression for LLMs31 Aug 2026
- 2026Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization13 Aug 2026
- 2026Understanding Calibration and Truncation Error Propagation in Training-Free Low-Rank Compression for LLMs9 Aug 2026
- 2026Decompose, Mix, Adapt: A Unified Framework for Parameter-Efficient Neural Network Recombination and Compression28 Mar 2026
- 2026Compressing LLMs with MoP: Mixture of Pruners5 Feb 2026
- 2025The Structural Scalpel: Automated Contiguous Layer Pruning for Large Language Models25 Oct 2025
- 2025Position: Enough of Scaling LLMs! Lets Focus on Downscaling2 May 2025
- 2025Efficient LLMs with AMP: Attention Heads and MLP Pruning29 Apr 2025