Pith. sign in

REVIEW 2 cited by

Blow up phenomena for gradient descent optimization methods in the training of artificial neural networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2211.15641 v1 pith:P3KDJ6UV submitted 2022-11-28 math.OC

classification math.OC
keywords gradientriskannsfunctionlayerdescenttrainingactivation
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Landscape analysis for shallow neural networks: Complete classification of critical points for cubic activation and affine target functions

    math.OC 2026-07 conditional novelty 6.0 of 10

    For cubic-activation shallow networks with affine targets, the squared-loss landscape has no local maxima; every critical point is a global minimizer, a rigid non-global local minimum, or a saddle, and zero loss is ac...

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

    math.OC 2025-05 conditional novelty 6.0 of 10

    PADAM runs K differently averaged Adam trajectories in parallel, selects the one with the smallest test error, and achieves the best optimization error in nearly all of 13 tested scientific machine learning problems w...

Pith tools