Fetching the paper…
Reading the bibliography…
We propose a new method for learning deep neural network models that is based on a greedy learning approach: we add one basis function at a time, and a new basis function is generated as a non-linear activation function applied to a linear combination of the previous basis functions.
1908
Earlier work this paper cites.
1909
Earlier work this paper cites.
G. Cybenko
1989
Earlier work this paper cites.
K. Hornik, M. Stinchcombe, and H. White
1990
Earlier work this paper cites.
A. R. Barron
1994
Earlier work this paper cites.
J. H. Friedman
2001
Earlier work this paper cites.
V. Nair and G. E. Hinton
2010
Earlier work this paper cites.
T. T. Cai and L. Wang
2011
Cited alongside, same era.
G. Huang, Z. Liu, L. v. d. Maaten, and K. Q. Weinberger
2017
Cited alongside, same era.
2017
Cited alongside, same era.
D. Yarotsky
2017
Cited alongside, same era.
D. Perekrestenko, P. Grohs, D. Elbrächter, and H. Bölcskei
2018
Cited alongside, same era.
I. Safran and O. Shamir
2018
Cited alongside, same era.
2018
Later among the works it cites.
X. Zhang, Y. Yu, L. Wang, and Q. Gu
2018
Later among the works it cites.
I. Guhring, G. Kutyniok, and P. Petersen
2019
Closest in time.
2019
Closest in time.
J. A. A. Opschoor, P. Petersen, and C. Schwab
2019
Closest in time.
D. Zou, Y. Cao, D. Zhou, and Q. Gu
2019
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Closest in time.