Saved in:
| Main Authors: | , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2602.06822 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915780417814528 |
|---|---|
| author | Chen, Yi Shin, Wonjin Liu, Shuhong Mai, Tho Lee, Jeongmo Hua, Chuanbo Wang, Kun Liu, Jun Kim, Joo-Young |
| author_facet | Chen, Yi Shin, Wonjin Liu, Shuhong Mai, Tho Lee, Jeongmo Hua, Chuanbo Wang, Kun Liu, Jun Kim, Joo-Young |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_06822 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | POP: Online Structural Pruning Enables Efficient Inference of Large Foundation Models Chen, Yi Shin, Wonjin Liu, Shuhong Mai, Tho Lee, Jeongmo Hua, Chuanbo Wang, Kun Liu, Jun Kim, Joo-Young Artificial Intelligence 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. |
| title | POP: Online Structural Pruning Enables Efficient Inference of Large Foundation Models |
| topic | Artificial Intelligence |
| url | https://arxiv.org/abs/2602.06822 |