mlsanityData to 14 Oct 2026

Prune&Comp: Free Lunch for Layer-Pruned LLMs via Iterative Pruning with Magnitude Compensation

arXiv 2507.18212 ↗First posted 24 Jul 2025cs.CLcited by 5

Not on the map. Why?

Abstract (arXiv)

Layer pruning has emerged as a promising technique for compressing large language models (LLMs) while achieving acceleration proportional to the pruning ratio. In this work, we identify that removing any layer induces a significant magnitude gap in hidden states, resulting in substantial performance degradation. To address this issue, we propose Prune&Comp, a novel plug-and-play layer pruning scheme that leverages magnitude compensation to mitigate such gaps in a training-free manner. Specifically, we first estimate the magnitude gap caused by layer removal and then eliminate this gap by rescaling the remaining weights offline, with zero runtime overhead incurred. We further demonstrate the advantages of Prune&Comp through an iterative pruning strategy. When integrated with an iterative prune-and-compensate loop, Prune&Comp consistently enhances existing layer pruning metrics. For instance, when 5 layers of LLaMA-3-8B are pruned using the prevalent block influence metric, Prune&Comp nearly halves the perplexity and retains 93.19% of the original model's question-answering performance, outperforming the baseline by 4.01%.

Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 18 of its 30 references that are in the map. First posted on arXiv 24 Jul 2025.

Builds on

18 of 30 references.

References · 18

  1. 2024The Llama 3 Herd of Modelscited by 14,715
  2. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
  3. 2020Measuring Massive Multitask Language Understandingcited by 7,963
  4. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
  5. 2016Pointer Sentinel Mixture Modelscited by 3,096
  6. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
  7. 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,183
  8. 2019SuperGlue: Learning Feature Matching with Graph Neural Networkscited by 1,443
  9. 2025Kimi k1.5: Scaling Reinforcement Learning with LLMscited by 1,210
  10. 2017RACE: Large-scale ReAding Comprehension Dataset From Examinationscited by 861
  11. 2024QuaRot: Outlier-Free 4-Bit Inference in Rotated LLMscited by 634
  12. 2023Sheared LLaMA: Accelerating Language Model Pre-training via Structured Pruningcited by 415
6 more
  1. 2024SliceGPT: Compress Large Language Models by Deleting Rows and Columnscited by 385
  2. 2024ShortGPT: Layers in Large Language Models are More Redundant Than You Expectcited by 383
  3. 2024The Unreasonable Ineffectiveness of the Deeper Layerscited by 226
  4. 2024FlatQuant: Flatness Matters for LLM Quantizationcited by 131
  5. 2024SLEB: Streamlining LLMs through Redundancy Verification and Elimination of Transformer Blockscited by 97
  6. 2024LLM Pruning and Distillation in Practice: The Minitron Approachcited by 82

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 5.

5 papers.