Fetching the paper…
Reading the bibliography…
ReLU neural networks define piecewise linear functions of their inputs.
Peter L. Bartlett and Shahar Mendelson. Rademacher and Gaussian Complexities: Risk Bounds and Structural Results . Journal of Machine Learning Research 3
2002
Earlier work this paper cites.
Xavier Glorot and Yoshua Bengio Understanding the difficulty of training deep feedforward neural networks , International Conference on Artificial Intelligence and Statistics, 2010
2010
Earlier work this paper cites.
Guido Montúfar, Razvan Pascanu, Kyunghyun Cho, and Yoshua Bengio, On the number of linear regions of deep neural networks , Advances in Neural Information Processing Systems 2014, 2924–2932
2014
Cited alongside, same era.
2014
Cited alongside, same era.
Kevin K. Chen. The upper bound on knots in neural networks , preprint
Cited in the paper.
Kevin K. Chen, Anthony Gamst, and Alden Walker. Knots in random neural networks , preprint
Cited in the paper.
Kevin K. Chen, Anthony Gamst, and Alden Walker. The empirical size and risk of trained neural networks , preprint
Cited in the paper.
François Chollet. Keras . Github, 2015. URL: https://github.com/fchollet/keras
2015
Later among the works it cites.
2016
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…