Deep orthogonal linear networks are shallow
Not on the map. Why?
Abstract (arXiv)
We consider the problem of training a deep orthogonal linear network, which consists of a product of orthogonal matrices, with no non-linearity in-between. We show that training the weights with Riemannian gradient descent is equivalent to training the whole factorization by gradient descent. This means that there is no effect of overparametrization and implicit bias at all in this setting: training such a deep, overparametrized, network is perfectly equivalent to training a one-layer shallow network.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). First posted on arXiv 27 Nov 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 1.
1 paper.