Unit-Consistent (UC) Adjoint for GSD and Backprop in Deep Learning Applications

Jeffrey Uhlmann
1/15/2026
cs.LG

No confident code implementation found for this paper.

Abstract

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{uhlmann2026unitconsistent,
  title  = {Unit-Consistent (UC) Adjoint for GSD and Backprop in Deep Learning Applications},
  author = {Jeffrey Uhlmann},
  year   = {2026},
  eprint = {2601.10873},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2601.10873v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2601.10873.svg)](https://codeofpaper.com/paper/2601.10873)

Discussion