A Priori Estimates of the Population Risk for Residual Networks
Not on the map. Why?
Abstract (arXiv)
Optimal a priori estimates are derived for the population risk, also known as the generalization error, of a regularized residual network model. An important part of the regularized model is the usage of a new path norm, called the weighted path norm, as the regularization term. The weighted path norm treats the skip connections and the nonlinearities differently so that paths with more nonlinearities are regularized by larger weights. The error estimates are a priori in the sense that the estimates depend only on the target function, not on the parameters obtained in the training process. The estimates are optimal, in a high dimensional setting, in the sense that both the bound for the approximation and estimation errors are comparable to the Monte Carlo error rates. A crucial step in the proof is to establish an optimal bound for the Rademacher complexity of the residual networks. Comparisons are made with existing norm-based generalization error bounds.
Key facts. Cited by 14 papers in the map (data through 7 Oct 2026). First posted on arXiv 6 Mar 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 7; 2022: 4; 2023: 0; 2024: 2; 2025: 0; 2026: 1.
14 papers.
Sort:
By area:
- 2021Optimal Approximation Rate of ReLU Networks in terms of Width and Depthcited by 95
- 2021Deep Network Approximation: Achieving Arbitrary Accuracy with Fixed Number of Neuronscited by 41
- 2024Towards Theoretical Understandings of Self-Consuming Generative Modelscited by 28
- 2021Reproducing Activation Function for Deep Learningcited by 19
- 2022Generalization Error Bounds for Deep Neural Networks Trained by SGDcited by 14
- 2021Deep Network Approximation in Terms of Intrinsic Parameterscited by 12
- 2021Generalization Error of GAN from the Discriminator's Perspectivecited by 8
- 2022A Mathematical Framework for Learning Probability Distributionscited by 7
- 2022Optimal bump functions for shallow ReLU networks: Weight decay, depth separation and the curse of dimensionalitycited by 4
- 2022Why the pseudo label based semi-supervised learning algorithm is effective?cited by 3
- 2021Approximation properties of Residual Neural Networks for Kolmogorov PDEscited by 2
- 2021Nonlinear Weighted Directed Acyclic Graph and A Priori Estimates for Neural Networkscited by 0
- 2026A First-Principles Theory of Slow Thinking and Active Perception9 Jul 2026
- 2024A priori Estimates for Deep Residual Network in Continuous-time Reinforcement Learning24 Feb 2024
- 2024Towards Theoretical Understandings of Self-Consuming Generative Models19 Feb 2024
- 2022A Mathematical Framework for Learning Probability Distributions22 Dec 2022
- 2022Why the pseudo label based semi-supervised learning algorithm is effective?18 Nov 2022
- 2022Optimal bump functions for shallow ReLU networks: Weight decay, depth separation and the curse of dimensionality2 Sep 2022
- 2022Generalization Error Bounds for Deep Neural Networks Trained by SGD7 Jun 2022
- 2021Deep Network Approximation in Terms of Intrinsic Parameters15 Nov 2021
- 2021Approximation properties of Residual Neural Networks for Kolmogorov PDEs30 Oct 2021
- 2021Generalization Error of GAN from the Discriminator's Perspective8 Jul 2021
- 2021Deep Network Approximation: Achieving Arbitrary Accuracy with Fixed Number of Neurons6 Jul 2021
- 2021Nonlinear Weighted Directed Acyclic Graph and A Priori Estimates for Neural Networks30 Mar 2021
2 more
- 2021Optimal Approximation Rate of ReLU Networks in terms of Width and Depth28 Feb 2021
- 2021Reproducing Activation Function for Deep Learning13 Jan 2021
- 2021Optimal Approximation Rate of ReLU Networks in terms of Width and Depthcited by 95
- 2021Deep Network Approximation: Achieving Arbitrary Accuracy with Fixed Number of Neuronscited by 41
- 2024Towards Theoretical Understandings of Self-Consuming Generative Modelscited by 28
- 2021Reproducing Activation Function for Deep Learningcited by 19
- 2022Generalization Error Bounds for Deep Neural Networks Trained by SGDcited by 14
- 2021Deep Network Approximation in Terms of Intrinsic Parameterscited by 12
- 2021Generalization Error of GAN from the Discriminator's Perspectivecited by 8
- 2022A Mathematical Framework for Learning Probability Distributionscited by 7
- 2022Optimal bump functions for shallow ReLU networks: Weight decay, depth separation and the curse of dimensionalitycited by 4
- 2022Why the pseudo label based semi-supervised learning algorithm is effective?cited by 3
- 2021Approximation properties of Residual Neural Networks for Kolmogorov PDEscited by 2
- 2021Nonlinear Weighted Directed Acyclic Graph and A Priori Estimates for Neural Networkscited by 0
12 most cited of 13 All 13 (JSON)
- 2024A priori Estimates for Deep Residual Network in Continuous-time Reinforcement Learning24 Feb 2024
- 2024Towards Theoretical Understandings of Self-Consuming Generative Models19 Feb 2024
- 2022A Mathematical Framework for Learning Probability Distributions22 Dec 2022
- 2022Why the pseudo label based semi-supervised learning algorithm is effective?18 Nov 2022
- 2022Optimal bump functions for shallow ReLU networks: Weight decay, depth separation and the curse of dimensionality2 Sep 2022
- 2022Generalization Error Bounds for Deep Neural Networks Trained by SGD7 Jun 2022
- 2021Deep Network Approximation in Terms of Intrinsic Parameters15 Nov 2021
- 2021Approximation properties of Residual Neural Networks for Kolmogorov PDEs30 Oct 2021
- 2021Generalization Error of GAN from the Discriminator's Perspective8 Jul 2021
- 2021Deep Network Approximation: Achieving Arbitrary Accuracy with Fixed Number of Neurons6 Jul 2021
- 2021Nonlinear Weighted Directed Acyclic Graph and A Priori Estimates for Neural Networks30 Mar 2021
- 2021Optimal Approximation Rate of ReLU Networks in terms of Width and Depth28 Feb 2021
12 newest of 13 All 13 (JSON)