Activation function dependence of the storage capacity of treelike neural networks
Not on the map. Why?
Abstract (arXiv)
The expressive power of artificial neural networks crucially depends on the nonlinearity of their activation functions. Though a wide variety of nonlinear activation functions have been proposed for use in artificial neural networks, a detailed understanding of their role in determining the expressive power of a network has not emerged. Here, we study how activation functions affect the storage capacity of treelike two-layer networks. We relate the boundedness or divergence of the capacity in the infinite-width limit to the smoothness of the activation function, elucidating the relationship between previously studied special cases. Our results show that nonlinearity can both increase capacity and decrease the robustness of classification, and provide simple estimates for the capacity of networks with several commonly used activation functions. Furthermore, they generate a hypothesis for the functional benefit of dendritic spikes in branched neurons.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). First posted on arXiv 21 Jul 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 2; 2023: 3; 2024: 4; 2025: 1.
10 papers.
- 2022Contrasting random and learned features in deep Bayesian linear regressioncited by 24
- 2023Long Sequence Hopfield Memorycited by 15
- 2024Exact full-RSB SAT/UNSAT transition in infinitely wide two-layer neural networkscited by 6
- 2024Fixed width treelike neural networks capacity analysis -- generic activationscited by 4
- 2023Capacity of the treelike sign perceptrons neural networks with one hidden layer -- RDT based upper boundscited by 3
- 2023Lifted RDT based capacity analysis of the 1-hidden layer treelike sign perceptrons neural networkscited by 3
- 2024Solution space and storage capacity of fully connected two-layer neural networks with generic activation functionscited by 3
- 2022On neural network kernels and the storage capacity problemcited by 2
- 2025Generalization performance of narrow one-hidden layer networks in the teacher-student settingcited by 2
- 2024Exact objectives of random linear programs and mean widths of random polyhedronscited by 0
- 2025Generalization performance of narrow one-hidden layer networks in the teacher-student setting1 Jul 2025
- 2024Exact full-RSB SAT/UNSAT transition in infinitely wide two-layer neural networks9 Oct 2024
- 2024Solution space and storage capacity of fully connected two-layer neural networks with generic activation functions20 Apr 2024
- 2024Exact objectives of random linear programs and mean widths of random polyhedrons6 Mar 2024
- 2024Fixed width treelike neural networks capacity analysis -- generic activations8 Feb 2024
- 2023Lifted RDT based capacity analysis of the 1-hidden layer treelike sign perceptrons neural networks13 Dec 2023
- 2023Capacity of the treelike sign perceptrons neural networks with one hidden layer -- RDT based upper bounds13 Dec 2023
- 2023Long Sequence Hopfield Memory7 Jun 2023
- 2022Contrasting random and learned features in deep Bayesian linear regression1 Mar 2022
- 2022On neural network kernels and the storage capacity problem12 Jan 2022