CAST: Continuous and Differentiable Semi-Structured Sparsity-Aware Training for Large Language Models
Not on the map. Why?
Abstract (arXiv)
Sparsity-aware training is an effective approach for transforming large language models (LLMs) into hardware-friendly sparse patterns, thereby reducing latency and memory consumption during inference. In this paper, we propose Continuous Adaptive Sparse Trainer (CAST), a fully continuous and differentiable sparsity-aware training framework for semi-structured (or "N:M") sparse models. Unlike previous approaches that optimize sparsity patterns and weights separately, CAST enables seamless joint optimization during training, while progressively transforming the model into the desired sparsity format. Specifically, CAST introduces three key components: 1) AdamS, a sparsity-aware optimizer that leverages adaptive L1 decay to promote uniform sparsification across all parameters; 2) Weight Scaling, a module designed to mitigate the magnitude reduction caused by decay while preserving desired sparsity patterns; 3) Knowledge Distillation, which employs the dense model as a self-teacher to enhance training efficiency. We evaluate CAST under 2:4 sparsity patterns across multiple model families, ranging from 125M to 13B parameters. Our results demonstrate significant improvements over previous state-of-the-art methods in both perplexity and zero-shot accuracy with minimal training resources. Notably, on LLaMA2-7B, our 2:4 sparse model achieves a negligible perplexity increase of 0.09 and a 0.36% gain in zero-shot accuracy compared to the dense model using only 2% of the original pretraining tokens. Additionally, we establish an accurate and robust empirical scaling law to predict sparse model performance given adequate training resources. Finally, we demonstrate the practical applicability of our sparse models by evaluating them under quantization and fine-tuning scenarios.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 46 of its 60 references that are in the map. First posted on arXiv 30 Sep 2025.
Builds on
46 of 60 references.
References · 46
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2024The Llama 3 Herd of Modelscited by 14,715
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
- 2021Training Verifiers to Solve Math Word Problemscited by 10,109
- 2020Measuring Massive Multitask Language Understandingcited by 7,963
- 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,371
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
- 2022OPT: Open Pre-trained Transformer Language Modelscited by 3,512
- 2022Training Compute-Optimal Large Language Modelscited by 3,019
- 2017TriviaQA: A Large Scale Distantly Supervised Challenge Dataset for Reading Comprehensioncited by 2,955
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
34 more
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,329
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
- 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,183
- 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,164
- 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,079
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
- 2018CommonsenseQA: A Question Answering Challenge Targeting Commonsense Knowledgecited by 1,822
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
- 2017RACE: Large-scale ReAding Comprehension Dataset From Examinationscited by 861
- 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 812
- 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 800
- 2017Crowdsourcing Multiple Choice Science Questionscited by 765
- 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 676
- 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 603
- 2019Importance Estimation for Neural Network Pruningcited by 541
- 2021Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networkscited by 527
- 2019Rigging the Lottery: Making All Tickets Winnerscited by 495
- 2023Sheared LLaMA: Accelerating Language Model Pre-training via Structured Pruningcited by 415
- 2020Comparing Rewinding and Fine-tuning in Neural Network Pruningcited by 240
- 2016Dynamic Network Surgery for Efficient DNNscited by 233
- 2021Accelerating Sparse Deep Neural Networkscited by 223
- 2021Learning N:M Fine-grained Structured Sparse Neural Networks From Scratchcited by 179
- 2021Accelerated Sparse Neural Training: A Provable and Efficient Method to Find N:M Transposable Maskscited by 103
- 2024Scaling Laws for Precisioncited by 95
- 2023Dynamic Sparse No Training: Training-Free Fine-tuning for Sparse LLMscited by 61
- 2023UPop: Unified and Progressive Pruning for Compressing Vision-Language Transformerscited by 54
- 2024MaskLLM: Learnable Semi-Structured Sparsity for Large Language Modelscited by 50
- 2022Structural Pruning via Latency-Saliency Knapsackcited by 41
- 2022Unmasking the Lottery Ticket Hypothesis: What's Encoded in a Winning Ticket's Mask?cited by 38
- 2023Gradient-Free Structured Pruning with Unlabeled Datacited by 26
- 2024Pruning Large Language Models with Semi-Structural Adaptive Sparse Trainingcited by 20
- 2022GMP*: Well-Tuned Gradual Magnitude Pruning Can Outperform Most BERT-Pruning Methodscited by 15
- 2023A Three-regime Model of Network Pruningcited by 15
- 2022Are Straight-Through gradients and Soft-Thresholding all you need for Sparse Training?cited by 9
Built on by
Citing papers per year: 2026: 1.
1 paper.
Similar, not cited
Close in wording, no citation either way
- 2025R-Sparse: Rank-Aware Activation Sparsity for Efficient LLM Inference
- 2025Improving MLLM Training Efficiency via Stage-Aware Sparsity
- 2026Sparse-BitNet: 1.58-bit LLMs are Naturally Friendly to Semi-Structured Sparsity
- 2024Parameter-Efficient Sparsity Crafting from Dense to Mixture-of-Experts for Instruction Tuning on General Tasks
- 2026WiSparse: Boosting LLM Inference Efficiency with Weight-Aware Mixed Activation Sparsity
- 2024Q-Sparse: All Large Language Models can be Fully Sparsely-Activated
- 2026Sparsity-Aware Low-Rank Representation for Efficient Fine-Tuning of Large Language Models
- 2023Sparse Fine-tuning for Inference Acceleration of Large Language Models