Towards an Understanding of Residual Networks Using Neural Tangent Hierarchy (NTH)
Not on the map. Why?
Abstract (arXiv)
Gradient descent yields zero training loss in polynomial time for deep neural networks despite non-convex nature of the objective function. The behavior of network in the infinite width limit trained by gradient descent can be described by the Neural Tangent Kernel (NTK) introduced in citeJacot2018Neural. In this paper, we study dynamics of the NTK for finite width Deep Residual Network (ResNet) using the neural tangent hierarchy (NTH) proposed in citeHuang2019Dynamics. For a ResNet with smooth and Lipschitz activation function, we reduce the requirement on the layer width m with respect to the number of training samples n from quartic to cubic. Our analysis suggests strongly that the particular skip-connection structure of ResNet is the main reason for its triumph over fully-connected network.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 7 Jul 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 1; 2024: 1; 2025: 1.
4 papers.
- 2023Phase Diagram of Initial Condensation for Two-layer Neural Networkscited by 15
- 2024Neural Circuit Diagrams: Robust Diagrams for the Communication, Implementation, and Analysis of Deep Learning Architecturescited by 8
- 2025Learn Singularly Perturbed Solutions via Homotopy Dynamicscited by 2
- 2022There is a Singularity in the Loss Landscapecited by 1
- 2025Learn Singularly Perturbed Solutions via Homotopy Dynamics1 Feb 2025
- 2024Neural Circuit Diagrams: Robust Diagrams for the Communication, Implementation, and Analysis of Deep Learning Architectures8 Feb 2024
- 2023Phase Diagram of Initial Condensation for Two-layer Neural Networks12 Mar 2023
- 2022There is a Singularity in the Loss Landscape12 Jan 2022