mlsanityData to 14 Oct 2026

STEP: Learning N:M Structured Sparsity Masks from Scratch with Precondition

arXiv 2302.01172 ↗First posted 2 Feb 2023cs.LGcited by 26

Not on the map. Why?

Abstract (arXiv)

Recent innovations on hardware (e.g. Nvidia A100) have motivated learning N:M structured sparsity masks from scratch for fast model inference. However, state-of-the-art learning recipes in this regime (e.g. SR-STE) are proposed for non-adaptive optimizers like momentum SGD, while incurring non-trivial accuracy drop for Adam-trained models like attention-based LLMs. In this paper, we first demonstrate such gap origins from poorly estimated second moment (i.e. variance) in Adam states given by the masked weights. We conjecture that learning N:M masks with Adam should take the critical regime of variance estimation into account. In light of this, we propose STEP, an Adam-aware recipe that learns N:M masks with two phases: first, STEP calculates a reliable variance estimate (precondition phase) and subsequently, the variance remains fixed and is used as a precondition to learn N:M masks (mask-learning phase). STEP automatically identifies the switching point of two phases by dynamically sampling variance changes over the training trajectory and testing the sample concentration. Empirically, we evaluate STEP and other baselines such as ASP and SR-STE on multiple tasks including CIFAR classification, machine translation and LLM fine-tuning (BERT-Base, GPT-2). We show STEP mitigates the accuracy drop of baseline recipes and is robust to aggressive structured sparsity ratios.

Key facts. Cited by 26 papers in the map (data through 14 Oct 2026). Builds on 34 of its 51 references that are in the map. First posted on arXiv 2 Feb 2023.

Builds on

34 of 51 references.

References · 34

  1. 2017Attention Is All You Needcited by 60,361
  2. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  3. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  4. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  5. 2020Language Models are Few-Shot Learnerscited by 32,419
  6. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  7. 2021Swin Transformer: Hierarchical Vision Transformer using Shifted Windowscited by 12,139
  8. 2016Densely Connected Convolutional Networkscited by 6,720
  9. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,899
  10. 2016Pointer Sentinel Mixture Modelscited by 3,096
  11. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
  12. 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,079
22 more
  1. 2016Pruning Filters for Efficient ConvNetscited by 1,143
  2. 2020On Layer Normalization in the Transformer Architecturecited by 922
  3. 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 812
  4. 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 702
  5. 2022Using DeepSpeed and Megatron to Train Megatron-Turing NLG 530B, A Large-Scale Generative Language Modelcited by 559
  6. 2016Learning Structured Sparsity in Deep Neural Networkscited by 541
  7. 2019Rigging the Lottery: Making All Tickets Winnerscited by 495
  8. 2021Accelerating Sparse Deep Neural Networkscited by 223
  9. 2018Gradient Descent Happens in a Tiny Subspacecited by 217
  10. 2020Understanding the Difficulty of Training Transformerscited by 210
  11. 2021Learning N:M Fine-grained Structured Sparse Neural Networks From Scratchcited by 179
  12. 2020The Break-Even Point on Optimization Trajectories of Deep Neural Networkscited by 150
  13. 2022Adam Can Converge Without Any Modification On Update Rulescited by 114
  14. 2021Accelerated Sparse Neural Training: A Provable and Efficient Method to Find N:M Transposable Maskscited by 103
  15. 2018On the Relation Between the Sharpest Directions of DNN Loss and the SGD Step Lengthcited by 88
  16. 20211-bit Adam: Communication Efficient Large-Scale Training with Adam's Convergence Speedcited by 75
  17. 2022An Algorithm-Hardware Co-Optimized Framework for Accelerating N:M Sparse Transformerscited by 29
  18. 20211-bit LAMB: Communication Efficient Large-Scale Large-Batch Training with LAMB's Convergence Speedcited by 24
  19. 2021NxMTransformer: Semi-Structured Sparsification for Natural Language Understanding via ADMMcited by 19
  20. 2022Maximizing Communication Efficiency for Large-scale Training via 0/1 Adamcited by 15
  21. 2022Training Recipe for N:M Structured Sparsity with Decaying Pruning Maskcited by 11
  22. 2020APMSqueeze: A Communication Efficient Adam-Preconditioned Momentum SGD Algorithmcited by 6

Built on by

Cited by year (2026 to 14 Oct)

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

26 papers.

Sort:

By area:

  1. 2024MaskLLM: Learnable Semi-Structured Sparsity for Large Language Modelscited by 50
  2. 2023Scaling Laws for Sparsely-Connected Foundation Modelscited by 43
  3. 2023Lookahead: An Inference Acceleration Framework for Large Language Model with Lossless Generation Accuracycited by 37
  4. 2024SLoPe: Double-Pruned Sparse Plus Lazy Low-Rank Adapter Pretraining of LLMscited by 20
  5. 2024Pruning Large Language Models with Semi-Structural Adaptive Sparse Trainingcited by 20
  6. 2024Accelerating Transformer Pre-training with 2:4 Sparsitycited by 19
  7. 2024Effective Interplay between Sparsity and Quantization: From Theory to Practicecited by 19
  8. 2024Progressive Gradient Flow for Robust N:M Sparsity Training in Transformerscited by 18
  9. 2024SLiM: One-shot Quantization and Sparsity with Low-rank Approximation for LLM Weight Compressioncited by 12
  10. 2023Accurate Neural Network Pruning Requires Rethinking Sparse Optimizationcited by 10
  11. 2025SparseLoRA: Accelerating LLM Fine-Tuning with Contextual Sparsitycited by 9
  12. 2024S-STE: Continuous Pruning Function for Efficient 2:4 Sparse Pre-trainingcited by 7
14 more
  1. 2026Cut Less, Fold More: Model Compression through the Lens of Projection Geometrycited by 4
  2. 2024ELSA: Exploiting Layer-wise N:M Sparsity for Vision Transformer Accelerationcited by 2
  3. 2024Beyond 2:4: exploring V:N:M sparsity for efficient transformer inference on GPUscited by 2
  4. 2025The Journey Matters: Average Parameter Count over Pre-training Unifies Sparse and Dense Scaling Lawscited by 2
  5. 2026L3: Large Lookup Layerscited by 2
  6. 2025MaskPro: Linear-Space Probabilistic Learning for Strict (N:M)-Sparsity on LLMscited by 1
  7. 2025PermLLM: Learnable Channel Permutation for N:M Sparse Large Language Modelscited by 1
  8. 2025Sparse by Rule: Probability-Based N:M Pruning for Spiking Neural Networkscited by 1
  9. 2026Rethinking Depth Pruning for Vision Transformers: A Heterogeneity-Aware Perspectivecited by 1
  10. 2025TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Maskscited by 0
  11. 2025Extreme Model Compression with Structured Sparsity at Low Precisioncited by 0
  12. 2026Learnable Permutation for Structured Sparsity on Transformer Modelscited by 0
  13. 2026ELAS: Efficient Pre-Training of Low-Rank Large Language Models via 2:4 Activation Sparsitycited by 0
  14. 2026Compression Trinity: Exploring Sparsity, Quantization, and Low-Rank Approximations for LLM Compressioncited by 0