mlsanityData to 14 Oct 2026

OSSCAR: One-Shot Structured Pruning in Vision and Language Models with Combinatorial Optimization

arXiv 2403.12983 ↗First posted 2 Mar 2024cs.CV cs.LGcited by 18

Not on the map. Why?

Abstract (arXiv)

Structured pruning is a promising approach for reducing the inference costs of large vision and language models. By removing carefully chosen structures, e.g., neurons or attention heads, the improvements from this approach can be realized on standard deep learning hardware. In this work, we focus on structured pruning in the one-shot (post-training) setting, which does not require model retraining after pruning. We propose a novel combinatorial optimization framework for this problem, based on a layer-wise reconstruction objective and a careful reformulation that allows for scalable optimization. Moreover, we design a new local combinatorial optimization algorithm, which exploits low-rank updates for efficient local search. Our framework is time and memory-efficient and considerably improves upon state-of-the-art one-shot methods on vision models (e.g., ResNet50, MobileNet) and language models (e.g., OPT-1.3B -- OPT-30B). For language models, e.g., OPT-2.7B, OSSCAR can lead to 125× lower test perplexity on WikiText with 2× inference time speedup in comparison to the state-of-the-art ZipLM approach. Our framework is also 6× -- 8× faster. Notably, our work considers models with tens of billions of parameters, which is up to 100× larger than what has been previously considered in the structured pruning literature.

Key facts. Cited by 18 papers in the map (data through 14 Oct 2026). Builds on 50 of its 68 references that are in the map. First posted on arXiv 2 Mar 2024.

Builds on

50 of 68 references.

References · 50

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
  3. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
  4. 2017MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applicationscited by 3,845
  5. 2022OPT: Open Pre-trained Transformer Language Modelscited by 3,512
  6. 2016Pointer Sentinel Mixture Modelscited by 3,096
  7. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
  8. 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,329
  9. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
  10. 2022SmoothQuant: Accurate and Efficient Post-Training Quantization for Large Language Modelscited by 1,386
  11. 2016Pruning Filters for Efficient ConvNetscited by 1,143
  12. 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
38 more
  1. 2016The LAMBADA dataset: Word prediction requiring a broad discourse contextcited by 992
  2. 2019Analyzing Multi-Head Self-Attention: Specialized Heads Do the Heavy Lifting, the Rest Can Be Prunedcited by 856
  3. 2019Are Sixteen Heads Really Better than One?cited by 816
  4. 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 702
  5. 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 676
  6. 2016Learning Structured Sparsity in Deep Neural Networkscited by 541
  7. 2022ZeroQuant: Efficient and Affordable Post-Training Quantization for Large-Scale Transformerscited by 526
  8. 2017ThiNet: A Filter Level Pruning Method for Deep Neural Network Compressioncited by 442
  9. 2019Reducing Transformer Depth on Demand with Structured Dropoutcited by 439
  10. 2018Filter Pruning via Geometric Median for Deep Convolutional Neural Networks Accelerationcited by 367
  11. 2023Fine-Tuning Language Models with Just Forward Passescited by 345
  12. 2018Soft Filter Pruning for Accelerating Deep Convolutional Neural Networkscited by 315
  13. 2020HRank: Filter Pruning using High-Rank Feature Mapcited by 292
  14. 2020DynaBERT: Dynamic BERT with Adaptive Width and Depthcited by 251
  15. 2016Dynamic Network Surgery for Efficient DNNscited by 233
  16. 2017NISP: Pruning Networks using Neuron Importance Score Propagationcited by 228
  17. 2017Learning to Prune Deep Neural Networks via Layer-wise Optimal Brain Surgeoncited by 221
  18. 2022Structured Pruning Learns Compact and Accurate Modelscited by 170
  19. 2022A Fast Post-Training Pruning Framework for Transformerscited by 162
  20. 2021Group Fisher Pruning for Practical Network Compressioncited by 131
  21. 2020On the Effect of Dropping Layers of Pre-trained Transformer Modelscited by 118
  22. 2015Accelerating Very Deep Convolutional Networks for Classification and Detectioncited by 109
  23. 2015Best Subset Selection via a Modern Optimization Lenscited by 100
  24. 2020SCOP: Scientific Control for Reliable Neural Network Pruningcited by 93
  25. 2015Fast ConvNets Using Group-wise Brain Damagecited by 82
  26. 2020EarlyBERT: Efficient BERT Training via Early-bird Lottery Ticketscited by 79
  27. 2021CHIP: CHannel Independence-based Pruning for Compact Neural Networkscited by 78
  28. 2021Only Train Once: A One-Shot Neural Network Training And Pruning Frameworkcited by 70
  29. 2018Fast Best Subset Selection: Coordinate Descent and Local Combinatorial Optimization Algorithmscited by 53
  30. 2019Neural Network Pruning with Residual-Connections and Limited-Datacited by 52
  31. 2023ZipLM: Inference-Aware Structured Pruning of Language Modelscited by 49
  32. 2020Sparse Regression at Scale: Branch-and-Bound rooted in First-Order Optimizationcited by 45
  33. 2022The Combinatorial Brain Surgeon: Pruning Weights That Cancel One Another in Neural Networkscited by 41
  34. 2023Fast as CHITA: Neural Network Pruning with Combinatorial Optimizationcited by 40
  35. 2023OTOV2: Automatic, Generic, User-Friendlycited by 32
  36. 2019Structured Pruning of a BERT-based Question Answering Modelcited by 16
  37. 2023Efficient Joint Optimization of Layer-Adaptive Weight Pruning in Deep Neural Networkscited by 15
  38. 2021Grouped Variable Selection with Discrete Optimization: Computational and Statistical Perspectivescited by 12

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 4; 2025: 7; 2026: 7.

18 papers.

Sort:

By area:

  1. 2024AlphaPruning: Using Heavy-Tailed Self Regularization Theory for Improved Layer-wise Pruning of Large Language Modelscited by 36
  2. 2024ALPS: Improved Optimization for Highly Sparse One-Shot Pruning for Large Language Modelscited by 19
  3. 2024Free Lunch in the Forest: Functionally-Identical Pruning of Boosted Tree Ensemblescited by 4
  4. 2025T'yr-the-Pruner: Structural Pruning LLMs via Global Sparsity Distribution Optimizationcited by 4
  5. 2025HASSLE-free: A unified Framework for Sparse plus Low-Rank Matrix Decomposition for LLMscited by 3
  6. 2025RAP: Runtime Adaptive Pruning for LLM Inferencecited by 3
  7. 2025Scaling Up Efficient Small Language Models Serving and Deployment for Semantic Job Searchcited by 3
  8. 20263BASiL: An Algorithmic Framework for Sparse plus Low-Rank Compression of LLMscited by 3
  9. 2024Zeroth-Order Adaptive Neuron Alignment Based Pruning without Re-Trainingcited by 2
  10. 2025Scaling Down, Serving Fast: Compressing and Deploying Efficient LLMs for Recommendation Systemscited by 2
  11. 2026GRASPrune: Global Gating for Budgeted Structured Pruning of Large Language Modelscited by 2
  12. 2026Semantic Search At LinkedIncited by 1
6 more
  1. 2026Beyond Layer Importance in Layer-wise Sparsity: An Inter-Layer Perturbation-Absorption Perspectivecited by 1
  2. 2025TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Maskscited by 0
  3. 2025C-SWAP: Explainability-Aware Structured Pruning for Efficient Neural Networks Compressioncited by 0
  4. 2026PruneShift: A Framework for Evaluating Decision Reliability in Structured Pruningcited by 0
  5. 2026Output-aware Residual Stream Pruning for Large Language Modelscited by 0
  6. 2026Carve VFM: Carving Specialists out of Generalists, Automatic Task-Specific Compression of Vision Foundation Modelscited by 0