mlsanityData to 14 Oct 2026

Unifying Depth and Width Pruning for LLMs via Binary Knapsack Optimization

arXiv 2608.12953 ↗First posted 13 Aug 2026cs.CL cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Structured pruning is a promising approach for compressing large language models (LLMs), yet existing methods rely heavily on greedy heuristics that produce myopic decisions, and often fail to precisely meet target compression budgets. We present SNIPER, a two-stage structured pruning framework that solves a knapsack optimization over coarse-granularity components to yield conditionally optimal parameter allocations with respect to fixed importance estimates, followed by a fine-grained pruning stage to meet strict budget constraints. We introduce the Compression Ratio Adherence Factor (CRAFT) to quantify budget fidelity, showing that while existing pruners deviate from target compression ratios by up to 33%, SNIPER achieves near-exact adherence with a CRAFT score of 0.98. Evaluations across four diverse architectures over a set of 18 tasks spanning five domains demonstrate SNIPER's consistent improvements in average performance retention and task-level stability over six state-of-the-art pruners. Across all pruning configurations, SNIPER achieves an excellent mean rank of 1.25, indicating its robust cross-architectural generalizability and excellent reliability.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 61 of its 72 references that are in the map. First posted on arXiv 13 Aug 2026.

Builds on

61 of 72 references.

References · 61

  1. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  2. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
  3. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
  4. 2015Distilling the Knowledge in a Neural Networkcited by 10,324
  5. 2025Qwen3 Technical Reportcited by 8,820
  6. 2024Qwen2.5 Technical Reportcited by 4,942
  7. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
  8. 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,418
  9. 2016Pointer Sentinel Mixture Modelscited by 3,096
  10. 2021TruthfulQA: Measuring How Models Mimic Human Falsehoodscited by 2,975
  11. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
  12. 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,183
38 more
  1. 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,164
  2. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
  3. 2018CommonsenseQA: A Question Answering Challenge Targeting Commonsense Knowledgecited by 1,822
  4. 2020What Disease does this Patient Have? A Large-scale Open Domain Question Answering Dataset from Medical Examscited by 1,356
  5. 2019TinyBERT: Distilling BERT for Natural Language Understandingcited by 1,167
  6. 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
  7. 2016The LAMBADA dataset: Word prediction requiring a broad discourse contextcited by 992
  8. 2019Analyzing Multi-Head Self-Attention: Specialized Heads Do the Heavy Lifting, the Rest Can Be Prunedcited by 856
  9. 2019Are Sixteen Heads Really Better than One?cited by 816
  10. 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 800
  11. 2024Phi-4 Technical Reportcited by 711
  12. 2018CoQA: A Conversational Question Answering Challengecited by 683
  13. 2019MathQA: Towards Interpretable Math Word Problem Solving with Operation-Based Formalismscited by 662
  14. 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 650
  15. 2019BLiMP: The Benchmark of Linguistic Minimal Pairs for Englishcited by 564
  16. 2018Gender Bias in Coreference Resolutioncited by 442
  17. 2024SliceGPT: Compress Large Language Models by Deleting Rows and Columnscited by 385
  18. 2024ShortGPT: Layers in Large Language Models are More Redundant Than You Expectcited by 383
  19. 2023Orca: Progressive Learning from Complex Explanation Traces of GPT-4cited by 379
  20. 2023A Survey on Model Compression for Large Language Modelscited by 269
  21. 2021I-BERT: Integer-only BERT Quantizationcited by 255
  22. 2024SVD-LLM: Truncation-aware Singular Value Decomposition for Large Language Model Compressioncited by 243
  23. 2024The Unreasonable Ineffectiveness of the Deeper Layerscited by 226
  24. 2021Accelerating Sparse Deep Neural Networkscited by 223
  25. 2022Language model compression with weighted low-rank factorizationcited by 195
  26. 2023ASVD: Activation-aware Singular Value Decomposition for Compressing Large Language Modelscited by 169
  27. 2020Moral Stories: Situated Reasoning about Norms, Intents, Actions, and their Consequencescited by 135
  28. 2024SLEB: Streamlining LLMs through Redundancy Verification and Elimination of Transformer Blockscited by 97
  29. 2023LLM-FP4: 4-Bit Floating-Point Quantized Transformerscited by 69
  30. 2019Efficient 8-Bit Quantization of Transformer Neural Machine Language Translation Modelcited by 59
  31. 2024Training-Free Activation Sparsity in Large Language Modelscited by 55
  32. 2021PROST: Physical Reasoning of Objects through Space and Timecited by 48
  33. 2023The LLM Surgeoncited by 38
  34. 2024Streamlining Redundant Layers to Compress Large Language Modelscited by 35
  35. 2023CBQ: Cross-Block Quantization for Large Language Modelscited by 34
  36. 2024APTQ: Attention-aware Post-Training Mixed-Precision Quantization for Large Language Modelscited by 34
  37. 2024A Survey of Small Language Modelscited by 31
  38. 2024Sparsing Law: Towards Large Language Models with Greater Activation Sparsitycited by 22

50 most cited of 61 All 61 (JSON)

Built on by

Not cited yet.