mlsanityData to 14 Oct 2026

Accelerating Transformer Pre-training with 2:4 Sparsity

arXiv 2404.01847 ↗First posted 2 Apr 2024cs.LGcited by 19

Not on the map. Why?

Abstract (arXiv)

Training large transformers is slow, but recent innovations on GPU architecture give us an advantage. NVIDIA Ampere GPUs can execute a fine-grained 2:4 sparse matrix multiplication twice as fast as its dense equivalent. In the light of this property, we comprehensively investigate the feasibility of accelerating feed-forward networks (FFNs) of transformers in pre-training. First, we define a ``flip rate'' to monitor the stability of a 2:4 training process. Utilizing this metric, we propose three techniques to preserve accuracy: to modify the sparse-refined straight-through estimator by applying the masked decay term on gradients, to determine a feasible decay factor in warm-up stage, and to enhance the model's quality by a dense fine-tuning procedure near the end of pre-training. Besides, we devise two techniques to practically accelerate training: to calculate transposable 2:4 masks by convolution, and to accelerate gated activation functions by reducing GPU L2 cache miss. Experiments show that our 2:4 sparse training algorithm achieves similar convergence to dense training algorithms on several transformer pre-training tasks, while actual acceleration can be observed on different shapes of transformer block apparently. Our toolkit is available at https://github.com/huyz2023/2by4-pretrain.

Key facts. Cited by 19 papers in the map (data through 14 Oct 2026). Builds on 25 of its 42 references that are in the map. First posted on arXiv 2 Apr 2024.

Builds on

25 of 42 references.

References · 25

  1. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
  2. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
  3. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,899
  4. 2020Training data-efficient image transformers & distillation through attentioncited by 4,586
  5. 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,329
  6. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
  7. 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,079
  8. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
  9. 2020GLU Variants Improve Transformercited by 1,804
  10. 2019fairseq: A Fast, Extensible Toolkit for Sequence Modelingcited by 1,488
  11. 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 812
  12. 2019Rigging the Lottery: Making All Tickets Winnerscited by 495
13 more
  1. 2023LLM-Adapters: An Adapter Family for Parameter-Efficient Fine-Tuning of Large Language Modelscited by 324
  2. 2020The Lottery Ticket Hypothesis for Pre-trained BERT Networkscited by 275
  3. 2021Accelerating Sparse Deep Neural Networkscited by 223
  4. 2021Learning N:M Fine-grained Structured Sparse Neural Networks From Scratchcited by 179
  5. 2019Drawing Early-Bird Tickets: Towards More Efficient Training of Deep Networkscited by 160
  6. 2021Accelerated Sparse Neural Training: A Provable and Efficient Method to Find N:M Transposable Maskscited by 103
  7. 2022Cramming: Training a Language Model on a Single GPU in One Daycited by 81
  8. 2020EarlyBERT: Efficient BERT Training via Early-bird Lottery Ticketscited by 79
  9. 2013Estimating or Propagating Gradients Through Stochastic Neuronscited by 55
  10. 2023STEP: Learning N:M Structured Sparsity Masks from Scratch with Preconditioncited by 26
  11. 2020Go Wide, Then Narrow: Efficient Training of Deep Thin Networkscited by 12
  12. 2022Minimum Variance Unbiased N:M Sparsity for the Neural Gradientscited by 9
  13. 2022Accelerating DNN Training with Structured Data Gradient Pruningcited by 8

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 4; 2025: 10; 2026: 5.

19 papers.

Sort:

By area:

  1. 2025CoLA: Compute-Efficient Pre-Training of LLMs via Low-Rank Activationcited by 28
  2. 2024SLoPe: Double-Pruned Sparse Plus Lazy Low-Rank Adapter Pretraining of LLMscited by 20
  3. 2024Pruning Large Language Models with Semi-Structural Adaptive Sparse Trainingcited by 20
  4. 2024SparseDM: Toward Sparse Efficient Diffusion Modelscited by 18
  5. 2025SAGE: A Framework of Precise Retrieval for RAGcited by 8
  6. 2024S-STE: Continuous Pruning Function for Efficient 2:4 Sparse Pre-trainingcited by 7
  7. 2025Dynamic Sparse Training of Diagonally Sparse Networkscited by 4
  8. 2025BLaST: High Performance Inference and Pretraining using BLock Sparse Transformerscited by 3
  9. 2025Changing Base Without Losing Pace: A GPU-Efficient Alternative to MatMul in DNNscited by 2
  10. 2025ARMOR: High-Performance Semi-Structured Pruning via Adaptive Matrix Factorizationcited by 2
  11. 2025From 2:4 to 8:16 sparsity patterns in LLMs for Outliers and Weights with Variance Correctioncited by 1
  12. 2025LinDeps: A Fine-tuning Free Post-Pruning Method to Remove Layer-Wise Linear Dependencies with Guaranteed Performance Preservationcited by 1
7 more
  1. 2025Motivating Next-Gen Accelerators with Flexible (N:M) Activation Sparsity via Benchmarking Lightweight Post-Training Sparsification Approachescited by 1
  2. 2026DLR: Zero-Inference-Cost Latent Residuals for Low-Rank Pre-Trainingcited by 1
  3. 2025TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Maskscited by 0
  4. 2026To 2:4 Sparsity and Beyond: Neuron-level Activation Function to Accelerate LLM Pre-Trainingcited by 0
  5. 2026ELAS: Efficient Pre-Training of Low-Rank Large Language Models via 2:4 Activation Sparsitycited by 0
  6. 2026HiFloat4 Format for End-To-End Reinforcement Learning Post-Training of Large Language Modelscited by 0
  7. 2026BARTER: Compact Dynamic Sparse Training with Standard Dense Kernelscited by 0