On the Learnability of Deep Random Networks
Not on the map. Why?
Abstract (arXiv)
In this paper we study the learnability of deep random networks from both theoretical and practical points of view. On the theoretical front, we show that the learnability of random deep networks with sign activation drops exponentially with its depth. On the practical front, we find that the learnability drops sharply with depth even with the state-of-the-art training methods, suggesting that our stylized theoretical results are closer to reality.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 8 Apr 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 1; 2024: 1.
4 papers.
- 2021From Local Pseudorandom Generators to Hardness of Learningcited by 24
- 2022Learning to Reason with Neural Networks: Generalization, Unseen Data and Boolean Measurescited by 17
- 2024On the hardness of learning under symmetriescited by 13
- 2023Most Neural Networks Are Almost Learnablecited by 2
- 2024On the hardness of learning under symmetries3 Jan 2024
- 2023Most Neural Networks Are Almost Learnable25 May 2023
- 2022Learning to Reason with Neural Networks: Generalization, Unseen Data and Boolean Measures26 May 2022
- 2021From Local Pseudorandom Generators to Hardness of Learning20 Jan 2021