Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 47 min ago
PreprintarXiv licencearXiv

Directions That Don't Drift: Stiefel Manifold Routing for Transformer Attention

Abstract

The query and key projections WQ,WK in attention are almost always trained by Euclidean optimizers with no geometric constraint. We constrain them to the Stiefel manifold and optimize with a Riemannian Adam carrying one scalar second moment per frame---the form of \citet{becigneul2019}, here extended to the compact, non-Hadamard St(d,r) with a tangent projector, step-norm cap, and polar retraction. Four propositions prove steepest descent in the embedded metric, gradient-scale independence, well-conditioning, and exact O(d)-equivariance. A fifth records that weight decay has \emph{identically zero} Riemannian gradient on St(d,r) (W=WIr lies in the normal space), so decay cannot act on the constrained frames. On a CIFAR-10 patch benchmark at n=10k this rule gains +6.79\,pp over AdamW across 12 paired starts (t=38.33, 12/12); earlier fixed-step Riemannian SGD gains +1.97\,pp, of which +1.69\,pp comes from frozen orthonormal initialization alone. The corrected Adam's lead grows with data: +1.9\,pp at n=1k to +6.7\,pp at n=50k. A 12-seed ablation credits all gain to the scale-free step (+4.63\,pp, 12/12), nothing to the projector or equivariance; a targeted ε-sweep causally confirms the mechanism (−2.6\,pp at ε=0.1, p<0.001). Two five-seed grokking studies confirm the constrained arm does not grok better than the baseline (p=0.019, A2 wins): the weight-decay exemption has no grokking consequence. A single-seed pilot exploiting this localization achieves the first stable grokking under slingshot conditions---Stiefel + targeted circuit regularization keeps routing-frame isometry error 106× lower than the unconstrained ablation through every collapse.

Related

  1. Escaping the Capacity Ceiling: Routing on the Stiefel Manifold for Bilinear SPD Layers
    Isabella C. Maia, Salem Said, Pedro L. C. Rodrigues +1
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  2. PLADOS: A Parameter-free Landing Algorithm for Decentralized Optimization on the Stiefel Manifold
    Shu Li, Jiang Hu
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  3. A Safeguarded Transport-Extrapolated Proximal Gradient Method on the Stiefel Manifold
    Chuanjun Yan, Lin Chen
    AxiomsPeer-reviewedCC BY 4.0General mathematicsCrossref
  4. NEPv Approach for Optimization on Stiefel Manifold with the (2,1)-norm Regularization
    Ren-Cang Li, Li Wang, Lei-Hong Zhang +1
    arXivPreprintCC BY 4.0Full textNumerical analysis & scientific computingarXiv
  5. Infeasible Momentum Orthogonalized Methods for Optimization on the Stiefel Manifold
    Yuxuan Zeng, Qi Deng, Dongdong Ge +1
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
BibTeX
@misc{guerrero2026directions,
  title = {{Directions That Don't Drift: Stiefel Manifold Routing for Transformer Attention}},
  author = {Rubén Darío Guerrero},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2609.19363},
  eprint = {2609.19363},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.19363},
}
RIS
TY  - UNPB
TI  - Directions That Don't Drift: Stiefel Manifold Routing for Transformer Attention
AU  - Rubén Darío Guerrero
PY  - 2026
DA  - 2026/10/01
PB  - arXiv
DO  - 10.48550/arxiv.2609.19363
UR  - https://arxiv.org/abs/2609.19363
AB  - The query and key projections WQ,WK in attention are almost always trained by Euclidean optimizers with no geometric constraint. We constrain them to the Stiefel manifold and optimize with a Riemannian Adam carrying one scalar second moment per frame---the form of \citet{becigneul2019}, here extended to the compact, non-Hadamard St(d,r) with a tangent projector, step-norm cap, and polar retraction. Four propositions prove steepest descent in the embedded metric, gradient-scale independence, well-conditioning, and exact O(d)-equivariance. A fifth records that weight decay has \emph{identically zero} Riemannian gradient on St(d,r) (W=WI_r lies in the normal space), so decay cannot act on the constrained frames. On a CIFAR-10 patch benchmark at n=10k this rule gains +6.79\,pp over AdamW across 12 paired starts (t=38.33, 12/12); earlier fixed-step Riemannian SGD gains +1.97\,pp, of which +1.69\,pp comes from frozen orthonormal initialization alone. The corrected Adam's lead grows with data: +1.9\,pp at n=1k to +6.7\,pp at n=50k. A 12-seed ablation credits all gain to the scale-free step (+4.63\,pp, 12/12), nothing to the projector or equivariance; a targeted ε-sweep causally confirms the mechanism (−2.6\,pp at ε=0.1, p<0.001). Two five-seed grokking studies confirm the constrained arm does not grok better than the baseline (p=0.019, A2 wins): the weight-decay exemption has no grokking consequence. A single-seed pilot exploiting this localization achieves the first stable grokking under slingshot conditions---Stiefel + targeted circuit regularization keeps routing-frame isometry error 10^6× lower than the unconstrained ablation through every collapse.
ER  -