Generalization and Expressivity for Deep Nets
Not on the map. Why?
Abstract (arXiv)
Along with the rapid development of deep learning in practice, the theoretical explanations for its success become urgent. Generalization and expressivity are two widely used measurements to quantify theoretical behaviors of deep learning. The expressivity focuses on finding functions expressible by deep nets but cannot be approximated by shallow nets with the similar number of neurons. It usually implies the large capacity. The generalization aims at deriving fast learning rate for deep nets. It usually requires small capacity to reduce the variance. Different from previous studies on deep learning, pursuing either expressivity or generalization, we take both factors into account to explore the theoretical advantages of deep nets. For this purpose, we construct a deep net with two hidden layers possessing excellent expressivity in terms of localized and sparse approximation. Then, utilizing the well known covering number to measure the capacity, we find that deep nets possess excellent expressive power (measured by localized and sparse approximation) without enlarging the capacity of shallow nets. As a consequence, we derive near optimal learning rates for implementing empirical risk minimization (ERM) on the constructed deep nets. These results theoretically exhibit the advantage of deep nets from learning theory viewpoints.
Key facts. Cited by 11 papers in the map (data through 14 Oct 2026). First posted on arXiv 10 Mar 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 4; 2022: 1; 2023: 4; 2024: 1; 2025: 1.
11 papers.
- 2023Zero-Shot Neural Architecture Search: Challenges, Solutions, and Opportunitiescited by 21
- 2021Universal Consistency of Deep Convolutional Neural Networkscited by 16
- 2023Discovering interpretable elastoplasticity models via the neural polynomial method enabled symbolic regressionscited by 10
- 2021Generalization Performance of Empirical Risk Minimization on Over-parameterized Deep ReLU Netscited by 4
- 2023Deep Convolutional Neural Networks with Zero-Padding: Feature Extraction and Learningcited by 4
- 2022A Dynamics Theory of Implicit Regularization in Deep Low-Rank Matrix Factorizationcited by 1
- 2024Component-based Sketching for Deep ReLU Netscited by 1
- 2021Painless step size adaptation for SGDcited by 0
- 2021Neurons learn slower than they thinkcited by 0
- 2023Lifting the Veil: Unlocking the Power of Depth in Q-learningcited by 0
- 2025Feature Qualification by Deep Nets: A Constructive Approachcited by 0
- 2025Feature Qualification by Deep Nets: A Constructive Approach24 Mar 2025
- 2024Component-based Sketching for Deep ReLU Nets21 Sep 2024
- 2023Lifting the Veil: Unlocking the Power of Depth in Q-learning27 Oct 2023
- 2023Deep Convolutional Neural Networks with Zero-Padding: Feature Extraction and Learning30 Jul 2023
- 2023Discovering interpretable elastoplasticity models via the neural polynomial method enabled symbolic regressions24 Jul 2023
- 2023Zero-Shot Neural Architecture Search: Challenges, Solutions, and Opportunities5 Jul 2023
- 2022A Dynamics Theory of Implicit Regularization in Deep Low-Rank Matrix Factorization29 Dec 2022
- 2021Generalization Performance of Empirical Risk Minimization on Over-parameterized Deep ReLU Nets28 Nov 2021
- 2021Universal Consistency of Deep Convolutional Neural Networks23 Jun 2021
- 2021Neurons learn slower than they think2 Apr 2021
- 2021Painless step size adaptation for SGD1 Feb 2021