Capacity Control of ReLU Neural Networks by Basis-path Norm
Not on the map. Why?
Abstract (arXiv)
Recently, path norm was proposed as a new capacity measure for neural networks with Rectified Linear Unit (ReLU) activation function, which takes the rescaling-invariant property of ReLU into account. It has been shown that the generalization error bound in terms of the path norm explains the empirical generalization behaviors of the ReLU neural networks better than that of other capacity measures. Moreover, optimization algorithms which take path norm as the regularization term to the loss function, like Path-SGD, have been shown to achieve better generalization performance. However, the path norm counts the values of all paths, and hence the capacity measure based on path norm could be improperly influenced by the dependency among different paths. It is also known that each path of a ReLU network can be represented by a small group of linearly independent basis paths with multiplication and division operation, which indicates that the generalization behavior of the network only depends on only a few basis paths. Motivated by this, we propose a new norm Basis-path Norm based on a group of linearly independent paths to measure the capacity of neural networks more accurately. We establish a generalization error bound based on this basis path norm, and show it explains the generalization behaviors of ReLU networks more accurately than previous capacity measures via extensive experiments. In addition, we develop optimization algorithms which minimize the empirical risk regularized by the basis-path norm. Our experiments on benchmark datasets demonstrate that the proposed regularization method achieves clearly better performance on the test set than the previous regularization approaches.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). First posted on arXiv 19 Sep 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 4; 2022: 2; 2023: 1; 2024: 2; 2025: 1.
10 papers.
- 2021Model Complexity of Deep Learning: A Surveycited by 64
- 2022Small Transformers Compute Universal Metric Embeddingscited by 12
- 2023A path-norm toolkit for modern networks: consequences, promises and challengescited by 10
- 2021LocalDrop: A Hybrid Regularization for Deep Neural Networkscited by 8
- 2021Accelerating Training of Batch Normalization: A Manifold Perspectivecited by 4
- 2021Analytic function approximation by path norm regularized deep networkscited by 3
- 2022Quantifying the Impact of Label Noise on Federated Learningcited by 3
- 2024Hidden Synergy: L1 Weight Normalization and 1-Path-Norm Regularizationcited by 1
- 2024A priori Estimates for Deep Residual Network in Continuous-time Reinforcement Learningcited by 0
- 2025Path Regularization: A Near-Complete and Optimal Nonasymptotic Generalization Theory for Multilayer Neural Networks and Double Descent Phenomenoncited by 0
- 2025Path Regularization: A Near-Complete and Optimal Nonasymptotic Generalization Theory for Multilayer Neural Networks and Double Descent Phenomenon3 Mar 2025
- 2024Hidden Synergy: L1 Weight Normalization and 1-Path-Norm Regularization29 Apr 2024
- 2024A priori Estimates for Deep Residual Network in Continuous-time Reinforcement Learning24 Feb 2024
- 2023A path-norm toolkit for modern networks: consequences, promises and challenges2 Oct 2023
- 2022Quantifying the Impact of Label Noise on Federated Learning15 Nov 2022
- 2022Small Transformers Compute Universal Metric Embeddings14 Sep 2022
- 2021Analytic function approximation by path norm regularized deep networks5 Apr 2021
- 2021Model Complexity of Deep Learning: A Survey8 Mar 2021
- 2021LocalDrop: A Hybrid Regularization for Deep Neural Networks1 Mar 2021
- 2021Accelerating Training of Batch Normalization: A Manifold Perspective8 Jan 2021