Learning Overparameterized Neural Networks via Stochastic Gradient Descent on Structured Data
Abstract
Neural networks have many successful applications, while much less theoretical understanding has been gained. Towards bridging this gap, we study the problem of learning a two-layer overparameterized ReLU neural network for multi-class classification via stochastic gradient descent (SGD) from random initialization. In the overparameterized setting, when the data comes from mixtures of well-separated distributions, we prove that SGD learns a network with a small generalization error, albeit the network has enough capacity to fit arbitrary labels. Furthermore, the analysis provides interesting insights into several aspects of learning neural networks and can be verified based on empirical studies on synthetic data and on the MNIST dataset.
Cite
@article{arxiv.1808.01204,
title = {Learning Overparameterized Neural Networks via Stochastic Gradient Descent on Structured Data},
author = {Yuanzhi Li and Yingyu Liang},
journal= {arXiv preprint arXiv:1808.01204},
year = {2019}
}
Comments
NeurIPS'18 version. Appendix updated, additional experimental results added