Better NTK Conditioning: A Free Lunch from (ReLU) Nonlinear Activation in Wide Neural Networks
Not on the map. Why?
Abstract (arXiv)
Nonlinear activation functions are widely recognized for enhancing the expressivity of neural networks, which is the primary reason for their widespread implementation. In this work, we focus on ReLU activation and reveal a novel and intriguing property of nonlinear activations. By comparing enabling and disabling the nonlinear activations in the neural network, we demonstrate their specific effects on wide neural networks: (a) better feature separation, i.e., a larger angle separation for similar data in the feature space of model gradient, and (b) better NTK conditioning, i.e., a smaller condition number of neural tangent kernel (NTK). Furthermore, we show that the network depth (i.e., with more nonlinear activation operations) further amplifies these effects; in addition, in the infinite-width-then-depth limit, all data are equally separated with a fixed angle in the model gradient feature space, regardless of how similar they are originally in the input space. Note that, without the nonlinear activation, i.e., in a linear neural network, the data separation remains the same as for the original inputs and NTK condition number is equivalent to the Gram matrix, regardless of the network depth. Due to the close connection between NTK condition number and convergence theories, our results imply that nonlinear activation helps to improve the worst-case convergence rates of gradient based methods.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 28 of its 39 references that are in the map. First posted on arXiv 15 May 2023.
Builds on
28 of 39 references.
References · 28
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
- 2018A Convergence Theory for Deep Learning via Over-Parameterizationcited by 784
- 2019Wide Neural Networks of Any Depth Evolve as Linear Models Under Gradient Descentcited by 732
- 2018Gradient Descent Provably Optimizes Over-parameterized Neural Networkscited by 655
- 2018Gradient Descent Finds Global Minima of Deep Neural Networkscited by 572
- 2014On the Number of Linear Regions of Deep Neural Networkscited by 378
- 2016On the Expressive Power of Deep Neural Networkscited by 302
- 2018On the Optimization of Deep Networks: Implicit Acceleration by Overparameterizationcited by 280
- 2016Exponential expressivity in deep neural networks through transient chaoscited by 260
- 2020Loss landscapes and optimization in over-parameterized non-linear systems and neural networkscited by 231
- 2016Deep Information Propagationcited by 194
16 more
- 2019On the Inductive Bias of Neural Tangent Kernelscited by 177
- 2019Towards moderate overparameterization: global convergence guarantees for training shallow neural networkscited by 176
- 2020Evaluation of Neural Architectures Trained with Square Loss vs Cross-Entropy in Classification Taskscited by 137
- 2019The Convergence Rate of Neural Networks for Learned Functions of Different Frequenciescited by 134
- 2020On the linearity of large non-linear models: when and why the tangent kernel is constantcited by 129
- 2017Theoretical insights into the optimization landscape of over-parameterized shallow neural networkscited by 128
- 2017Approximating Continuous Functions by ReLU Nets of Minimal Widthcited by 120
- 2020Tight Bounds on the Smallest Eigenvalue of the Neural Tangent Kernel for Deep ReLU Networkscited by 87
- 2015Representation Benefits of Deep Feedforward Networkscited by 84
- 2020Spectra of the Conjugate Kernel and Neural Tangent Kernel for linear-width neural networkscited by 76
- 2020On the Similarity between the Laplace and Neural Tangent Kernelscited by 76
- 2020Deep Neural Tangent Kernel and Laplace Kernel Have the Same RKHScited by 74
- 2020Why Do Deep Residual Networks Generalize Better than Deep Feedforward Networks? -- A Neural Tangent Kernel Perspectivecited by 60
- 2018Exponential Convergence of the Deep Neural Network Approximation for Analytic Functionscited by 38
- 2022Characterizing the Spectrum of the NTK via a Power Series Expansioncited by 22
- 2021Spectral Analysis of the Neural Tangent Kernel for Deep Residual Networkscited by 20
Built on by
Citing papers per year: 2024: 4; 2025: 0; 2026: 2.
6 papers.
- 2024Average gradient outer product as a mechanism for deep neural collapsecited by 21
- 2024Analysis of Deep Image Prior and Exploiting Self-Guidance for Image Reconstructioncited by 11
- 2024Fast Training of Sinusoidal Neural Fields via Scaling Initializationcited by 11
- 2024Theoretical characterisation of the Gauss-Newton conditioning in Neural Networkscited by 5
- 2026The Devil is in the Condition Numbers: Why is GLU Better than non-GLU Structure?cited by 0
- 2026Label-NTK Alignments and A Tighter Convergence Bound in the NTK Regimecited by 0
- 2026Label-NTK Alignments and A Tighter Convergence Bound in the NTK Regime24 May 2026
- 2026The Devil is in the Condition Numbers: Why is GLU Better than non-GLU Structure?20 May 2026
- 2024Theoretical characterisation of the Gauss-Newton conditioning in Neural Networks4 Nov 2024
- 2024Fast Training of Sinusoidal Neural Fields via Scaling Initialization7 Oct 2024
- 2024Average gradient outer product as a mechanism for deep neural collapse21 Feb 2024
- 2024Analysis of Deep Image Prior and Exploiting Self-Guidance for Image Reconstruction6 Feb 2024