{
"id": "2005.10815",
"version": "v1",
"published": "2020-05-21T17:50:15.000Z",
"updated": "2020-05-21T17:50:15.000Z",
"title": "Can Shallow Neural Networks Beat the Curse of Dimensionality? A mean field training perspective",
"authors": [
"Stephan Wojtowytsch",
"Weinan E"
],
"comment": "5 figures",
"categories": [
"cs.LG",
"math.AP",
"stat.ML"
],
"abstract": "We prove that the gradient descent training of a two-layer neural network on empirical or population risk may not decrease population risk at an order faster than $t^{-4/(d-2)}$ under mean field scaling. Thus gradient descent training for fitting reasonably smooth, but truly high-dimensional data may be subject to the curse of dimensionality. We present numerical evidence that gradient descent training with general Lipschitz target functions becomes slower and slower as the dimension increases, but converges at approximately the same rate in all dimensions when the target function lies in the natural function space for two-layer ReLU networks.",
"revisions": [
{
"version": "v1",
"updated": "2020-05-21T17:50:15.000Z"
}
],
"analyses": {
"subjects": [
"68T07",
"49Q22",
"68W25"
],
"keywords": [
"shallow neural networks beat",
"mean field training perspective",
"gradient descent training",
"dimensionality",
"population risk"
],
"note": {
"typesetting": "TeX",
"pages": 0,
"language": "en",
"license": "arXiv",
"status": "editable"
}
}
}