arXiv:2602.03295cs.CLcs.AI2026-02ACL被引 1

只剪枝预填充阶段,大幅提升大模型推理速度。

POP: Prefill-Only Pruning for Efficient Large Model Inference

  • 仅在预填充阶段剪枝深层网络,保留解码阶段完整结构
  • 实测预填充延迟最高提升1.37倍,性能损失极小
  • 适合追求高效推理的部署场景,尤其适用多模态模型

大语言模型和视觉语言模型虽能力强大,但部署受限于高昂计算成本。现有结构化剪枝方法虽硬件友好,却常导致显著精度下降。本文指出问题源于忽视预填充与解码阶段角色差异。通过引入虚拟门机制,发现深层网络对解码关键、对预填充冗余。据此提出预填充专用剪枝(POP),在计算密集的预填充阶段安全移除深层网络,而解码阶段保留全模型。为保障阶段切换,设计独立键值投影以维持缓存一致性,并采用边界处理策略确保首个生成词准确。在Llama-3.1、Qwen3-VL和Gemma-3上跨多模态实验表明,POP实现最高1.37倍预填充延迟加速,几乎无性能损失,有效突破传统剪枝的效率-精度权衡瓶颈。

原文摘要 · Abstract (English)

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 stage-agnostic 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 stage-aware 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$\times$ speedup in prefill latency with minimal performance loss, effectively overcoming the accuracy-efficiency trade-off limitations of existing structured pruning methods.

模型剪枝推理优化大模型

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。