mlsanityData to 7 Oct 2026

Compresso: Structured Pruning with Collaborative Prompting Learns Compact Large Language Models

arXiv 2310.05015 ↗First posted 8 Oct 2023cs.AIcited by 19

Not on the map. Why?

Abstract (arXiv)

Despite the remarkable success of Large Language Models (LLMs), the massive size poses significant deployment challenges, particularly on resource-constrained hardware. While existing LLM compression methods focus on quantization, pruning remains relatively unexplored due to the high cost of training-based approaches and data collection challenges. One-shot pruning methods, although cost-effective and data-free, have become dominant in LLM pruning, but lead to performance decline under the structured pruning setting. In this work, we introduce a new paradigm for structurally pruning LLMs, called Compresso. Our approach, through the collaboration of the proposed resource-efficient pruning algorithm and the LLM itself, learns optimal pruning decisions during the training process. Compresso addresses the challenges of expensive training costs and data collection by incorporating Low-Rank Adaptation (LoRA) into the L0 regularization during the instruction tuning process. Then, we further augment the pruning algorithm by introducing a collaborative prompt that fosters collaboration between the LLM and the pruning algorithm, significantly boosting the overall performance. To this end, Compresso prunes LLaMA-7B to 5.4B, maintaining original performance and even surpassing LLaMA-7B in reading comprehension by 2.62%. Extensive experiments demonstrate that Compresso significantly outperforms one-shot pruning baselines across various sparsity ratios, achieving up to 2.21%, 11.43%, 7.04%, and 4.81% higher scores on the commonsense reasoning, reading comprehension, MMLU, and BBH benchmarks, respectively.

Key facts. Cited by 19 papers in the map (data through 7 Oct 2026). Builds on 55 of its 63 references that are in the map. First posted on arXiv 8 Oct 2023.

Builds on

55 of 63 references.

References · 55

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  2. 2020Language Models are Few-Shot Learnerscited by 32,199
  3. 2022Training language models to follow instructions with human feedbackcited by 15,712
  4. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
  5. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
  6. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 13,958
  7. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
  8. 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 12,865
  9. 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,302
  10. 2020Measuring Massive Multitask Language Understandingcited by 7,768
  11. 2022PaLM: Scaling Language Modeling with Pathwayscited by 5,304
  12. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
38 more
  1. 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,243
  2. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
  3. 2021Finetuned Language Models Are Zero-Shot Learnerscited by 3,747
  4. 2022OPT: Open Pre-trained Transformer Language Modelscited by 3,464
  5. 2022Scaling Instruction-Finetuned Language Modelscited by 2,997
  6. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
  7. 2019ALBERT: A Lite BERT for Self-supervised Learning of Language Representationscited by 2,772
  8. 2022Self-Instruct: Aligning Language Models with Self-Generated Instructionscited by 2,674
  9. 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,140
  10. 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,114
  11. 2022BLOOM: A 176B-Parameter Open-Access Multilingual Language Modelcited by 1,968
  12. 2022Challenging BIG-Bench Tasks and Whether Chain-of-Thought Can Solve Themcited by 1,767
  13. 2021Multitask Prompted Training Enables Zero-Shot Task Generalizationcited by 1,462
  14. 2022SmoothQuant: Accurate and Efficient Post-Training Quantization for Large Language Modelscited by 1,338
  15. 2023A Survey on Evaluation of Large Language Modelscited by 1,227
  16. 2019TinyBERT: Distilling BERT for Natural Language Understandingcited by 1,153
  17. 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
  18. 2020Exploiting Cloze Questions for Few Shot Text Classification and Natural Language Inferencecited by 934
  19. 2017RACE: Large-scale ReAding Comprehension Dataset From Examinationscited by 851
  20. 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 776
  21. 2023Instruction Tuning with GPT-4cited by 676
  22. 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 643
  23. 2023LLaMA-Adapter V2: Parameter-Efficient Visual Instruction Modelcited by 602
  24. 2017Learning Sparse Neural Networks through L0 Regularizationcited by 571
  25. 2022ZeroQuant: Efficient and Affordable Post-Training Quantization for Large-Scale Transformerscited by 517
  26. 2020Movement Pruning: Adaptive Sparsity by Fine-Tuningcited by 398
  27. 2019Q-BERT: Hessian Based Ultra Low Precision Quantization of BERTcited by 355
  28. 2022News Summarization and Evaluation in the Era of GPT-3cited by 324
  29. 2023LLM-QAT: Data-Free Quantization Aware Training for Large Language Modelscited by 320
  30. 2023LLM-Adapters: An Adapter Family for Parameter-Efficient Fine-Tuning of Large Language Modelscited by 317
  31. 2021I-BERT: Integer-only BERT Quantizationcited by 250
  32. 2019Structured Pruning of Large Language Modelscited by 201
  33. 2020Compressing BERT: Studying the Effects of Weight Pruning on Transfer Learningcited by 184
  34. 2021Block Pruning For Faster Transformerscited by 176
  35. 2022Structured Pruning Learns Compact and Accurate Modelscited by 167
  36. 2023Solving Challenging Math Word Problems Using GPT-4 Code Interpreter with Code-based Self-Verificationcited by 166
  37. 2021Learned Token Pruning for Transformerscited by 138
  38. 2021Accelerated Sparse Neural Training: A Provable and Efficient Method to Find N:M Transposable Maskscited by 103

50 most cited of 55 All 55 (JSON)

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 10; 2025: 6; 2026: 3.

19 papers.

Sort:

By area:

  1. 2024LLM Inference Unveiled: Survey and Roofline Model Insightscited by 147
  2. 2024Model Compression and Efficient Inference for Large Language Models: A Surveycited by 62
  3. 2024SlimGPT: Layer-wise Structured Pruning for Large Language Modelscited by 43
  4. 2024Everybody Prune Now: Structured Pruning of LLMs with only Forward Passescited by 42
  5. 2024SparseDM: Toward Sparse Efficient Diffusion Modelscited by 18
  6. 2024Read-ME: Refactorizing LLMs as Router-Decoupled Mixture of Experts with System Co-Designcited by 18
  7. 2024Beware of Calibration Data for Pruning Large Language Modelscited by 14
  8. 2025Dynamic Low-Rank Sparse Adaptation for Large Language Modelscited by 10
  9. 2024Bypass Back-propagation: Optimization-based Structural Pruning for Large Language Models via Policy Gradientcited by 6
  10. 2025PICE: A Semantic-Driven Progressive Inference System for LLM Serving in Cloud-Edge Networkscited by 5
  11. 2025Towards Alignment-Centric Paradigm: A Survey of Instruction Tuning in Large Language Modelscited by 5
  12. 2024Deploying Foundation Model Powered Agent Services: A Surveycited by 4
7 more
  1. 2024On-Device LLMs for SMEs: Challenges and Opportunitiescited by 2
  2. 2025Restoring Pruned Large Language Models via Lost Component Compensationcited by 2
  3. 2026Deterministic Differentiable Structured Pruning for Large Language Modelscited by 2
  4. 2026High-Fidelity Pruning for Large Language Modelscited by 1
  5. 2025CUT: Pruning Pre-Trained Multi-Task Models into Compact Models for Edge Devicescited by 0
  6. 2025SDMPrune: Self-Distillation MLP Pruning for Efficient Large Language Modelscited by 0
  7. 2026Resource-Efficient Pruning for Transformer via Low-Rank Importance Estimationcited by 0

Similar, not cited

Close in wording, no citation either way

  1. 2025Pruning Laws for Large Language Models
  2. 2025SPAP: Structured Pruning via Alternating Optimization and Penalty Methods
  3. 2025Automatic Pruning Discovery for Large Language Models
  4. 2025Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation
  5. 2025Investigating Structural Pruning and Recovery Techniques for Compressing Multimodal Large Language Models: An Empirical Study
  6. 2026MI-PRUN: Optimize Large Language Model Pruning via Mutual Information
  7. 2025RAP: Runtime Adaptive Pruning for LLM Inference
  8. 2025From Local to Global: Revisiting Structured Pruning Paradigms for Large Language Models