activity
20202025
most citedA proof of convergence for gradient descent in the training of artificial neural networks for constant target functions

26 citations · 96 across the 22 of their papers we have counts for

collaborators
Showing math.OCShow all

11 papers · 1 filter

math.OC2025

Asymptotic stability properties and a priori bounds for Adam and other gradient descent optimization methods

Steffen Dereich, Robin Graeber, Arnulf Jentzen +1

Gradient descent (GD) based optimization methods are these days the standard tools to train deep neural networks in artificial intelligence systems. In optimization procedures in d…

math.OC2025

PADAM: Parallel averaged Adam reduces the error for stochastic optimization in scientific machine learning

Arnulf Jentzen, Julian Kranz, Adrian Riekert

Averaging techniques such as Ruppert--Polyak averaging and exponential movering averaging (EMA) are powerful approaches to accelerate optimization procedures of stochastic gradient…

math.OC2025

Sharp higher order convergence rates for the Adam optimizer

Steffen Dereich, Arnulf Jentzen, Adrian Riekert

Gradient descent based optimization methods are the methods of choice to train deep neural networks in machine learning. Beyond the standard gradient descent method, also suitable…

math.OC2025

Averaged Adam accelerates stochastic optimization in the training of deep neural network approximations for partial differential equation and optimal control problems

Steffen Dereich, Arnulf Jentzen, Adrian Riekert

Deep learning methods - usually consisting of a class of deep neural networks (DNNs) trained by a stochastic gradient descent (SGD) optimization method - are nowadays omnipresent i…

math.OC2024

Learning rate adaptive stochastic gradient descent optimization methods: numerical simulations for deep learning methods for partial differential equations and convergence analyses

Steffen Dereich, Arnulf Jentzen, Adrian Riekert

The standard stochastic gradient descent (SGD) optimization method, as well as adaptive methods such as the Adam optimizer fail to converge if the learning rates do not converge to…

math.OC2024

Non-convergence to global minimizers for Adam and stochastic gradient descent optimization and constructions of local minimizers in the training of artificial neural networks

Arnulf Jentzen, Adrian Riekert

Stochastic gradient descent (SGD) optimization methods such as the plain vanilla SGD method and the popular Adam optimizer are nowadays the method of choice in the training of arti…

math.OC2022★ 2 cited

Convergence to good non-optimal critical points in the training of neural networks: Gradient descent optimization with one random initialization overcomes all bad non-global local minima with high probability

Shokhrukh Ibragimov, Arnulf Jentzen, Adrian Riekert

Gradient descent (GD) methods for the training of artificial neural networks (ANNs) belong nowadays to the most heavily employed computational schemes in the digital world. Despite…

math.OC2022

Normalized gradient flow optimization in the training of ReLU artificial neural networks

Simon Eberle, Arnulf Jentzen, Adrian Riekert +1

The training of artificial neural networks (ANNs) is nowadays a highly relevant algorithmic procedure with many applications in science and industry. Roughly speaking, ANNs can be…

math.OC2022★ 1 cited

On the existence of infinitely many realization functions of non-global local minima for artificial neural networks with ReLU activation

Shokhrukh Ibragimov, Arnulf Jentzen, Timo Kröger +1

Gradient descent (GD) type optimization schemes are standard tools for training fully connected feedforward artificial neural networks (ANNs) with rectified linear unit (ReLU) acti…

math.OC2021★ 14 cited

On the existence of global minima and convergence analyses for gradient descent methods in the training of deep neural networks

Arnulf Jentzen, Adrian Riekert

In this article we study fully-connected feedforward deep ReLU ANNs with an arbitrarily large number of hidden layers and we prove convergence of the risk of the GD optimization me…

math.OC2021★ 2 cited

A proof of convergence for the gradient descent optimization method with random initializations in the training of neural networks with ReLU activation for piecewise linear target functions

Arnulf Jentzen, Adrian Riekert

Gradient descent (GD) type optimization methods are the standard instrument to train artificial neural networks (ANNs) with rectified linear unit (ReLU) activation. Despite the gre…