mlsanityData to 7 Oct 2026

Critical Windows of Complexity Control: When Transformers Decide to Reason or Memorize

arXiv 2605.04396 ↗First posted 6 May 2026cs.LG cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

Recent work has shown that Transformers' compositional generalization is governed by complexity control, initialization scale and weight decay, which steers training toward low-complexity reasoning solutions rather than high-complexity memorization. Existing analyses, however, treat complexity control as a single static hyperparameter choice, leaving open when during training this control is actually decisive. We show that the memorization-versus-reasoning fate of a Transformer is determined within a sharp, identifiable window of training. On a controlled compositional task we find that (i)~weight decay applied for a single 25%-of-training window matches full-training weight decay in out-of-distribution (OOD) accuracy (0.93 vs 0.91); (ii)~holding total regularization budget constant, placing it in the middle of training yields 5-9× higher OOD accuracy than placing it early; (iii)~the boundary of the critical window is remarkably sharp, window onset shifted by as little as 100 optimization steps causes mean OOD to jump from chance (0.15) to reasoning-regime (0.61); (iv)~the window's position depends systematically on initialization scale, but the basin of attraction for reasoning solutions shrinks at small initialization, contradicting the prevailing recommendation that smaller initialization is uniformly better. We further show that the critical-window phenomenon is task-specific: it does not appear on grokking with modular arithmetic, where properly tuned constant weight decay matches scheduled weight decay.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 21 of its 26 references that are in the map. First posted on arXiv 6 May 2026.

Builds on

21 of 26 references.

References · 21

  1. 2017Attention Is All You Needcited by 59,932
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  3. 2023Progress measures for grokking via mechanistic interpretabilitycited by 822
  4. 2022Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasetscited by 599
  5. 2017Exploring Generalization in Deep Learningcited by 595
  6. 2018On the Global Convergence of Gradient Descent for Over-parameterized Models using Optimal Transportcited by 422
  7. 2019Implicit Regularization in Deep Matrix Factorizationcited by 402
  8. 2017Implicit Regularization in Matrix Factorizationcited by 318
  9. 2020Kernel and Rich Regimes in Overparametrized Modelscited by 302
  10. 2022Omnigrok: Grokking Beyond Algorithmic Datacited by 142
  11. 2019Time Matters in Regularizing Deep Networks: Weight Decay and Data Augmentation Affect Early Learning Dynamics, Matter Little Near Convergencecited by 54
  12. 2021Towards Understanding the Condensation of Neural Networks at Initial Trainingcited by 31
9 more
  1. 2024Out-of-distribution generalization via composition: a lens through induction heads in Transformerscited by 28
  2. 2025Complexity Control Facilitates Reasoning-Based Compositional Generalization in Transformerscited by 19
  3. 2025Grokking Beyond the Euclidean Norm of Model Parameterscited by 14
  4. 2023Critical Learning Periods Emerge Even in Deep Linear Networkscited by 13
  5. 2025An Analysis for Reasoning Bias of Language Models with Small Initializationcited by 13
  6. 2025An overview of condensation phenomenon in deep learningcited by 13
  7. 2025From Condensation to Rank Collapse: A Two-Stage Analysis of Transformer Training Dynamicscited by 9
  8. 2025An explainable transformer circuit for compositional generalizationcited by 8
  9. 2023Understanding the Initial Condensation of Convolutional Neural Networkscited by 7

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.