Revisiting Landscape Analysis in Deep Neural Networks: Eliminating Decreasing Paths to Infinity
arXiv:1912.13472
Abstract
Traditional landscape analysis of deep neural networks aims to show that no sub-optimal local minima exist in some appropriate sense. From this, one may be tempted to conclude that descent algorithms which escape saddle points will reach a good local minimum. However, basic optimization theory tell us that it is also possible for a descent algorithm to diverge to infinity if there are paths leading to infinity, along which the loss function decreases. It is not clear whether for non-linear neural networks there exists one setting that no bad local-min and no decreasing paths to infinity can be simultaneously achieved. In this paper, we give the first positive answer to this question. More specifically, for a large class of over-parameterized deep neural networks with appropriate regularizers, the loss function has no bad local minima and no decreasing paths to infinity. The key mathematical trick is to show that the set of regularizers which may be undesirable can be viewed as the image of a Lipschitz continuous mapping from a lower-dimensional Euclidean space to a higher-dimensional Euclidean space, and thus has zero measure.
References in corpus (24)
- Neural Tangent Kernel: Convergence and Generalization in Neural Networks
- The Loss Surfaces of Multilayer Networks
- A Convergence Theory for Deep Learning via Over-Parameterization
- Guaranteed Matrix Completion via Non-convex Factorization
- No Spurious Local Minima in Nonconvex Low Rank Problems: A Unified Geometric Analysis
- Stochastic Gradient Descent Optimizes Over-parameterized Deep ReLU Networks
- Towards Understanding the Role of Over-Parametrization in Generalization of Neural Networks
- Learning ReLU Networks on Linearly Separable Data: Algorithm, Optimality, and Generalization
- Beating the Perils of Non-Convexity: Guaranteed Training of Neural Networks using Tensor Methods
- On the Optimization of Deep Networks: Implicit Acceleration by Overparameterization
- Gradient Descent Converges to Minimizers
- Learning One-hidden-layer Neural Networks with Landscape Design
- Towards moderate overparameterization: global convergence guarantees for training shallow neural networks
- On the Convergence of Adaptive Gradient Methods for Nonconvex Optimization
- Globally Optimal Gradient Descent for a ConvNet with Gaussian Inputs
- On the loss landscape of a class of deep neural networks with no bad local valleys
- Understanding the Loss Surface of Neural Networks for Binary Classification
- Adding One Neuron Can Eliminate All Bad Local Minima
- Elimination of All Bad Local Minima in Deep Learning
- On the Benefit of Width for Neural Networks: Disappearance of Bad Basins
- Porcupine Neural Networks: (Almost) All Local Optima are Global
- On the Connection Between Learning Two-Layers Neural Networks and Tensor Decomposition
- Interference alignment using finite and dependent channel extensions: the single beam case
- The Multilinear Structure of ReLU Networks