Overall error analysis for the training of deep neural networks via stochastic gradient descent with random initialisation
Not on the map. Why?
Abstract (arXiv)
In spite of the accomplishments of deep learning based algorithms in numerous applications and very broad corresponding research interest, at the moment there is still no rigorous understanding of the reasons why such algorithms produce useful results in certain situations. A thorough mathematical analysis of deep learning based algorithms seems to be crucial in order to improve our understanding and to make their implementation more effective and efficient. In this article we provide a mathematically rigorous full error analysis of deep learning based empirical risk minimisation with quadratic loss function in the probabilistically strong sense, where the underlying deep neural networks are trained using stochastic gradient descent with random initialisation. The convergence speed we obtain is presumably far from optimal and suffers under the curse of dimensionality. To the best of our knowledge, we establish, however, the first full error analysis in the scientific literature for a deep learning based algorithm in the probabilistically strong sense and, moreover, the first full error analysis in the scientific literature for a deep learning based algorithm where stochastic gradient descent with random initialisation is the employed optimisation method.
Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). First posted on arXiv 3 Mar 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 1; 2023: 0; 2024: 1; 2025: 2.
7 papers.
- 2021On the approximation of functions by tanh neural networkscited by 81
- 2021Convergence of stochastic gradient descent schemes for Lojasiewicz-landscapescited by 28
- 2021A proof of convergence for stochastic gradient descent in the training of artificial neural networks with ReLU activation for constant target functionscited by 9
- 2022Error analysis for deep neural network approximations of parametric hyperbolic conservation lawscited by 2
- 2025Stable Preference Optimization: A Bilevel Approach to Catastrophic Preference Shiftcited by 2
- 2024On the growth of the parameters of approximating ReLU neural networkscited by 0
- 2025Overfitting has a limitation: a model-independent generalization gap bound based on R'enyi entropycited by 0
- 2025Stable Preference Optimization: A Bilevel Approach to Catastrophic Preference Shift10 Jul 2025
- 2025Overfitting has a limitation: a model-independent generalization gap bound based on R'enyi entropy30 May 2025
- 2024On the growth of the parameters of approximating ReLU neural networks21 Jun 2024
- 2022Error analysis for deep neural network approximations of parametric hyperbolic conservation laws15 Jul 2022
- 2021On the approximation of functions by tanh neural networks18 Apr 2021
- 2021A proof of convergence for stochastic gradient descent in the training of artificial neural networks with ReLU activation for constant target functions1 Apr 2021
- 2021Convergence of stochastic gradient descent schemes for Lojasiewicz-landscapes16 Feb 2021