mlsanityData to 7 Oct 2026

Just CHOP: Embarrassingly Simple LLM Compression

arXiv 2305.14864 ↗First posted 24 May 2023cs.CLcited by 4

On the map: LLM reasoning → Test-time compute and efficient thinking

Abstract (arXiv)

Large language models (LLMs) enable unparalleled few- and zero-shot reasoning capabilities but at a high computational footprint. A growing assortment of methods for compression promises to reduce the computational burden of LLMs in deployment, but so far, only quantization approaches have been demonstrated to be effective for LLM compression while maintaining zero-shot performance. A critical step in the compression process, the pretrain-then-finetune paradigm, has largely been overlooked when adapting existing pruning strategies to LLMs or proposing new ones. In this work, we show that embarrassingly simple layer pruning coupled with an extended language model pretraining as the finetuning phase produces state-of-the-art results against structured and even semi-structured compression of models at a 7B scale while being more inference efficient. We call this method LayerChop, where we deterministically remove layers from a model followed by task-agnostic finetuning of the remaining weights by continued self-supervised pretraining. At this scale, we also show how distillation, which has been super effective in task-agnostic compression of smaller BERT-style models, becomes inefficient against our simple pruning technique.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Placed in Test-time compute and efficient thinking, one of 17 directions in LLM reasoning. Builds on 35 of its 52 references that are in the map. First posted on arXiv 24 May 2023.

Builds on

35 of 52 references.

References · 35

  1. 2017Attention Is All You Needcited by 59,932
  2. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
  3. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
  4. 2016Layer Normalizationcited by 5,579
  5. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
  6. 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,243
  7. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
  8. 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,611
  9. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
  10. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  11. 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,114
  12. 2020GLU Variants Improve Transformercited by 1,724
23 more
  1. 2017Decoupled Weight Decay Regularizationcited by 1,722
  2. 2020MiniLM: Deep Self-Attention Distillation for Task-Agnostic Compression of Pre-Trained Transformerscited by 1,414
  3. 2019TinyBERT: Distilling BERT for Natural Language Understandingcited by 1,153
  4. 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
  5. 2019Analyzing Multi-Head Self-Attention: Specialized Heads Do the Heavy Lifting, the Rest Can Be Prunedcited by 844
  6. 2019Are Sixteen Heads Really Better than One?cited by 803
  7. 2016Sequence-Level Knowledge Distillationcited by 761
  8. 2017Crowdsourcing Multiple Choice Science Questionscited by 742
  9. 2023Scaling Vision Transformers to 22 Billion Parameterscited by 690
  10. 2019Patient Knowledge Distillation for BERT Model Compressioncited by 502
  11. 2021Documenting Large Webtext Corpora: A Case Study on the Colossal Clean Crawled Corpuscited by 481
  12. 2020MobileBERT: a Compact Task-Agnostic BERT for Resource-Limited Devicescited by 476
  13. 2019Reducing Transformer Depth on Demand with Structured Dropoutcited by 434
  14. 2020Movement Pruning: Adaptive Sparsity by Fine-Tuningcited by 398
  15. 2020The Lottery Ticket Hypothesis for Pre-trained BERT Networkscited by 275
  16. 2020DynaBERT: Dynamic BERT with Adaptive Width and Depthcited by 246
  17. 2020MiniLMv2: Multi-Head Self-Attention Relation Distillation for Compressing Pretrained Transformerscited by 240
  18. 2020Characterising Bias in Compressed Modelscited by 162
  19. 2019Distilling Task-Specific Knowledge from BERT into Simple Neural Networkscited by 152
  20. 2022PLATON: Pruning Large Transformer Models with Upper Confidence Bound of Weight Importancecited by 79
  21. 2021Differentiable Subset Pruning of Transformer Headscited by 46
  22. 2021XtremeDistilTransformers: Task Transfer for Task-agnostic Distillationcited by 18
  23. 2022Training Recipe for N:M Structured Sparsity with Decaying Pruning Maskcited by 10

Built on by

Cited by year

Citing papers per year: 2024: 1; 2025: 3.

4 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2024Streamlining Redundant Layers to Compress Large Language Models
  2. 2025MaskPrune: Mask-based LLM Pruning for Layer-wise Uniform Structures
  3. 2025Pruning Laws for Large Language Models
  4. 2023LLMLingua: Compressing Prompts for Accelerated Inference of Large Language Models
  5. 2025E3-Pruner: Towards Efficient, Economical, and Effective Layer Pruning for Large Language Models
  6. 2026Gradually Compacting Large Language Models for Reasoning Like a Boiling Frog
  7. 2024Compressing Large Language Models with Automated Sub-Network Search
  8. 2025Optimizing LLMs for Resource-Constrained Environments: A Survey of Model Compression Techniques