Name
Abstract | ||
|---|---|---|
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. |
Year | Venue | DocType |
|---|---|---|
2019 | arXiv: Learning | Journal |
Volume | Citations | PageRank |
abs/1904.03866 | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Abhimanyu Das | 1 | 314 | 22.43 |
| Sreenivas Gollapudi | 2 | 1198 | 64.70 |
| Ravi Kumar | 3 | 13932 | 1642.48 |
| Rina Panigrahy | 4 | 3203 | 269.05 |