On the rate of convergence of an over-parametrized deep neural network regression estimate learned by gradient descent
Statistics Theory
2025-04-07 v1 Statistics Theory
Abstract
Nonparametric regression with random design is considered. The error with integration with respect to the design measure is used as the error criterion. An over-parametrized deep neural network regression estimate with logistic activation function is defined, where all weights are learned by gradient descent. It is shown that the estimate achieves a nearly optimal rate of convergence in case that the regression function is --smooth.
Keywords
Cite
@article{arxiv.2504.03405,
title = {On the rate of convergence of an over-parametrized deep neural network regression estimate learned by gradient descent},
author = {Michael Kohler},
journal= {arXiv preprint arXiv:2504.03405},
year = {2025}
}