mlsanityData to 7 Oct 2026

Pruning Large Language Models with Semi-Structural Adaptive Sparse Training

arXiv 2407.20584 ↗First posted 30 Jul 2024cs.CL cs.AIcited by 20

Not on the map. Why?

Abstract (arXiv)

The remarkable success of Large Language Models (LLMs) relies heavily on their substantial scale, which poses significant challenges during model deployment in terms of latency and memory consumption. Recently, numerous studies have attempted to compress LLMs using one-shot pruning methods. However, these methods often suffer from considerable performance degradation on complex language understanding tasks, raising concerns about the feasibility of pruning in LLMs. To address this issue, we propose Adaptive Sparse Trainer (AST), a novel and efficient retraining framework tailored for semi-structured sparse models. AST enables models to learn optimal masks during the weight update process without incurring additional computational overhead. Furthermore, we demonstrate that incorporating knowledge distillation significantly improves retraining efficiency and enhances model performance under fixed computational constraints. Additionally, a supplementary set of well-initialized parameters is integrated to further augment the model's efficacy. AST achieves state-of-the-art performance with minimal training cost. When applied to the LLaMA2-7B model, AST reduces the perplexity and zero-shot accuracy gap between dense and 2:4 semi-structured sparse models to 0.6 and 1.16%, respectively, utilizing less than 0.4% of the pretraining tokens and GPU hours. Our work demonstrates the feasibility of deploying semi-structured sparse LLMs and offers a promising alternative for achieving highly compressed models when combined with existing quantization techniques.

Key facts. Cited by 20 papers in the map (data through 7 Oct 2026). Builds on 48 of its 60 references that are in the map. First posted on arXiv 30 Jul 2024.

Builds on

48 of 60 references.

References · 48

  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. 2023GPT-4 Technical Reportcited by 18,132
  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 2: Open Foundation and Fine-Tuned Chat Modelscited by 12,865
  7. 2021Training Verifiers to Solve Math Word Problemscited by 9,743
  8. 2020Measuring Massive Multitask Language Understandingcited by 7,768
  9. 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,203
  10. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
  11. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
  12. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
36 more
  1. 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,590
  2. 2022OPT: Open Pre-trained Transformer Language Modelscited by 3,464
  3. 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
  4. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  5. 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,140
  6. 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,114
  7. 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,031
  8. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
  9. 2020Knowledge Distillation: A Surveycited by 1,578
  10. 2019TinyBERT: Distilling BERT for Natural Language Understandingcited by 1,153
  11. 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
  12. 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 802
  13. 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 776
  14. 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 673
  15. 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 596
  16. 2018Rethinking the Value of Network Pruningcited by 595
  17. 2019Importance Estimation for Neural Network Pruningcited by 531
  18. 2019Rigging the Lottery: Making All Tickets Winnerscited by 491
  19. 2020MobileBERT: a Compact Task-Agnostic BERT for Resource-Limited Devicescited by 476
  20. 2023Sheared LLaMA: Accelerating Language Model Pre-training via Structured Pruningcited by 408
  21. 2020Comparing Rewinding and Fine-tuning in Neural Network Pruningcited by 238
  22. 2019Structured Pruning of Large Language Modelscited by 201
  23. 2021Learning N:M Fine-grained Structured Sparse Neural Networks From Scratchcited by 177
  24. 2021Towards Understanding Knowledge Distillationcited by 158
  25. 2021Accelerated Sparse Neural Training: A Provable and Efficient Method to Find N:M Transposable Maskscited by 103
  26. 2023Dynamic Sparse No Training: Training-Free Fine-tuning for Sparse LLMscited by 61
  27. 2023Compressing LLMs: The Truth is Rarely Pure and Never Simplecited by 59
  28. 2023UPop: Unified and Progressive Pruning for Compressing Vision-Language Transformerscited by 51
  29. 2022Structural Pruning via Latency-Saliency Knapsackcited by 40
  30. 2022Unmasking the Lottery Ticket Hypothesis: What's Encoded in a Winning Ticket's Mask?cited by 38
  31. 2022SPDY: Accurate Pruning with Speedup Guaranteescited by 34
  32. 2023Gradient-Free Structured Pruning with Unlabeled Datacited by 26
  33. 2023STEP: Learning N:M Structured Sparsity Masks from Scratch with Preconditioncited by 25
  34. 2024Accelerating Transformer Pre-training with 2:4 Sparsitycited by 18
  35. 2023A Three-regime Model of Network Pruningcited by 15
  36. 2022GMP*: Well-Tuned Gradual Magnitude Pruning Can Outperform Most BERT-Pruning Methodscited by 14

Built on by

Cited by year (2026 to 7 Oct)

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

20 papers.

Sort:

By area:

  1. 2024SageAttention: Accurate 8-Bit Attention for Plug-and-play Inference Accelerationcited by 158
  2. 2025Ask in Any Modality: A Comprehensive Survey on Multimodal Retrieval-Augmented Generationcited by 42
  3. 2025UniCP: A Unified Caching and Pruning Framework for Efficient Video Generationcited by 13
  4. 2025ProxSparse: Regularized Learning of Semi-Structured Sparsity Masks for Pretrained LLMscited by 10
  5. 2025Optimal Brain Connection: Towards Efficient Structural Pruningcited by 3
  6. 2025TASO: Task-Aligned Sparse Optimization for Parameter-Efficient Model Adaptationcited by 3
  7. 2026Deterministic Differentiable Structured Pruning for Large Language Modelscited by 2
  8. 2024Beyond 2:4: exploring V:N:M sparsity for efficient transformer inference on GPUscited by 1
  9. 2025NoWag: A Unified Framework for Shape Preserving Compression of Large Language Modelscited by 1
  10. 2025Pruning General Large Language Models into Customized Expert Modelscited by 1
  11. 2025MaskPro: Linear-Space Probabilistic Learning for Strict (N:M)-Sparsity on LLMscited by 1
  12. 2025Amber Pruner: Leveraging N:M Activation Sparsity for Efficient Prefill in Large Language Modelscited by 1
8 more
  1. 2025CAST: Continuous and Differentiable Semi-Structured Sparsity-Aware Training for Large Language Modelscited by 1
  2. 2024Inducing Semi-Structured Sparsity by Masking for Efficient Model Inference in Convolutional Networkscited by 0
  3. 2025EGGS-PTP: An Expander-Graph Guided Structured Post-training Pruning Method for Large Language Modelscited by 0
  4. 2026Towards Compact and Robust DNNs via Compression-aware Sharpness Minimizationcited by 0
  5. 2026Topology-Aware Revival for Efficient Sparse Trainingcited by 0
  6. 2026SparseForge: Efficient Semi-Structured LLM Sparsification via Annealing of Hessian-Guided Soft-Maskcited by 0
  7. 2026RT-Lynx: Putting GEMM Sparsity in the Right Place for Diffusion Modelscited by 0
  8. 2026Reservoir of Importance: Learning Semi-Structured Sparsity with Differentiable Subset Samplingcited by 0