Pith. sign in

REVIEW 2 cited by

Early Weight Averaging meets High Learning Rates for LLM Pre-training

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 2306.03241 v2 pith:7DSU5DOO submitted 2023-06-05 cs.LG cs.AIcs.CL

classification cs.LGcs.AIcs.CL
keywords trainingaveragingcheckpointhighlargelearningllmsmodels
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Training Large Language Models (LLMs) incurs significant cost; hence, any strategy that accelerates model convergence is helpful. In this paper, we investigate the ability of a simple idea checkpoint averaging along the trajectory of a training run to improve both convergence and generalization quite early on during training. Here we show that models trained with high learning rates observe higher gains due to checkpoint averaging. Furthermore, these gains are amplified when checkpoints are sampled with considerable spacing in training steps. Our training recipe outperforms conventional training and popular checkpoint averaging baselines such as exponential moving average (EMA) and stochastic moving average (SWA). We evaluate our training recipe by pre-training LLMs, where high learning rates are inherently preferred due to extremely large batch sizes. Specifically, we pre-trained nanoGPT-2 models of varying sizes, small (125M), medium (335M), and large (770M)on the OpenWebText dataset, comprised of 9B tokens. Additionally, we present results for publicly available Pythia LLMs, ranging from 1B to 12B, which were trained on the PILE-deduped dataset containing 207B tokens.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Task Vector Bases: A Unified and Scalable Framework for Compressed Task Arithmetic

    cs.LG 2025-02 conditional novelty 6.0 of 10

    Task Vector Bases compresses T task vectors into M softmax-mixed basis vectors that preserve task arithmetic operations, with empirical gains over PCA and random selection.

  2. WSM: Decay-Free Learning Rate Schedule via Checkpoint Merging for LLM Pre-training

    cs.CL 2025-07 conditional novelty 5.0 of 10

    Checkpoint merging during constant-LR training can replace LR decay and yields improved LLM benchmark scores over Warmup-Stable-Decay.

Pith tools