Emergence of Globally Attracting Fixed Points in Deep Neural Networks With Nonlinear Activations
Not on the map. Why?
Abstract (arXiv)
Understanding how neural networks transform input data across layers is fundamental to unraveling their learning and generalization capabilities. Although prior work has used insights from kernel methods to study neural networks, a global analysis of how the similarity between hidden representations evolves across layers remains underexplored. In this paper, we introduce a theoretical framework for the evolution of the kernel sequence, which measures the similarity between the hidden representation for two different inputs. Operating under the mean-field regime, we show that the kernel sequence evolves deterministically via a kernel map, which only depends on the activation function. By expanding activation using Hermite polynomials and using their algebraic properties, we derive an explicit form for kernel map and fully characterize its fixed points. Our analysis reveals that for nonlinear activations, the kernel sequence converges globally to a unique fixed point, which can correspond to orthogonal or similar representations depending on the activation and network architecture. We further extend our results to networks with residual connections and normalization layers, demonstrating similar convergence behaviors. This work provides new insights into the implicit biases of deep neural networks and how architectural choices influence the evolution of representations across layers.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 22 of its 27 references that are in the map. First posted on arXiv 26 Oct 2024.
Builds on
22 of 27 references.
References · 22
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2016Layer Normalizationcited by 5,579
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
- 2013Exact solutions to the nonlinear dynamics of learning in deep linear neural networkscited by 748
- 2019Wide Neural Networks of Any Depth Evolve as Linear Models Under Gradient Descentcited by 732
- 2017Self-Normalizing Neural Networkscited by 591
- 2019On Exact Computation with an Infinitely Wide Neural Netcited by 572
- 2016Exponential expressivity in deep neural networks through transient chaoscited by 260
- 2016Deep Information Propagationcited by 194
- 2019Mean-field theory of two-layers neural networks: dimension-free bounds and kernel limitcited by 187
- 2019Scaling Limits of Wide Neural Networks with Weight Sharing: Gaussian Process Behavior, Gradient Independence, and Neural Tangent Kernel Derivationcited by 146
- 2016Toward Deeper Understanding of Neural Networks: The Power of Initialization and a Dual View on Expressivitycited by 138
10 more
- 2022Signal Propagation in Transformers: Theoretical Perspectives and the Role of Rank Collapsecited by 136
- 2017Resurrecting the sigmoid in deep learning through dynamical isometry: theory and practicecited by 132
- 2019On the Impact of the Activation Function on Deep Neural Networks Trainingcited by 101
- 2018The Emergence of Spectral Universality in Deep Networkscited by 74
- 2019A Mean Field Theory of Batch Normalizationcited by 58
- 2022The Neural Covariance SDE: Shaped Infinite Depth-and-Width Networks at Initializationcited by 41
- 2021Batch Normalization Orthogonalizes Representations in Deep Random Networkscited by 28
- 2023On the impact of activation and normalization in obtaining isometric embeddings at initializationcited by 13
- 2023Towards Training Without Depth Limits: Batch Normalization Without Gradient Explosioncited by 8
- 2022On Bridging the Gap between Mean Field and Finite Width in Deep Random Neural Networks with Batch Normalizationcited by 2
Built on by
Citing papers per year: 2025: 1.
1 paper.