mlsanityData to 7 Oct 2026

The Geometry of Multi-Task Grokking: Transverse Instability, Superposition, and Weight Decay Phase Structure

arXiv 2602.18523 ↗First posted 19 Feb 2026cs.LG cs.AIcited by 8

Not on the map. Why?

Abstract (arXiv)

Grokking -- the abrupt transition from memorization to generalization long after near-zero training loss -- has been studied mainly in single-task settings. We extend geometric analysis to multi-task modular arithmetic, training shared-trunk Transformers on dual-task (mod-add + mod-mul) and tri-task (mod-add + mod-mul + mod-sq) objectives across a systematic weight decay sweep. Five consistent phenomena emerge. (1) Staggered grokking order: multiplication generalizes first, followed by squaring, then addition, with consistent delays across seeds. (2) Universal integrability: optimization trajectories remain confined to an empirically invariant low-dimensional execution manifold; commutator defects orthogonal to this manifold reliably precede generalization. (3) Weight decay phase structure: grokking timescale, curvature depth, reconstruction threshold, and defect lead covary systematically with weight decay, revealing distinct dynamical regimes and a sharp no-decay failure mode. (4) Holographic incompressibility: final solutions occupy only 4--8 principal trajectory directions yet are distributed across full-rank weights and destroyed by minimal perturbations; SVD truncation, magnitude pruning, and uniform scaling all fail to preserve performance. (5) Transverse fragility and redundancy: removing less than 10% of orthogonal gradient components eliminates grokking, yet dual-task models exhibit partial recovery under extreme deletion, suggesting redundant center manifolds enabled by overparameterization. Together, these results support a dynamical picture in which multi-task grokking constructs a compact superposition subspace in parameter space, with weight decay acting as compression pressure and excess parameters supplying geometric redundancy in optimization pathways.

Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 24 of its 33 references that are in the map. First posted on arXiv 19 Feb 2026.

Builds on

24 of 33 references.

References · 24

  1. 2020Scaling Laws for Neural Language Modelscited by 6,411
  2. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  3. 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,337
  4. 2017Visualizing the Loss Landscape of Neural Netscited by 1,126
  5. 2022Toy Models of Superpositioncited by 928
  6. 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 919
  7. 2023Progress measures for grokking via mechanistic interpretabilitycited by 822
  8. 2022Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasetscited by 599
  9. 2018Loss Surfaces, Mode Connectivity, and Fast Ensembling of DNNscited by 585
  10. 2018Measuring the Intrinsic Dimension of Objective Landscapescited by 364
  11. 2018Essentially No Barriers in Neural Network Energy Landscapecited by 328
  12. 2015Escaping From Saddle Points --- Online Stochastic Gradient for Tensor Decompositioncited by 241
12 more
  1. 2023The Clock and the Pizza: Two Stories in Mechanistic Explanation of Neural Networkscited by 153
  2. 2022Omnigrok: Grokking Beyond Algorithmic Datacited by 142
  3. 2023Explaining grokking through circuit efficiencycited by 105
  4. 2023Grokking as the Transition from Lazy to Rich Training Dynamicscited by 102
  5. 2022The Slingshot Mechanism: An Empirical Study of Adaptive Optimizers and the Grokking Phenomenoncited by 90
  6. 2023A Tale of Two Circuits: Grokking as Competition of Sparse and Dense Subnetworkscited by 78
  7. 2023Dichotomy of Early and Late Phase Implicit Biases Can Provably Induce Grokkingcited by 76
  8. 2019Large Scale Structure of Neural Network Loss Landscapescited by 68
  9. 2023Unifying Grokking and Double Descentcited by 49
  10. 2026Low-Dimensional and Transversely Curved Optimization Dynamics in Grokkingcited by 10
  11. 2026Low-Dimensional Execution Manifolds in Transformer Learning Dynamics: Evidence from Modular Arithmetic Taskscited by 7
  12. 2026Phase Transitions for Feature Learning in Neural Networkscited by 6

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 8.

8 papers.