Skip to content
AI Atlas
PaperActive

A Fragility Spectrum for Recursive Language-Model Training

arxiv.org/abs/2609.11149

Updated 4 h ago · first seen 11 Sept 2026

paper_01M294FQMZ0EWCFGZNWFKA4CDT

Published
11 Sept 2026
T1 · 4 h ago
arXiv
2609.11149
T1 · 4 h ago
Category
cs.CL
T1 · 4 h ago

As of

Rewind the record: see this entity's attributes exactly as AI Atlas knew them on a given day.

Claim history

10 claims · 9 properties

Official pageofficial_url1

Claim history for Official page
ValueValid from → toStatusSourceConfidenceExtractor
https://arxiv.org/abs/2609.11149currentcurrentarXiv (Atom API + RSS)T1highdeterministic

Abstractabstract1

Claim history for Abstract
ValueValid from → toStatusSourceConfidenceExtractor
Model-generated text is finding its way back into training corpora, and there is plenty of evidence that training on such data over and over collapses output diversity. Prior work has studied the phenomenon itself: which protocols and which data mixtures cause collapse. But different models behave very differently under the same process. We fix one recursive contamination protocol and let 13 publicly released checkpoints form an ecosystem that shares a common corpus for five generations. The unique 4-gram outcome after five generations ranges from 0.187 to 0.940 across checkpoints, a roughly five-fold spread: some models are barely touched, others degenerate into repetitive fragments. Changing the composition of the shared pool or mixing in human text keeps the Spearman correlation of the ordering at 0.91--0.97, and changing the random seed keeps it at 0.93--0.98. Whether a model collapses easily under recursive training is, then, a property of the checkpoint itself, and one that has gone largely unexamined. Parameter scale alone does not explain it, since a three-size ladder within one family is not monotonic in size, and none of the static indicators we tested predicts it either. What does work is cheap: let a model iterate on its own output for two or three generations, and its fragility in the larger ecosystem can be inferred from that alone. Collapse speed also responds to intervention. Tightening top-p, which cuts the low-probability tail at generation time, nearly stops collapse within three generations and stabilizes six checkpoints spanning the whole spectrum together, while data-side filtering slows collapse without stopping it.currentcurrentarXiv (Atom API + RSS)T1highdeterministic

Arxiv announce typearxiv_announce_type2

Claim history for Arxiv announce type
ValueValid from → toStatusSourceConfidenceExtractor
newcurrentcurrentarXiv (Atom API + RSS)T1highdeterministic
crosssupersededarXiv (Atom API + RSS)T1highdeterministic

arXiv idarxiv_id1

Claim history for arXiv id
ValueValid from → toStatusSourceConfidenceExtractor
2609.11149currentcurrentarXiv (Atom API + RSS)T1highdeterministic

Authorsauthors1

Claim history for Authors
ValueValid from → toStatusSourceConfidenceExtractor
Yangze Liu, Zhongyi HancurrentcurrentarXiv (Atom API + RSS)T1highdeterministic

Categoriescategories1

Claim history for Categories
ValueValid from → toStatusSourceConfidenceExtractor
cs.CL, cs.AI, cs.LGcurrentcurrentarXiv (Atom API + RSS)T1highdeterministic

PDFpdf_url1

Claim history for PDF
ValueValid from → toStatusSourceConfidenceExtractor
https://arxiv.org/pdf/2609.11149currentcurrentarXiv (Atom API + RSS)T1highdeterministic

Primary categoryprimary_category1

Claim history for Primary category
ValueValid from → toStatusSourceConfidenceExtractor
cs.CLcurrentcurrentarXiv (Atom API + RSS)T1highdeterministic

Publishedpublished_at1

Claim history for Published
ValueValid from → toStatusSourceConfidenceExtractor
11 Sept 2026currentcurrentarXiv (Atom API + RSS)T1highdeterministic

Claims are temporal and append-only: a new observation closes the previous claim (valid_to) instead of overwriting it. Conflicting claims from different sources are kept side by side and flagged — never averaged. Methodology →