paper-with-me

홈 › Papers

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

2026-06-28 · Tejas Pradeep Shirodkar 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 $\barΘ= Θ/G$. The construction carries four architectural gauges (cross-entropy shift, ReLU and SwiGLU rescaling, LayerNorm and RMSNorm scale, and a per-head $O(d_{\rm 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.

📄 PDF Abstract BibTeX arXiv:2606.29176

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Gauge-equivariant pooling layers for preconditioners in lattice QCD

2023-04-20 · Christoph Lehner, Tilo Wettig

We demonstrate that gauge-equivariant pooling and unpooling layers can perform as well as traditional restriction and prolongation layers in multigrid preconditioner models for lattice QCD. These layers introduce a gauge…

Gauge-equivariant neural networks as preconditioners in lattice QCD

2023-02-10 · Christoph Lehner, Tilo Wettig

We demonstrate that a state-of-the art multi-grid preconditioner can be learned efficiently by gauge-equivariant neural networks. We show that the models require minimal re-training on different gauge configurations of t…

Matrix-free Neural Preconditioner for the Dirac Operator in Lattice Gauge Theory

2025-09-12 · Yixuan Sun, Srinivas Eswar, Yin Lin, William Detmold 외 arxiv

Linear systems arise in generating samples and in calculating observables in lattice quantum chromodynamics~(QCD). Solving the Hermitian positive definite systems, which are sparse but ill-conditioned, involves using ite…

Zero-Shot Learning

The Loss Does Not See the Basis, but Adam Does

2026-08-05 · Devender Singh hf

Gradient descent on a factored model W = UV^top is implicitly biased toward low-rank solutions, while Adam, starting from the same small initialization, is not. We trace the difference to the gauge symmetry of the loss, …

Optimal Diagonal Preconditioning

2022-09-02 · Zhaonan Qu, Wenzhi Gao, Oliver Hinder, Yinyu Ye 외

Preconditioning has long been a staple technique in optimization, often applied to reduce the condition number of a matrix and speed up the convergence of algorithms. Although there are many popular preconditioning techn…