@inproceedings{9198,
  abstract     = {The optimization of multilayer neural networks typically leads to a solution
with zero training error, yet the landscape can exhibit spurious local minima
and the minima can be disconnected. In this paper, we shed light on this
phenomenon: we show that the combination of stochastic gradient descent (SGD)
and over-parameterization makes the landscape of multilayer neural networks
approximately connected and thus more favorable to optimization. More
specifically, we prove that SGD solutions are connected via a piecewise linear
path, and the increase in loss along this path vanishes as the number of
neurons grows large. This result is a consequence of the fact that the
parameters found by SGD are increasingly dropout stable as the network becomes
wider. We show that, if we remove part of the neurons (and suitably rescale the
remaining ones), the change in loss is independent of the total number of
neurons, and it depends only on how many neurons are left. Our results exhibit
a mild dependence on the input dimension: they are dimension-free for two-layer
networks and depend linearly on the dimension for multilayer networks. We
validate our theoretical findings with numerical experiments for different
architectures and classification tasks.},
  author       = {Shevchenko, Aleksandr and Mondelli, Marco},
  booktitle    = {Proceedings of the 37th International Conference on Machine Learning},
  pages        = {8773--8784},
  publisher    = {ML Research Press},
  title        = {{Landscape connectivity and dropout stability of SGD solutions for over-parameterized neural networks}},
  volume       = {119},
  year         = {2020},
}