Magnitude and Angle Dynamics in Training Single ReLU Neurons
Not on the map. Why?
Abstract (arXiv)
To understand learning the dynamics of deep ReLU networks, we investigate the dynamic system of gradient flow w(t) by decomposing it to magnitude w(t) and angle φ(t):= π - θ(t) components. In particular, for multi-layer single ReLU neurons with spherically symmetric data distribution and the square loss function, we provide upper and lower bounds for magnitude and angle components to describe the dynamics of gradient flow. Using the obtained bounds, we conclude that small scale initialization induces slow convergence speed for deep single ReLU neurons. Finally, by exploiting the relation of gradient flow and gradient descent, we extend our results to the gradient descent approach. All theoretical results are verified by experiments.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 38 of its 47 references that are in the map. First posted on arXiv 27 Sep 2022.
Builds on
38 of 47 references.
References · 38
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
- 2018A Convergence Theory for Deep Learning via Over-Parameterizationcited by 784
- 2018On Lazy Training in Differentiable Programmingcited by 671
- 2017The Implicit Bias of Gradient Descent on Separable Datacited by 649
- 2018Gradient Descent Finds Global Minima of Deep Neural Networkscited by 572
- 2019Fine-Grained Analysis of Optimization and Generalization for Overparameterized Two-Layer Neural Networkscited by 562
- 2017Opening the Black Box of Deep Neural Networks via Informationcited by 494
- 2017Implicit Regularization in Matrix Factorizationcited by 318
- 2019Gradient Descent Maximizes the Margin of Homogeneous Neural Networkscited by 308
- 2019Two models of double descent for weak featurescited by 194
- 2018Gradient descent aligns the layers of deep linear networkscited by 182
- 2018Algorithmic Regularization in Learning Deep Homogeneous Models: Layers are Automatically Balancedcited by 172
26 more
- 2019Complexity of Linear Regions in Deep Networkscited by 166
- 2019Deep ReLU Networks Have Surprisingly Few Activation Patternscited by 160
- 2018Risk and parameter convergence of logistic regressioncited by 81
- 2022Gradient flow dynamics of shallow ReLU networks for square loss and orthogonal inputscited by 74
- 2020Provable Benefit of Orthogonal Initialization in Optimizing Deep Linear Networkscited by 73
- 2020Implicit Bias in Deep Linear Classification: Initialization Scale vs Training Accuracycited by 70
- 2020Global Convergence of Deep Networks with One Wide Layer Followed by Pyramidal Topologycited by 66
- 2017Globally Optimal Gradient Descent for a ConvNet with Gaussian Inputscited by 61
- 2018Gradient Descent Quantizes ReLU Network Featurescited by 57
- 2017An Analytical Formula of Population Gradient for two-layered ReLU network and its Applications in Convergence and Critical Point Analysiscited by 52
- 2018Learning One-hidden-layer ReLU Networks via Gradient Descentcited by 50
- 2020Learning a Single Neuron with Gradient Methodscited by 50
- 2020Agnostic Learning of a Single Neuron with Gradient Descentcited by 46
- 2020Implicit Regularization in ReLU Networks with the Square Losscited by 45
- 2020On the Global Convergence of Training Deep Linear ResNetscited by 29
- 2022Hardness of Noise-Free Learning for Two-Hidden-Layer Neural Networkscited by 27
- 2018Exponential Convergence Time of Gradient Descent for One-Dimensional Deep Linear Neural Networkscited by 22
- 2017When is a Convolutional Filter Easy To Learn?cited by 21
- 2022Global Convergence of Sub-gradient Method for Robust Matrix Recovery: Small Initialization, Noisy Measurements, and Over-parameterizationcited by 21
- 2022Learning a Single Neuron with Adversarial Label Noise via Gradient Descentcited by 20
- 2021Learning a Single Neuron with Bias Using Gradient Descentcited by 17
- 2021A global convergence theory for deep ReLU implicit networks via over-parameterizationcited by 17
- 2021Analytic Study of Families of Spurious Minima in Two-Layer ReLU Neural Networks: A Tale of Symmetry IIcited by 16
- 2022Learning a Single Neuron for Non-monotonic Activation Functionscited by 13
- 2019Fitting ReLUs via SGD and Quantized SGDcited by 10
- 2021A Contraction Theory Approach to Optimization Algorithms from Acceleration Flowscited by 3
Built on by
Citing papers per year: 2023: 1; 2024: 3; 2025: 0; 2026: 1.
5 papers.
- 2023Learning a Neuron by a Shallow ReLU Network: Dynamics and Implicit Bias for Correlated Inputscited by 16
- 2024Masks, Signs, And Learning Rate Rewindingcited by 15
- 2024Don't Fear Peculiar Activation Functions: EUAF and Beyondcited by 7
- 2024Loss Landscape of Shallow ReLU-like Neural Networks: Stationary Points, Saddle Escape, and Network Embeddingcited by 6
- 2026Teacher Geometry Shapes Learnability in Teacher-Student Networkscited by 0
- 2026Teacher Geometry Shapes Learnability in Teacher-Student Networks9 Sep 2026
- 2024Don't Fear Peculiar Activation Functions: EUAF and Beyond12 Jul 2024
- 2024Masks, Signs, And Learning Rate Rewinding29 Feb 2024
- 2024Loss Landscape of Shallow ReLU-like Neural Networks: Stationary Points, Saddle Escape, and Network Embedding8 Feb 2024
- 2023Learning a Neuron by a Shallow ReLU Network: Dynamics and Implicit Bias for Correlated Inputs10 Jun 2023