Degrees of Freedom in Deep Neural Networks
Not on the map. Why?
Abstract (arXiv)
In this paper, we explore degrees of freedom in deep sigmoidal neural networks. We show that the degrees of freedom in these models is related to the expected optimism, which is the expected difference between test error and training error. We provide an efficient Monte-Carlo method to estimate the degrees of freedom for multi-class classification methods. We show degrees of freedom are lower than the parameter count in a simple XOR network. We extend these results to neural nets trained on synthetic and real data, and investigate impact of network's architecture and different regularization choices. The degrees of freedom in deep networks are dramatically smaller than the number of parameters, in some real datasets several orders of magnitude. Further, we observe that for fixed number of parameters, deeper networks have less degrees of freedom exhibiting a regularization-by-depth.
Key facts. Cited by 14 papers in the map (data through 7 Oct 2026). First posted on arXiv 30 Mar 2016.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 5; 2022: 5; 2023: 0; 2024: 0; 2025: 2; 2026: 2.
14 papers.
Sort:
By area:
- 2021Fast Yet Effective Machine Unlearningcited by 209
- 2021Intrinsic Dimension, Persistent Homology and Generalization in Neural Networkscited by 70
- 2021Rethinking Deep Image Prior for Denoisingcited by 38
- 2022Why neural networks find simple solutions: the many regularizers of geometric complexitycited by 38
- 2022Model Stability with Continuous Data Updatescited by 9
- 2022Relating Regularization and Generalization through the Intrinsic Dimension of Activationscited by 9
- 2021The Geometric Occam's Razor Implicit in Deep Learningcited by 7
- 2021A generalization gap estimation for overparameterized models via the Langevin functional variancecited by 2
- 2022Constructing Prediction Intervals with Neural Networks: An Empirical Evaluation of Bootstrapping and Conformal Inference Methodscited by 2
- 2025Sparsity-Driven Plasticity in Multi-Task Reinforcement Learningcited by 2
- 2025Geometric Analysis of Neural Regression Collapse via Intrinsic Dimensioncited by 1
- 2026On the Rate-Distortion-Complexity Tradeoff for Semantic Communicationcited by 1
- 2026A Rigorous, Tractable Measure of Model Complexity20 May 2026
- 2026On the Rate-Distortion-Complexity Tradeoff for Semantic Communication16 Feb 2026
- 2025Geometric Analysis of Neural Regression Collapse via Intrinsic Dimension1 Oct 2025
- 2025Sparsity-Driven Plasticity in Multi-Task Reinforcement Learning9 Aug 2025
- 2022Relating Regularization and Generalization through the Intrinsic Dimension of Activations23 Nov 2022
- 2022Constructing Prediction Intervals with Neural Networks: An Empirical Evaluation of Bootstrapping and Conformal Inference Methods7 Oct 2022
- 2022Bayesian Neural Networks for Geothermal Resource Assessment: Prediction with Uncertainty30 Sep 2022
- 2022Why neural networks find simple solutions: the many regularizers of geometric complexity27 Sep 2022
- 2022Model Stability with Continuous Data Updates14 Jan 2022
- 2021A generalization gap estimation for overparameterized models via the Langevin functional variance7 Dec 2021
- 2021The Geometric Occam's Razor Implicit in Deep Learning30 Nov 2021
- 2021Intrinsic Dimension, Persistent Homology and Generalization in Neural Networks25 Nov 2021
2 more
- 2021Fast Yet Effective Machine Unlearning17 Nov 2021
- 2021Rethinking Deep Image Prior for Denoising29 Aug 2021
- 2021Fast Yet Effective Machine Unlearningcited by 209
- 2021Fast Yet Effective Machine Unlearning17 Nov 2021
- 2021Intrinsic Dimension, Persistent Homology and Generalization in Neural Networkscited by 70
- 2021Rethinking Deep Image Prior for Denoisingcited by 38
- 2022Why neural networks find simple solutions: the many regularizers of geometric complexitycited by 38
- 2022Model Stability with Continuous Data Updatescited by 9
- 2022Relating Regularization and Generalization through the Intrinsic Dimension of Activationscited by 9
- 2021The Geometric Occam's Razor Implicit in Deep Learningcited by 7
- 2021A generalization gap estimation for overparameterized models via the Langevin functional variancecited by 2
- 2022Constructing Prediction Intervals with Neural Networks: An Empirical Evaluation of Bootstrapping and Conformal Inference Methodscited by 2
- 2025Sparsity-Driven Plasticity in Multi-Task Reinforcement Learningcited by 2
- 2025Geometric Analysis of Neural Regression Collapse via Intrinsic Dimensioncited by 1
- 2026On the Rate-Distortion-Complexity Tradeoff for Semantic Communicationcited by 1
- 2022Bayesian Neural Networks for Geothermal Resource Assessment: Prediction with Uncertaintycited by 0
12 most cited of 13 All 13 (JSON)
- 2026A Rigorous, Tractable Measure of Model Complexity20 May 2026
- 2026On the Rate-Distortion-Complexity Tradeoff for Semantic Communication16 Feb 2026
- 2025Geometric Analysis of Neural Regression Collapse via Intrinsic Dimension1 Oct 2025
- 2025Sparsity-Driven Plasticity in Multi-Task Reinforcement Learning9 Aug 2025
- 2022Relating Regularization and Generalization through the Intrinsic Dimension of Activations23 Nov 2022
- 2022Constructing Prediction Intervals with Neural Networks: An Empirical Evaluation of Bootstrapping and Conformal Inference Methods7 Oct 2022
- 2022Bayesian Neural Networks for Geothermal Resource Assessment: Prediction with Uncertainty30 Sep 2022
- 2022Why neural networks find simple solutions: the many regularizers of geometric complexity27 Sep 2022
- 2022Model Stability with Continuous Data Updates14 Jan 2022
- 2021A generalization gap estimation for overparameterized models via the Langevin functional variance7 Dec 2021
- 2021The Geometric Occam's Razor Implicit in Deep Learning30 Nov 2021
- 2021Intrinsic Dimension, Persistent Homology and Generalization in Neural Networks25 Nov 2021
12 newest of 13 All 13 (JSON)