动态剪枝让大模型推理更快更准,无需重训练。
POP: Online Structural Pruning Enables Efficient Inference of Large Foundation Models
- 按上下文实时调整剪枝策略,分阶段精简计算量。
- 在多种大模型上实现更高精度,延迟更低。
- 无需预处理,直接部署,适合实际应用。
大规模基础模型(LFMs)通过规模提升性能,但现有结构化剪枝方法在推理时采用固定剪枝决策,忽略了自回归生成过程中动态出现的稀疏模式。本文提出POP(分区引导的在线剪枝)框架,实现低开销的上下文感知动态剪枝。POP将模型通道分为保留、候选和剪枝三区:预填充阶段确定粗粒度剪枝分区,解码阶段在候选区生成细粒度掩码,避免全通道重评估。粗粒度剪枝保留始终重要的权重,细粒度掩码则根据上下文动态调整。POP为轻量级即插即用方案,无需预处理,包括离线校准、重训练或学习预测器。在多种大模型上的广泛评估表明,包括大语言模型(LLMs)、专家混合模型(MoEs)和视觉-语言模型(VLMs),POP在保持更低计算开销的同时,持续优于现有剪枝方法,显著降低推理延迟。
原文摘要 · Abstract (English)
Large foundation models (LFMs) achieve strong performance through scaling, yet current structural pruning methods derive fixed pruning decisions during inference, overlooking sparsity patterns that emerge in the autoregressive token generation. In this paper, we propose POP (Partition-guided Online Pruning), an efficient online structural pruning framework that enables context-conditioned dynamic pruning with minimal computational overhead. POP partitions model channels into retained, candidate, and pruned regions, where prefilling defines a coarse pruning partition, and the decoding stage generates a fine-grained mask within the candidate region, avoiding full-channel re-evaluation. The coarse pruning partition preserves consistently important weights, while the fine-grained masking provides context-conditioned variation during decoding. Moreover, POP is a lightweight, plug-and-play method that requires no preprocessing, including offline calibration, retraining, or learning predictors. Extensive evaluations across diverse LFMs, including large language models (LLMs), mixture-of-experts models (MoEs), and vision-language models (VLMs), demonstrate that POP consistently delivers higher accuracy than existing pruning approaches while incurring smaller computational overhead and minimizing inference latency.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。