pith. sign in

arxiv: 1806.07808 · v1 · pith:3HYT534Dnew · submitted 2018-06-20 · 📊 stat.ML · cs.LG

Learning One-hidden-layer ReLU Networks via Gradient Descent

classification 📊 stat.ML cs.LG
keywords networksdescentgradientlearningone-hidden-layerrelulinearneural
0
0 comments X p. Extension
pith:3HYT534D Add to your LaTeX paper What is a Pith Number?
\usepackage{pith}
\pithnumber{3HYT534D}

Prints a linked pith:3HYT534D badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more

read the original abstract

We study the problem of learning one-hidden-layer neural networks with Rectified Linear Unit (ReLU) activation function, where the inputs are sampled from standard Gaussian distribution and the outputs are generated from a noisy teacher network. We analyze the performance of gradient descent for training such kind of neural networks based on empirical risk minimization, and provide algorithm-dependent guarantees. In particular, we prove that tensor initialization followed by gradient descent can converge to the ground-truth parameters at a linear rate up to some statistical error. To the best of our knowledge, this is the first work characterizing the recovery guarantee for practical learning of one-hidden-layer ReLU networks with multiple neurons. Numerical experiments verify our theoretical findings.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.