paper-with-me

홈 › Papers

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

2025-07-24 · Xinrui Chen, Hongxing Zhang, Fanyi Zeng, Yongxian Wei, Yizhi Wang, Xitong Ling, Guanghao Li, Chun Yuan 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%.

📄 PDF Abstract BibTeX arXiv:2507.18212

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Pruning On-the-Fly: A Recoverable Pruning Method without Fine-tuning

2022-12-24 · Dan Liu, Xue Liu

Most existing pruning works are resource-intensive, requiring retraining or fine-tuning of the pruned models for accuracy. We propose a retraining-free pruning method based on hyperspherical learning and loss penalty ter…

Six Layers Less: Encoder Pruning for Whisper with Label-Free Recovery

2026-09-23 · Rasmus Aagaard, Nicki Skafte Detlefsen hf

Pruning large pre-trained transformer-based ASR models such as OpenAI's Whisper has seen great adoption, as pruning the decoder led to significant end-to-end transcription speedups. For instance, the {\tt whisper-large-v…

Why Lottery Ticket Wins? A Theoretical Perspective of Sample Complexity on Pruned Neural Networks

2021-10-12 · Shuai Zhang, Meng Wang, Sijia Liu, Pin-Yu Chen 외

The \textit{lottery ticket hypothesis} (LTH) states that learning on a properly pruned network (the \textit{winning ticket}) improves test accuracy over the original unpruned network. Although LTH has been justified empi…

Ghosted Layers: Unconstrained Activation Alignment for Recovering Layer-Pruned LLMs

2026-05-15 · Vincent-Daniel Yun, Junhyuk Jo, Sai Praneeth Karimireddy, Sunwoo Lee arxiv

Layer pruning removes entire Transformer decoder blocks from large language models, but introduces a mismatch between the hidden state received by the next surviving layer and the distribution it was trained to process, …

Network Pruning via Transformable Architecture Search

2019-05-23 · NeurIPS 2019 12 · Xuanyi Dong, Yi Yang

Network pruning reduces the computation costs of an over-parameterized network without performance damage. Prevailing pruning algorithms pre-define the width and depth of the pruned networks, and then transfer parameters…

Knowledge DistillationNetwork PruningNeural Architecture SearchTransfer Learning