mlsanityData to 14 Oct 2026

Gradient-Direction Sensitivity Reveals Linear-Centroid Coupling Hidden by Optimizer Trajectories

arXiv 2604.25143 ↗First posted 28 Apr 2026cs.LG cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

We show that replacing the rolling SVD of AdamW updates with a rolling SVD of loss gradients changes the diagnostic by 1-2 orders of magnitude. Performing SVD on the loss gradient instead of the AdamW update increases the measured perturbative coupling between SED directions and Linear Centroid Hypothesis (LCH) features from barRk ≈ 3 --9× to 100--330× across four single-task modular arithmetic operations, eliminating the apparent operation dependence in the original measurement. On a multitask transformer with a shared encoder, update-based SED gives barRk ≤ 1 -- an apparent failure of the diagnostic -- while per-operation gradient-based SED recovers barRk = 20 --45× across all four operations. Gradient aggregation across competing tasks is the main obstruction; performing SVD on per-task gradients resolves it. A causal intervention shows that constraining attention updates to any rank-3 subspace (whether SED-derived or random) accelerates grokking by approximately 2.3× across random seeds and operations, while removing the rank-3 component has negligible effect under proper gradient-projection methodology. The SED-LCH coupling is therefore a strong diagnostic of where feature formation concentrates in parameter space, but it is not a unique causal pathway: the natural full-rank AdamW attention update is highly rank-redundant under our hyperparameters.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 9 of its 12 references that are in the map. First posted on arXiv 28 Apr 2026.

Builds on

9 of 12 references.

References · 9

  1. 2023Progress measures for grokking via mechanistic interpretabilitycited by 839
  2. 2023The Linear Representation Hypothesis and the Geometry of Large Language Modelscited by 716
  3. 2022Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasetscited by 629
  4. 2021Gradient Descent on Neural Networks Typically Occurs at the Edge of Stabilitycited by 427
  5. 2022Omnigrok: Grokking Beyond Algorithmic Datacited by 146
  6. 2025Provable Scaling Laws of Feature Emergence from Learning Dynamics of Grokkingcited by 15
  7. 2026The Geometry of Multi-Task Grokking: Transverse Instability, Superposition, and Weight Decay Phase Structurecited by 9
  8. 2026Spectral Edge Dynamics: An Analytical-Empirical Study of Phase Transitions in Neural Network Trainingcited by 4
  9. 2026The Linear Centroids Hypothesis: Features as Directions Learned by Local Expertscited by 3

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.