Blow up phenomena for gradient descent optimization methods in the training of artificial neural networks
Not on the map. Why?
Abstract (arXiv)
In this article we investigate blow up phenomena for gradient descent optimization methods in the training of artificial neural networks (ANNs). Our theoretical analysis is focused on shallow ANNs with one neuron on the input layer, one neuron on the output layer, and one hidden layer. For ANNs with ReLU activation and at least two neurons on the hidden layer we establish the existence of a target function such that there exists a lower bound for the risk values of the critical points of the associated risk function which is strictly greater than the infimum of the image of the risk function. This allows us to demonstrate that every gradient flow trajectory with an initial risk smaller than this lower bound diverges. Furthermore, we analyze and compare various popular types of activation functions with regard to the divergence of gradient flow trajectories and gradient descent trajectories in the training of ANNs and with regard to the closely related question concerning the existence of global minimum points of the risk function.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). First posted on arXiv 28 Nov 2022.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 2; 2024: 3; 2025: 2; 2026: 2.
9 papers.
- 2024Non-convergence of Adam and other adaptive stochastic gradient descent optimization methods for non-vanishing learning ratescited by 14
- 2024Convergence rates for the Adam optimizercited by 14
- 2023On the existence of minimizers in shallow residual ReLU neural network optimization landscapescited by 6
- 2023On the existence of optimal shallow feedforward networks with ReLU activationcited by 5
- 2024Understanding the Difficulty of Solving Cauchy Problems with PINNscited by 5
- 2025SAD Neural Networks: Divergent Gradient Flows and Asymptotic Optimality via o-minimal Structurescited by 5
- 2026Uniform a priori bounds and error analysis for the Adam stochastic gradient descent optimization methodcited by 2
- 2025PADAM: Parallel averaged Adam reduces the error for stochastic optimization in scientific machine learningcited by 1
- 2026Central limit theorem for the averaged Adam optimizercited by 0
- 2026Central limit theorem for the averaged Adam optimizer19 Jun 2026
- 2026Uniform a priori bounds and error analysis for the Adam stochastic gradient descent optimization method19 Mar 2026
- 2025PADAM: Parallel averaged Adam reduces the error for stochastic optimization in scientific machine learning28 May 2025
- 2025SAD Neural Networks: Divergent Gradient Flows and Asymptotic Optimality via o-minimal Structures14 May 2025
- 2024Convergence rates for the Adam optimizer29 Jul 2024
- 2024Non-convergence of Adam and other adaptive stochastic gradient descent optimization methods for non-vanishing learning rates11 Jul 2024
- 2024Understanding the Difficulty of Solving Cauchy Problems with PINNs4 May 2024
- 2023On the existence of optimal shallow feedforward networks with ReLU activation6 Mar 2023
- 2023On the existence of minimizers in shallow residual ReLU neural network optimization landscapes28 Feb 2023