Polylogarithmic width suffices for gradient descent to achieve arbitrarily small test error with shallow ReLU networks
Not on the map. Why?
Abstract (arXiv)
Recent theoretical work has guaranteed that overparameterized networks trained by gradient descent achieve arbitrarily low training error, and sometimes even low test error. The required width, however, is always polynomial in at least one of the sample size n, the (inverse) target error 1/ε, and the (inverse) failure probability 1/δ. This work shows that widetildeTheta(1/ε) iterations of gradient descent with widetildeOmega(1/ε2) training examples on two-layer ReLU networks of any width exceeding polylog(n,1/ε,1/δ) suffice to achieve a test misclassification error of ε. We also prove that stochastic gradient descent can achieve ε test error with polylogarithmic width and widetildeTheta(1/ε) samples. The analysis relies upon the separation margin of the limiting kernel, which is guaranteed positive, can distinguish between true labels and random labels, and can give a tight sample-complexity analysis in the infinite-width setting
Key facts. Cited by 120 papers in the map (data through 7 Oct 2026). First posted on arXiv 26 Sep 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 28; 2022: 35; 2023: 28; 2024: 12; 2025: 10; 2026: 7.
120 papers.
Sort:
By area:
- 2022Hidden Progress in Deep Learning: SGD Learns Parities Near the Computational Limitcited by 184
- 2022High-dimensional Asymptotics of Feature Learning: How One Gradient Step Improves the Representationcited by 146
- 2022Modality Competition: What Makes Joint Training of Multi-modal Network Fail in Deep Learning? (Provably)cited by 115
- 2022Benign Overfitting in Two-layer Convolutional Neural Networkscited by 90
- 2021Gradient Descent on Two-layer Nets: Margin Maximization and Simplicity Biascited by 82
- 2023Dichotomy of Early and Late Phase Implicit Biases Can Provably Induce Grokkingcited by 76
- 2022Benign Overfitting without Linearity: Neural Network Classifiers Trained by Gradient Descent for Noisy Linear Datacited by 74
- 2022Analyzing Sharpness along GD Trajectory: Progressive Sharpening and Edge of Stabilitycited by 61
- 2022AutoBalance: Optimized Loss Functions for Imbalanced Datacited by 49
- 2021Understanding the Generalization of Adam in Learning Neural Networks with Proper Regularizationcited by 48
- 2021On the Proof of Global Convergence of Gradient Descent for Deep ReLU Networks with Linear Widthscited by 44
- 2022Sub-Task Decomposition Enables Learning in Sequence to Sequence Taskscited by 41
38 more
- 2022The Neural Covariance SDE: Shaped Infinite Depth-and-Width Networks at Initializationcited by 41
- 2023On the Optimization and Generalization of Multi-head Attentioncited by 37
- 2022Memorization and Optimization in Deep Neural Networks with Minimum Over-parameterizationcited by 36
- 2023Patch-level Routing in Mixture-of-Experts is Provably Sample-efficient for Convolutional Neural Networkscited by 35
- 2021Early-stopped neural networks are consistentcited by 34
- 2021Does Preprocessing Help Training Over-parameterized Neural Networks?cited by 32
- 2023Continual Learning in Linear Classification on Separable Datacited by 31
- 2022Spectral Evolution and Invariance in Linear-width Neural Networkscited by 30
- 2023A Fast Optimization View: Reformulating Single Layer Attention in LLM Based on Tensor and SVM Trick, and Solving It in Matrix Multiplication Timecited by 30
- 2022Bypass Exponential Time Preprocessing: Fast Neural Network Training via Weight-Data Correlation Preprocessingcited by 29
- 2023A Novel Framework for Policy Mirror Descent with General Parameterization and Linear Convergencecited by 29
- 2021Properties of the After Kernelcited by 27
- 2021Subquadratic Overparameterization for Shallow Neural Networkscited by 26
- 2023How to Protect Copyright Data in Optimization of Large Language Models?cited by 26
- 2021Proxy Convexity: A Unified Framework for the Analysis of Neural Networks Trained by Gradient Descentcited by 21
- 2023Generalization and Stability of Interpolating Neural Networks with Minimal Widthcited by 21
- 2021Towards Understanding Learning in Neural Networks with Linear Teacherscited by 19
- 2023Six Lectures on Linearized Neural Networkscited by 19
- 2021Provable Generalization of SGD-trained Neural Networks of Any Width in the Presence of Adversarial Label Noisecited by 17
- 2021Learning with Density Matrices and Random Featurescited by 17
- 2022Quadratic models for understanding catapult dynamics of neural networkscited by 17
- 2022Finite-Time Analysis of Entropy-Regularized Neural Natural Actor-Critic Algorithmcited by 17
- 2021Learning with Gradient Descent and Weakly Convex Lossescited by 16
- 2022Bounding the Width of Neural Networks via Coupled Initialization -- A Worst Case Analysiscited by 15
- 2023Understanding Multi-phase Optimization Dynamics and Rich Nonlinear Behaviors of ReLU Networkscited by 15
- 2023Provable Multi-Task Representation Learning by Two-Layer ReLU Neural Networkscited by 15
- 2021The Separation Capacity of Random Neural Networkscited by 14
- 2021Understanding Square Loss in Training Overparametrized Neural Network Classifierscited by 14
- 2024Differential Privacy Mechanisms in Neural Tangent Kernel Regressioncited by 14
- 2021On the Generalization Power of Overfitted Two-Layer Neural Tangent Kernel Modelscited by 13
- 2021Actor-critic is implicitly biased towards high entropy optimal policiescited by 13
- 2022Feature selection with gradient descent on two-layer networks in low-rotation regimescited by 13
- 2023A Unified Approach to Controlling Implicit Regularization via Mirror Descentcited by 13
- 2023A Unified Scheme of ResNet and Softmaxcited by 12
- 2021The Dynamics of Gradient Descent for Overparametrized Neural Networkscited by 11
- 2021On the Convergence of Shallow Neural Network Training with Randomly Masked Neuronscited by 11
- 2022Spectral Bias Outside the Training Set for Deep Networks in the Kernel Regimecited by 11
- 2023Unmasking Transformers: A Theoretical Approach to Data Recovery via Attention Weightscited by 11
50 most cited of 120 All 120 (JSON)
- 2026Non-asymptotic implicit bias of logistic regression at early-stage gradient descent dynamics5 Aug 2026
- 2026Geometric Dyson Brownian Motions and the Free Log-Normal Limit for a Non-Square Gaussian Matrix Product29 Jun 2026
- 2026Optimal Rates for Generalization of Gradient Descent Methods with Deep Neural Networks4 Jun 2026
- 2026Label-NTK Alignments and A Tighter Convergence Bound in the NTK Regime24 May 2026
- 2026Towards Initialization-dependent and Non-vacuous Generalization Bounds for Overparameterized Shallow Neural Networks1 Apr 2026
- 2026Sufficient Conditions for Stability of Minimum-Norm Interpolating Deep ReLU Networks14 Feb 2026
- 2026Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks29 Jan 2026
- 2025Non-Asymptotic Optimization and Generalization Bounds for Stochastic Gauss-Newton in Overparameterized Models6 Nov 2025
- 2025On the Theory of Continual Learning with Gradient Descent for Neural Networks7 Oct 2025
- 2025Optimal Rates for Generalization of Gradient Descent for Deep ReLU Classification3 Oct 2025
- 2025Data Uniformity Improves Training Efficiency and More, with a Convergence Framework Beyond the NTK Regime30 Jun 2025
- 2025Divergence of Empirical Neural Tangent Kernel in Classification Problems15 Apr 2025
38 more
- 2025Langevin Monte-Carlo Provably Learns Depth Two Neural Nets at Any Size and Data13 Mar 2025
- 2025Generalizability of Neural Networks Minimizing Empirical Risk Based on Expressive Ability6 Mar 2025
- 2025Low-rank bias, weight decay, and model merging in neural networks24 Feb 2025
- 2025Benefits of Early Stopping in Gradient Descent for Overparameterized Logistic Regression18 Feb 2025
- 2025Random Sparse Lifts: Construction, Analysis and Convergence of finite sparse networks10 Jan 2025
- 2024A Riemannian Optimization Perspective of the Gauss-Newton Method for Feedforward Neural Networks18 Dec 2024
- 2024Understanding Transfer Learning via Mean-field Analysis22 Oct 2024
- 2024Sharper Guarantees for Learning Neural Network Classifiers with Gradient Methods13 Oct 2024
- 2024BiDoRA: Bi-level Optimization-Based Weight-Decomposed Low-Rank Adaptation13 Oct 2024
- 2024Differential Privacy Mechanisms in Neural Tangent Kernel Regression18 Jul 2024
- 2024Generalization Bound and New Algorithm for Clean-Label Backdoor Attack2 Jun 2024
- 2024Performance of NPG in Countable State-Space Average-Cost RL30 May 2024
- 2024Recurrent Natural Policy Gradient for POMDPs28 May 2024
- 2024Approximation and Gradient Descent Training with Neural Networks19 May 2024
- 2024Convergence of Gradient Descent for Recurrent Neural Networks: A Nonasymptotic Analysis19 Feb 2024
- 2024Fixed width treelike neural networks capacity analysis -- generic activations8 Feb 2024
- 2024Convex Relaxations of ReLU Neural Networks Approximate Global Optima in Polynomial Time6 Feb 2024
- 2023Lifted RDT based capacity analysis of the 1-hidden layer treelike sign perceptrons neural networks13 Dec 2023
- 2023Capacity of the treelike sign perceptrons neural networks with one hidden layer -- RDT based upper bounds13 Dec 2023
- 2023Dichotomy of Early and Late Phase Implicit Biases Can Provably Induce Grokking30 Nov 2023
- 2023Local Convergence of Approximate Newton Method for Two Layer Nonlinear Regression26 Nov 2023
- 2023A Theoretical Insight into Attack and Defense of Gradient Leakage in Transformer22 Nov 2023
- 2023On the Optimization and Generalization of Multi-head Attention19 Oct 2023
- 2023Unmasking Transformers: A Theoretical Approach to Data Recovery via Attention Weights19 Oct 2023
- 2023An Automatic Learning Rate Schedule Algorithm for Achieving Faster Convergence and Steeper Descent17 Oct 2023
- 2023Fixing the NTK: From Neural Network Linearizations to Exact Convex Programs26 Sep 2023
- 2023A Unified Scheme of ResNet and Softmax23 Sep 2023
- 2023Global Convergence of SGD For Logistic Loss on Two Layer Neural Nets17 Sep 2023
- 2023A Fast Optimization View: Reformulating Single Layer Attention in LLM Based on Tensor and SVM Trick, and Solving It in Matrix Multiplication Time14 Sep 2023
- 2023Approximation Results for Gradient Descent trained Neural Networks9 Sep 2023
- 2023Six Lectures on Linearized Neural Networks25 Aug 2023
- 2023How to Protect Copyright Data in Optimization of Large Language Models?23 Aug 2023
- 2023Convergence of Two-Layer Regression with Nonlinear Units16 Aug 2023
- 2023Provable Multi-Task Representation Learning by Two-Layer ReLU Neural Networks13 Jul 2023
- 2023A Unified Approach to Controlling Implicit Regularization via Mirror Descent24 Jun 2023
- 2023On Achieving Optimal Adversarial Test Error13 Jun 2023
- 2023Patch-level Routing in Mixture-of-Experts is Provably Sample-efficient for Convolutional Neural Networks7 Jun 2023
- 2023Continual Learning in Linear Classification on Separable Data6 Jun 2023
50 newest of 120 All 120 (JSON)
- 2022Hidden Progress in Deep Learning: SGD Learns Parities Near the Computational Limitcited by 184
- 2022High-dimensional Asymptotics of Feature Learning: How One Gradient Step Improves the Representationcited by 146
- 2022Modality Competition: What Makes Joint Training of Multi-modal Network Fail in Deep Learning? (Provably)cited by 115
- 2022Benign Overfitting in Two-layer Convolutional Neural Networkscited by 90
- 2021Gradient Descent on Two-layer Nets: Margin Maximization and Simplicity Biascited by 82
- 2023Dichotomy of Early and Late Phase Implicit Biases Can Provably Induce Grokkingcited by 76
- 2022Benign Overfitting without Linearity: Neural Network Classifiers Trained by Gradient Descent for Noisy Linear Datacited by 74
- 2022Analyzing Sharpness along GD Trajectory: Progressive Sharpening and Edge of Stabilitycited by 61
- 2022AutoBalance: Optimized Loss Functions for Imbalanced Datacited by 49
- 2021Understanding the Generalization of Adam in Learning Neural Networks with Proper Regularizationcited by 48
- 2021On the Proof of Global Convergence of Gradient Descent for Deep ReLU Networks with Linear Widthscited by 44
- 2022Sub-Task Decomposition Enables Learning in Sequence to Sequence Taskscited by 41
12 most cited of 119 All 119 (JSON)
- 2026Non-asymptotic implicit bias of logistic regression at early-stage gradient descent dynamics5 Aug 2026
- 2026Geometric Dyson Brownian Motions and the Free Log-Normal Limit for a Non-Square Gaussian Matrix Product29 Jun 2026
- 2026Optimal Rates for Generalization of Gradient Descent Methods with Deep Neural Networks4 Jun 2026
- 2026Label-NTK Alignments and A Tighter Convergence Bound in the NTK Regime24 May 2026
- 2026Towards Initialization-dependent and Non-vacuous Generalization Bounds for Overparameterized Shallow Neural Networks1 Apr 2026
- 2026Sufficient Conditions for Stability of Minimum-Norm Interpolating Deep ReLU Networks14 Feb 2026
- 2026Optimization, Generalization and Differential Privacy Bounds for Gradient Descent on Kolmogorov-Arnold Networks29 Jan 2026
- 2025Non-Asymptotic Optimization and Generalization Bounds for Stochastic Gauss-Newton in Overparameterized Models6 Nov 2025
- 2025On the Theory of Continual Learning with Gradient Descent for Neural Networks7 Oct 2025
- 2025Optimal Rates for Generalization of Gradient Descent for Deep ReLU Classification3 Oct 2025
- 2025Data Uniformity Improves Training Efficiency and More, with a Convergence Framework Beyond the NTK Regime30 Jun 2025
- 2025Divergence of Empirical Neural Tangent Kernel in Classification Problems15 Apr 2025
12 newest of 119 All 119 (JSON)