Saved in:
Bibliographic Details
Main Authors: Fehlauer, Finlay, Mahowald, Kyle, Pimentel, Tiago
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2509.26643
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866916980456423424
author Fehlauer, Finlay
Mahowald, Kyle
Pimentel, Tiago
author_facet Fehlauer, Finlay
Mahowald, Kyle
Pimentel, Tiago
contents In this paper, we investigate the convergence of language models (LMs) trained under different random seeds, measuring convergence as the expected per-token Kullback--Leibler (KL) divergence across seeds. By comparing LM convergence as a function of model size and training checkpoint, we identify a four-phase convergence pattern: (i) an initial uniform phase, (ii) a sharp-convergence phase, (iii) a sharp-divergence phase, and (iv) a slow-reconvergence phase. Further, we observe that larger models reconverge faster in later training stages, while smaller models never actually reconverge; these results suggest that a certain model size may be necessary to learn stable distributions. Restricting our analysis to specific token frequencies or part-of-speech (PoS) tags further reveals that convergence is uneven across linguistic categories: frequent tokens and function words converge faster and more reliably than their counterparts (infrequent tokens and content words). Overall, our findings highlight factors that influence the stability of the learned distributions in model training.
format Preprint
id arxiv_https___arxiv_org_abs_2509_26643
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Convergence and Divergence of Language Models under Different Random Seeds
Fehlauer, Finlay
Mahowald, Kyle
Pimentel, Tiago
Computation and Language
Machine Learning
In this paper, we investigate the convergence of language models (LMs) trained under different random seeds, measuring convergence as the expected per-token Kullback--Leibler (KL) divergence across seeds. By comparing LM convergence as a function of model size and training checkpoint, we identify a four-phase convergence pattern: (i) an initial uniform phase, (ii) a sharp-convergence phase, (iii) a sharp-divergence phase, and (iv) a slow-reconvergence phase. Further, we observe that larger models reconverge faster in later training stages, while smaller models never actually reconverge; these results suggest that a certain model size may be necessary to learn stable distributions. Restricting our analysis to specific token frequencies or part-of-speech (PoS) tags further reveals that convergence is uneven across linguistic categories: frequent tokens and function words converge faster and more reliably than their counterparts (infrequent tokens and content words). Overall, our findings highlight factors that influence the stability of the learned distributions in model training.
title Convergence and Divergence of Language Models under Different Random Seeds
topic Computation and Language
Machine Learning
url https://arxiv.org/abs/2509.26643