Skip to main navigation
Skip to search
Skip to main content
Princeton University Home
Help & FAQ
Link opens in a new tab
Search content at Princeton University
Home
Profiles
Research units
Facilities
Projects
Research output
Press/Media
A convergence analysis of gradient descent for deep linear neural networks
Sanjeev Arora
, Noah Golowich
, Nadav Cohen
, Wei Hu
Computer Science
Bendheim Center for Finance
Center for Statistics & Machine Learning
Research output
:
Contribution to conference
›
Paper
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'A convergence analysis of gradient descent for deep linear neural networks'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Convergence Analysis
100%
Gradient Descent
100%
Convergence to Global Optimum
100%
Deep Linear Networks
100%
Scalar
50%
Convergence Rate
50%
Hidden Layer
50%
Random Initialization
50%
Weight Matrix
50%
Rank Deficiency
50%
Initialization Method
50%
Initial Loss
50%
Residual Network
50%
Speed of Analysis
50%
Gradient Descent Training
50%
Linear Growth Rate
50%
Convergence Failure
50%
Computer Science
Neural Network
100%
Gradient Descent
100%
Mathematical Convergence
100%
Output Dimension
100%
Input Dimension
50%
Constant Probability
50%
Speed Convergence
50%
Residual Neural Network
50%
Mathematics
Global Optimum
100%
Neural Network
100%
Convergence Analysis
100%
Speed Convergence
50%
Weight Matrix
50%
Residual Network
50%
Probability
50%