Pith. sign in

REVIEW 1 cited by

Characterization of Gradient Dominance and Regularity Conditions for 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 1710.06910 v2 pith:LF26HRO5 submitted 2017-10-18 stat.ML cs.LGmath.OC

classification stat.MLcs.LGmath.OC
keywords networksneuralgloballossminimizerslandscapesquarecharacterization
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

The past decade has witnessed a successful application of deep learning to solving many challenging problems in machine learning and artificial intelligence. However, the loss functions of deep neural networks (especially nonlinear networks) are still far from being well understood from a theoretical aspect. In this paper, we enrich the current understanding of the landscape of the square loss functions for three types of neural networks. Specifically, when the parameter matrices are square, we provide an explicit characterization of the global minimizers for linear networks, linear residual networks, and nonlinear networks with one hidden layer. Then, we establish two quadratic types of landscape properties for the square loss of these neural networks, i.e., the gradient dominance condition within the neighborhood of their full rank global minimizers, and the regularity condition along certain directions and within the neighborhood of their global minimizers. These two landscape properties are desirable for the optimization around the global minimizers of the loss function for these neural networks.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Stochastic AUC Maximization with Deep Neural Networks

    cs.LG 2019-08 conditional novelty 7.0 of 10

    Under the Polyak-Lojasiewicz condition, a proximal primal-dual algorithm and an AdaGrad-style variant maximize AUC with deep networks at O~(1/epsilon) sample complexity, with adaptive iteration complexity under slow c...

Pith tools