POP: Online Structural Pruning Enables Efficient Inference of Large Foundation Models
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 66 of its 85 references that are in the map. First posted on arXiv 6 Feb 2026.
Builds on
66 of 85 references.
References · 66
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2014Microsoft COCO: Common Objects in Contextcited by 17,498
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
- 2024The Llama 3 Herd of Modelscited by 14,192
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 12,865
- 2021Training Verifiers to Solve Math Word Problemscited by 9,743
- 2025Qwen3 Technical Reportcited by 8,195
- 2023Segment Anythingcited by 8,158
- 2021Evaluating Large Language Models Trained on Codecited by 8,053
- 2020Scaling Laws for Neural Language Modelscited by 6,411
- 2025Qwen2.5-VL Technical Reportcited by 5,418
38 more
- 2022PaLM: Scaling Language Modeling with Pathwayscited by 5,304
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
- 2022Flamingo: a Visual Language Model for Few-Shot Learningcited by 4,337
- 2024Qwen2-VL: Enhancing Vision-Language Model's Perception of the World at Any Resolutioncited by 4,151
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
- 2021On the Opportunities and Risks of Foundation Modelscited by 3,961
- 2021Program Synthesis with Large Language Modelscited by 3,509
- 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,014
- 2016Pointer Sentinel Mixture Modelscited by 2,992
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
- 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,140
- 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,114
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
- 2022Learn to Explain: Multimodal Reasoning via Thought Chains for Science Question Answeringcited by 1,881
- 2023Evaluating Object Hallucination in Large Vision-Language Modelscited by 1,696
- 2023MME: A Comprehensive Evaluation Benchmark for Multimodal Large Language Modelscited by 1,624
- 2020GShard: Scaling Giant Models with Conditional Computation and Automatic Shardingcited by 1,601
- 2017Quantization and Training of Neural Networks for Efficient Integer-Arithmetic-Only Inferencecited by 1,548
- 2020Transformer Feed-Forward Layers Are Key-Value Memoriescited by 1,307
- 2022DINO: DETR with Improved DeNoising Anchor Boxes for End-to-End Object Detectioncited by 1,306
- 2019LVIS: A Dataset for Large Vocabulary Instance Segmentationcited by 1,215
- 2019OK-VQA: A Visual Question Answering Benchmark Requiring External Knowledgecited by 1,114
- 2024The FineWeb Datasets: Decanting the Web for the Finest Text Data at Scalecited by 1,104
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
- 2021GLaM: Efficient Scaling of Language Models with Mixture-of-Expertscited by 890
- 2019Are Sixteen Heads Really Better than One?cited by 803
- 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 776
- 2022Exploring Plain Vision Transformer Backbones for Object Detectioncited by 723
- 2018CoQA: A Conversational Question Answering Challengecited by 674
- 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 643
- 2022Mixture-of-Experts with Expert Choice Routingcited by 611
- 2023Sheared LLaMA: Accelerating Language Model Pre-training via Structured Pruningcited by 408
- 2024SliceGPT: Compress Large Language Models by Deleting Rows and Columnscited by 378
- 2023Segment Anything in High Qualitycited by 373
- 2024ShortGPT: Layers in Large Language Models are More Redundant Than You Expectcited by 369
- 2014Exploiting Linear Structure Within Convolutional Networks for Efficient Evaluationcited by 304
- 2023PowerInfer: Fast Large Language Model Serving with a Consumer-grade GPUcited by 210
- 2019Structured Pruning of Large Language Modelscited by 201
50 most cited of 66 All 66 (JSON)
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2026POP: Prefill-Only Pruning for Efficient Large Model Inference
- 2025Investigating Structural Pruning and Recovery Techniques for Compressing Multimodal Large Language Models: An Empirical Study
- 2025Pruning Laws for Large Language Models
- 2025From Local to Global: Revisiting Structured Pruning Paradigms for Large Language Models
- 2025SPAP: Structured Pruning via Alternating Optimization and Penalty Methods
- 2024Pruning Foundation Models for High Accuracy without Retraining
- 2025Leveraging KV Similarity for Online Structured Pruning in LLMs
- 2026Structural Pruning of Large Vision Language Models: A Comprehensive Study on Pruning Dynamics, Recovery, and Data Efficiency