mlsanityData to 14 Oct 2026

Dead-Direction Conditioners: Gauge-Equivariant Preconditioning for Deep Networks

arXiv 2606.29176 ↗First posted 28 Jun 2026cs.LG math.DG math.OCcited by 2

Not on the map. Why?

Abstract (arXiv)

A deep network's loss is invariant to continuous symmetries of its parameters: the logit shift, the ReLU rescaling, the LayerNorm scale, the per-head attention rotation. Adam's per-coordinate preconditioner drifts along each symmetry orbit, which pulls the trajectory off the symmetry quotient where the optimization lives and blurs the singular-learning rate the quotient makes readable. We build DDC, a Dead-Direction Conditioner that lifts a base optimizer into a G-equivariant one: it conditions the optimizer's state in the orbit decomposition of a G-invariant metric, so the trajectory stays a preconditioned gradient flow on the quotient barTheta = Theta/G. The construction carries four architectural gauges (cross-entropy shift, ReLU and SwiGLU rescaling, LayerNorm and RMSNorm scale, and a per-head O(drm head) attention rotation matched to RoPE), proves exactly equivariant on an Adam base, and composes with a Muon base through a gauge-equivariant orthogonaliser. Respecting the symmetry changes both the minimum the optimizer reaches and what it leaves measurable there. On a language model trained past the point of fit, DDCAdam resists the over-training collapse AdamW falls into, holding a validation-train loss gap of 0.67 against 5.88, and reads the dead-direction rate in 32 of 65 layer-by-observable cells where AdamW reads it in 7. A vision transformer trained from scratch reaches lower validation loss (1.71 against 2.12) while compressing spare feed-forward capacity a matched AdamW leaves intact. On a Muon base, where the rotation gauge composes exactly, DDCMuon groks ten of eleven seeds at depth 24 that a plain Muon never reaches. Built into the optimizer, a network's gauge symmetry sharpens the minimum it finds and turns that minimum's geometry into something the trajectory can measure.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 19 of its 39 references that are in the map. First posted on arXiv 28 Jun 2026.

Builds on

19 of 39 references.

References · 19

  1. 2018On the Optimization of Deep Networks: Implicit Acceleration by Overparameterizationcited by 284
  2. 2018Riemannian Adaptive Optimization Methodscited by 194
  3. 2025Training Deep Learning Models with Norm-Constrained LMOscited by 192
  4. 2017L2 Regularization versus Batch and Weight Normalizationcited by 124
  5. 2025NorMuon: Making Muon more efficient and scalablecited by 84
  6. 2024Modular Duality in Deep Learningcited by 77
  7. 2023Rotational Equilibrium: How Weight Decay Balances Learning Across Neural Networkscited by 53
  8. 2025Grokking at the Edge of Numerical Stabilitycited by 46
  9. 2025Symmetry in Neural Network Parameter Spacescited by 36
  10. 2024LoRA Done RITE: Robust Invariant Transformation Equilibration for LoRA Optimizationcited by 32
  11. 2022VectorAdam for Rotation Equivariant Geometry Optimizationcited by 18
  12. 2016The Z-loss: a shift and scale invariant classification loss belonging to the Spherical Familycited by 12
7 more
  1. 2026Symmetry-Compatible Principle for Optimizer Design: Embeddings, LM Heads, SwiGLU MLPs, and MoE Routerscited by 11
  2. 2025Optimal Scaling Needs Optimal Normcited by 8
  3. 2026Symmetry Breaking in Transformers for Efficient and Interpretable Trainingcited by 5
  4. 2025How do simple rotations affect the implicit bias of Adam?cited by 3
  5. 2026Algebraic Dead Directions in LayerNorm Transformers: A Forward-Pass-Only Diagnostic at LLM Scalecited by 3
  6. 2026Dead-Direction Signatures: A Cheap Spectral Reading of Singular Complexitycited by 2
  7. 2026Dead Directions: Geometric Singular Learningcited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 2.

2 papers.