Pith. sign in

REVIEW 3 cited by

Accelerating Transformer Pre-training with 2:4 Sparsity

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2404.01847 v3 pith:MEAED32T submitted 2024-04-02 cs.LG

classification cs.LG
keywords trainingpre-trainingdensetransformeraccelerateacceleratingdecaysparse
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Amber Pruner: Leveraging N:M Activation Sparsity for Efficient Prefill in Large Language Models

    cs.LG 2025-08 unverdicted novelty 6.0 of 10

    Amber Pruner proposes training-free N:M activation sparsity for LLM prefill; however, the supplied manuscript body is an unrelated paper.

  2. Dynamic Sparse Training of Diagonally Sparse Networks

    cs.LG 2025-06 conditional novelty 6.0 of 10

    A dynamic sparse training method that restricts weights to a learnable set of diagonals, preserving sparsity in both forward and backward passes to obtain GPU speedups at accuracy close to unstructured sparsity.

  3. TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks

    cs.LG 2025-05 conditional novelty 6.0 of 10

    TSENOR computes transposable N:M masks up to hundreds of times faster than prior solvers by combining entropy-regularized optimal transport with a greedy plus local search rounding.

Pith tools