POP: Prefill-Only Pruning for Efficient Large Model Inference

Read full text
Authors: Junhui He, Zhihui Fu, Jun Wang, Qingan Li
Cited by: 1

Abstract

Large Language Models (LLMs) and Vision-Language Models (VLMs) have demonstrated remarkable capabilities.However, their deployment is hindered by significant computational costs.Existing structured pruning methods, while hardware-efficient, often suffer from significant accuracy degradation.In this paper, we argue that this failure stems from a stageagnostic pruning approach that overlooks the asymmetric roles between the prefill and decode stages.By introducing a virtual gate mechanism, our importance analysis reveals that deep layers are critical for next-token prediction (decode) but largely redundant for context encoding (prefill).Leveraging this insight, we propose Prefill-Only Pruning (POP), a stageaware inference strategy that safely omits deep layers during the computationally intensive prefill stage while retaining the full model for the sensitive decode stage.To enable the transition between stages, we introduce independent Key-Value (KV) projections to maintain cache integrity, and a boundary handling strategy to ensure the accuracy of the first generated token.Extensive experiments on Llama-3.1,Qwen3-VL, and Gemma-3 across diverse modalities demonstrate that POP achieves up to 1.37× speedup in prefill latency with minimal performance loss, effectively overcoming the accuracy-efficiency trade-off limitations of existing structured pruning methods.

Fields of Study & Subjects

Generative Adversarial Networks and Image Synthesis Domain Adaptation and Few-Shot Learning Advanced Neural Network Applications

Publication details

Journal / source
Findings of the Association for Computational Linguistics: ACL 2026
Publisher
Association for Computational Linguistics
Pages
5864–5877
Publication date
1 January 2026