Unit-Consistent (UC) Adjoint for GSD and Backprop in Deep Learning Applications
Not on the map. Why?
Abstract (arXiv)
Deep neural networks constructed from linear maps and positively homogeneous nonlinearities (e.g., ReLU) possess a fundamental gauge symmetry: the network function is invariant to node-wise diagonal rescalings. However, standard gradient descent is not equivariant to this symmetry, causing optimization trajectories to depend heavily on arbitrary parameterizations. Prior work has proposed rescaling-invariant optimization schemes for positively homogeneous networks (e.g., path-based or path-space updates). Our contribution is complementary: we formulate the invariance requirement at the level of the backward adjoint/optimization geometry, which provides a simple, operator-level recipe that can be applied uniformly across network components and optimizer state. By replacing the Euclidean transpose with a Unit-Consistent (UC) adjoint, we derive UC gauge-consistent steepest descent and backprogation.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 6 of its 15 references that are in the map. First posted on arXiv 15 Jan 2026.
Builds on
6 of 15 references.
References · 6
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 7,005
- 2016Layer Normalizationcited by 5,669
- 2021High-Performance Large-Scale Image Recognition Without Normalizationcited by 360
- 2015Path-SGD: Path-Normalized Optimization in Deep Neural Networkscited by 120
Built on by
Not cited yet.