Understanding Weight Normalized Deep Neural Networks with Rectified Linear Units
Not on the map. Why?
Abstract (arXiv)
This paper presents a general framework for norm-based capacity control for Lp,q weight normalized deep neural networks. We establish the upper bound on the Rademacher complexities of this family. With an Lp,q normalization where q≤ p^*, and 1/p+1/p*=1, we discuss properties of a width-independent capacity control, which only depends on depth by a square root term. We further analyze the approximation properties of Lp,q weight normalized deep neural networks. In particular, for an L1,∞ weight normalized network, the approximation error can be controlled by the L1 norm of the output layer, and the corresponding generalization error only depends on the architecture by the square root of the depth.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). First posted on arXiv 3 Oct 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 0; 2024: 1.
2 papers.
- 2024Hidden Synergy: L1 Weight Normalization and 1-Path-Norm Regularizationcited by 1
- 2021A Statistician Teaches Deep Learningcited by 0
- 2024Hidden Synergy: L1 Weight Normalization and 1-Path-Norm Regularization29 Apr 2024
- 2021A Statistician Teaches Deep Learning29 Jan 2021