Natural Ungrokking: Asymmetric Control of Which Rules Survive Pretraining
Not on the map. Why?
Abstract (arXiv)
Midway through an ordinary pretraining run, a small language model learns the pronoun-gender rule: cued with a girl's name ("Sue cried because"), it resolves the next pronoun to she, generalizing to held-out probes (0.94 by step 925). By step 3,500 the same model scores near zero on the same probes, although the rule's evidence is still in the training data. We call this within-run reversal natural ungrokking: the corpus decides, with no trace in the loss curve, which learned rules a model keeps. Which rules survive is predictable from one corpus statistic: how often the training stream shows the rule winning. Across un-intervened runs (two corpora, three budgets, three seeds), support frequency decides a rule's fate; the data-to-parameter ratio only modulates how deeply a doomed rule falls. The same emerge-then-collapse dynamics appear in public Pythia checkpoints, collapse depth ordered by model scale as predicted. The forgetting is a displacement: a competing surface pattern out-competes the rule, and the log-probability margin between them crosses zero within 100 training steps of the behavioral collapse. Control over this fate is asymmetric: the same edit that destroys a rule on demand cannot restore it. Flipping support to counter-evidence in place kills the rule with monotone dose-response in two unrelated rules; but injecting support back, even to 450 times the level that naturally sustains it, buys no recovery. Every confirmatory threshold and prediction was pre-registered before the data it governed was read.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 35 of its 47 references that are in the map. First posted on arXiv 24 Jun 2026.
Builds on
35 of 47 references.
References · 35
- 2017Attention Is All You Needcited by 59,932
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
- 2022Training Compute-Optimal Large Language Modelscited by 2,927
- 2015Neural Machine Translation of Rare Words with Subword Unitscited by 2,898
- 2022Locating and Editing Factual Associations in GPTcited by 2,609
- 2022Emergent Abilities of Large Language Modelscited by 2,483
- 2024Gemma 2: Improving Open Language Models at a Practical Sizecited by 1,928
- 2023Progress measures for grokking via mechanistic interpretabilitycited by 822
- 2018An Empirical Study of Example Forgetting during Deep Neural Network Learningcited by 669
- 2018Gender Bias in Coreference Resolution: Evaluation and Debiasing Methodscited by 657
- 2022Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasetscited by 599
- 2024OLMo: Accelerating the Science of Language Modelscited by 599
23 more
- 2019BLiMP: The Benchmark of Linguistic Minimal Pairs for Englishcited by 553
- 2023Are Emergent Abilities of Large Language Models a Mirage?cited by 515
- 2022Large Language Models Struggle to Learn Long-Tail Knowledgecited by 452
- 2023TinyStories: How Small Can Language Models Be and Still Speak Coherent English?cited by 425
- 2023Scaling Data-Constrained Language Modelscited by 391
- 2022Towards Understanding Grokking: An Effective Theory of Representation Learningcited by 229
- 2022Memorization Without Overfitting: Analyzing the Training Dynamics of Large Language Modelscited by 218
- 2018Gender Bias in Neural Natural Language Processingcited by 210
- 2022Omnigrok: Grokking Beyond Algorithmic Datacited by 142
- 2023Sudden Drops in the Loss: Syntax Acquisition, Phase Transitions, and Simplicity Bias in MLMscited by 121
- 2022Measuring Forgetting of Memorized Training Examplescited by 118
- 2023Explaining grokking through circuit efficiencycited by 105
- 2023The Transient Nature of Emergent In-Context Learning in Transformerscited by 72
- 2024Language Models Learn Rare Phenomena from Less Rare Phenomena: The Case of the Missing AANNscited by 65
- 2025Nemotron-CLIMB: CLustering-based Iterative Data Mixture Bootstrapping for Language Model Pre-trainingcited by 62
- 2021Frequency Effects on Syntactic Rule Learning in Transformerscited by 59
- 2023Grokking of Hierarchical Structure in Vanilla Transformerscited by 53
- 2021Word Acquisition in Neural Language Modelscited by 41
- 2024Differentiation and Specialization of Attention Heads via the Refined Local Learning Coefficientcited by 39
- 2021The Grammar-Learning Trajectories of Neural Language Modelscited by 36
- 2024Filtered Corpus Training (FiCT) Shows that Language Models can Generalize from Indirect Evidencecited by 35
- 2023Characterizing Learning Curves During Language Model Pre-Training: Learning, Forgetting, and Stabilitycited by 34
- 2025How do language models learn facts? Dynamics, curricula and hallucinationscited by 33
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026Decodable In-Context State and Model Output Across Training25 Sep 2026