Depth creates no more spurious local minima
Not on the map. Why?
Abstract (arXiv)
We show that for any convex differentiable loss, a deep linear network has no spurious local minima as long as it is true for the two layer case. This reduction greatly simplifies the study on the existence of spurious local minima in deep linear networks. When applied to the quadratic loss, our result immediately implies the powerful result in [Kawaguchi 2016]. Further, with the work in [Zhou and Liang 2018], we can remove all the assumptions in [Kawaguchi 2016]. This property holds for more general "multi-tower" linear networks too. Our proof builds on [Laurent and von Brecht 2018] and develops a new perturbation argument to show that any spurious local minimum must have full rank, a structural property which can be useful more generally.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). First posted on arXiv 28 Jan 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 2.
5 papers.
- 2021Geometry of Linear Convolutional Networkscited by 27
- 2022When Expressivity Meets Trainability: Fewer than n Neurons Can Workcited by 8
- 2021Spurious Local Minima Are Common for Deep Neural Networks with Piecewise Linear Activationscited by 7
- 2021Neural Networks with Complex-Valued Weights Have No Spurious Local Minimacited by 0
- 2022Global Convergence Analysis of Deep Linear Networks with A One-neuron Layercited by 0
- 2022When Expressivity Meets Trainability: Fewer than n Neurons Can Work21 Oct 2022
- 2022Global Convergence Analysis of Deep Linear Networks with A One-neuron Layer8 Jan 2022
- 2021Geometry of Linear Convolutional Networks3 Aug 2021
- 2021Spurious Local Minima Are Common for Deep Neural Networks with Piecewise Linear Activations25 Feb 2021
- 2021Neural Networks with Complex-Valued Weights Have No Spurious Local Minima31 Jan 2021