A Deep Conditioning Treatment of Neural Networks
Not on the map. Why?
Abstract (arXiv)
We study the role of depth in training randomly initialized overparameterized neural networks. We give a general result showing that depth improves trainability of neural networks by improving the conditioning of certain kernel matrices of the input data. This result holds for arbitrary non-linear activation functions under a certain normalization. We provide versions of the result that hold for training just the top layer of the neural network, as well as for training all layers, via the neural tangent kernel. As applications of these general results, we provide a generalization of the results of Das et al. (2019) showing that learnability of deep random neural networks with a large class of non-linear activations degrades exponentially with depth. We also show how benign overfitting can occur in deep neural networks via the results of Bartlett et al. (2019b). We also give experimental evidence that normalized versions of ReLU are a viable alternative to more complex operations like Batch Normalization in training deep neural networks.
Key facts. Cited by 15 papers in the map (data through 13 Oct 2026). First posted on arXiv 4 Feb 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 4; 2022: 3; 2023: 2; 2024: 0; 2025: 4; 2026: 2.
15 papers.
Sort:
- 2021Batch Normalization Orthogonalizes Representations in Deep Random Networkscited by 29
- 2022Hardness of Noise-Free Learning for Two-Hidden-Layer Neural Networkscited by 28
- 2021From Local Pseudorandom Generators to Hardness of Learningcited by 24
- 2022AESPA: Accuracy Preserving Low-degree Polynomial Activation for Fast Private Inferencecited by 14
- 2022Learning (Very) Simple Generative Models Is Hardcited by 9
- 2023On the average-case complexity of learning output distributions of quantum circuitscited by 9
- 2025Cutting the Skip: Training Residual-Free Transformerscited by 8
- 2021A quantum algorithm for training wide and deep classical neural networkscited by 6
- 2025Leaner Transformers: More Heads, Less Depthcited by 5
- 2021Universal scaling laws in the gradient descent training of neural networkscited by 4
- 2025Feel-Good Thompson Sampling for Contextual Bandits: a Markov Chain Monte Carlo Showdowncited by 4
- 2025Enhancing Transformers Through Conditioned Embedded Tokenscited by 3
3 more
- 2026Spectral Conditioning of Attention Improves Transformer Performancecited by 3
- 2023Most Neural Networks Are Almost Learnablecited by 2
- 2026Conditioned Initialization for Attentioncited by 0
- 2026Conditioned Initialization for Attention7 Sep 2026
- 2026Spectral Conditioning of Attention Improves Transformer Performance7 Mar 2026
- 2025Cutting the Skip: Training Residual-Free Transformers30 Sep 2025
- 2025Feel-Good Thompson Sampling for Contextual Bandits: a Markov Chain Monte Carlo Showdown21 Jul 2025
- 2025Leaner Transformers: More Heads, Less Depth27 May 2025
- 2025Enhancing Transformers Through Conditioned Embedded Tokens19 May 2025
- 2023Most Neural Networks Are Almost Learnable25 May 2023
- 2023On the average-case complexity of learning output distributions of quantum circuits9 May 2023
- 2022Learning (Very) Simple Generative Models Is Hard31 May 2022
- 2022Hardness of Noise-Free Learning for Two-Hidden-Layer Neural Networks10 Feb 2022
- 2022AESPA: Accuracy Preserving Low-degree Polynomial Activation for Fast Private Inference18 Jan 2022
- 2021A quantum algorithm for training wide and deep classical neural networks19 Jul 2021
- 2021Batch Normalization Orthogonalizes Representations in Deep Random Networkscited by 29
- 2022Hardness of Noise-Free Learning for Two-Hidden-Layer Neural Networkscited by 28
- 2021From Local Pseudorandom Generators to Hardness of Learningcited by 24
- 2022AESPA: Accuracy Preserving Low-degree Polynomial Activation for Fast Private Inferencecited by 14
- 2022Learning (Very) Simple Generative Models Is Hardcited by 9
- 2023On the average-case complexity of learning output distributions of quantum circuitscited by 9
- 2025Cutting the Skip: Training Residual-Free Transformerscited by 8
- 2021A quantum algorithm for training wide and deep classical neural networkscited by 6
- 2025Leaner Transformers: More Heads, Less Depthcited by 5
- 2021Universal scaling laws in the gradient descent training of neural networkscited by 4
- 2025Feel-Good Thompson Sampling for Contextual Bandits: a Markov Chain Monte Carlo Showdowncited by 4
- 2025Enhancing Transformers Through Conditioned Embedded Tokenscited by 3
12 most cited of 15 All 15 (JSON)
- 2026Conditioned Initialization for Attention7 Sep 2026
- 2026Spectral Conditioning of Attention Improves Transformer Performance7 Mar 2026
- 2025Cutting the Skip: Training Residual-Free Transformers30 Sep 2025
- 2025Feel-Good Thompson Sampling for Contextual Bandits: a Markov Chain Monte Carlo Showdown21 Jul 2025
- 2025Leaner Transformers: More Heads, Less Depth27 May 2025
- 2025Enhancing Transformers Through Conditioned Embedded Tokens19 May 2025
- 2023Most Neural Networks Are Almost Learnable25 May 2023
- 2023On the average-case complexity of learning output distributions of quantum circuits9 May 2023
- 2022Learning (Very) Simple Generative Models Is Hard31 May 2022
- 2022Hardness of Noise-Free Learning for Two-Hidden-Layer Neural Networks10 Feb 2022
- 2022AESPA: Accuracy Preserving Low-degree Polynomial Activation for Fast Private Inference18 Jan 2022
- 2021A quantum algorithm for training wide and deep classical neural networks19 Jul 2021
12 newest of 15 All 15 (JSON)