Fetching the paper…
Reading the bibliography…
In this paper we investigate the family of functions representable by deep neural networks (DNN) with rectified linear units (ReLU).
Almost optimal lower bounds for small depth circuits
Johan Hastad · 1986
Earlier work this paper cites.
Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
Alexander A. Razborov · 1987
Earlier work this paper cites.
Algebraic methods in the theory of lower bounds for boolean circuit complexity
Roman Smolensky · 1987
Earlier work this paper cites.
Approximation by superpositions of a sigmoidal function
George Cybenko · 1989
Earlier work this paper cites.
Approximation capabilities of multilayer feedforward networks
Kurt Hornik · 1991
Earlier work this paper cites.
Training a 3-node neural network is np-complete
Avrim L. Blum and Ronald L. Rivest · 1992
Earlier work this paper cites.
On the complexity of training neural networks with continuous activation functions
Bhaskar DasGupta, Hava T. Siegelmann, and Eduardo Sontag · 1995
Earlier work this paper cites.
Lectures on polytopes , volume 152
Günter M. Ziegler · 1995
Earlier work this paper cites.
Complexity theory lecture notes
Eric Allender · 1998
Earlier work this paper cites.
Neural network learning: Theoretical foundations
Martin Anthony and Peter L. Bartlett · 1999
Earlier work this paper cites.
Lectures on discrete geometry , volume 212
Jiri Matousek · 2002
Earlier work this paper cites.
General constructive representations for continuous piecewise-linear functions
Shuning Wang · 2004
Earlier work this paper cites.
Generalization of hinging hyperplanes
Shuning Wang and Xusheng Sun · 2005
Earlier work this paper cites.
A fast learning algorithm for deep belief nets
Geoffrey E. Hinton, Simon Osindero, and Yee-Whye Teh · 2006
Earlier work this paper cites.
Computational complexity: a modern approach
Sanjeev Arora and Boaz Barak · 2009
Earlier work this paper cites.
Deep boltzmann machines
Ruslan Salakhutdinov and Geoffrey E. Hinton · 2009
Earlier work this paper cites.
Real Analysis
H.L. Royden and P.M. Fitzpatrick · 2010
Cited alongside, same era.
Arithmetic circuits: A survey of recent results and open questions
Amir Shpilka and Amir Yehudayoff · 2010
Cited alongside, same era.
Deep neural networks for acoustic modeling in speech recognition: The shared views of four research groups
Geoffrey Hinton, Li Deng, Dong Yu, George E. Dahl, Abdel-rahman Mohamed, Navdeep Jaitly, Andrew Senior, Vincent Vanhoucke, Patrick Nguyen, Tara N Sainath, et al · 2012
Cited alongside, same era.
Boolean function complexity: advances and frontiers , volume 27
Stasys Jukna · 2012
Cited alongside, same era.
Imagenet classification with deep convolutional neural networks
Alex Krizhevsky, Ilya Sutskever, and Geoffrey E. Hinton · 2012
Cited alongside, same era.
Improving deep neural networks for lvcsr using rectified linear units and dropout
George E. Dahl, Tara N. Sainath, and Geoffrey E. Hinton · 2013
Daniel M. Kane and Ryan Williams · 2015
Later among the works it cites.
Deep learning
Yann LeCun, Yoshua Bengio, and Geoffrey Hinton · 2015
Later among the works it cites.
An average-case depth hierarchy theorem for boolean circuits
Benjamin Rossman, Rocco A. Servedio, and Li-Yang Tan · 2015
Later among the works it cites.
Representation benefits of deep feedforward networks
Matus Telgarsky · 2015
Later among the works it cites.
The power of depth for feedforward neural networks
Ronen Eldan and Ohad Shamir · 2016
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Ian J Goodfellow, David Warde-Farley, Mehdi Mirza, Aaron Courville, and Yoshua Bengio · 2013
Cited alongside, same era.
Building high-level features using large scale unsupervised learning
Quoc V. Le · 2013
Cited alongside, same era.
On the number of response regions of deep feed forward networks with piece-wise linear activations
Razvan Pascanu, Guido Montufar, and Yoshua Bengio · 2013
Cited alongside, same era.
On the number of linear regions of deep neural networks
Guido F. Montufar, Razvan Pascanu, Kyunghyun Cho, and Yoshua Bengio · 2014
Cited alongside, same era.
A survey of lower bounds in arithmetic circuit complexity, 2014
R. Saptharishi · 2014
Cited alongside, same era.
Overfeat: Integrated recognition, localization and detection using convolutional networks
Pierre Sermanet, David Eigen, Xiang Zhang, Michael Mathieu, Rob Fergus, and Yann LeCun · 2014
Cited alongside, same era.
Surbhi Goel, Varun Kanade, Adam Klivans, and Justin Thaler · 2016
Closest in time.
Deep learning without poor local minima
Kenji Kawaguchi · 2016
Closest in time.
Why deep neural networks for function approximation?
Shiyu Liang and R Srikant · 2016
Closest in time.
On the expressive power of deep neural networks
Maithra Raghu, Ben Poole, Jon Kleinberg, Surya Ganguli, and Jascha Sohl-Dickstein · 2016
Closest in time.
Distribution-specific hardness of learning neural networks
Ohad Shamir · 2016
Closest in time.
benefits of depth in neural networks
Matus Telgarsky · 2016
Closest in time.
Error bounds for approximations with deep relu networks
Dmitry Yarotsky · 2016
Closest in time.
Universal function approximation by deep neural nets with bounded width and relu activations
Boris Hanin · 2017
Closest in time.
Depth-width tradeoffs in approximating natural functions with neural networks
Itay Safran and Ohad Shamir · 2017
Closest in time.
Bounding and counting linear regions of deep neural networks
Thiago Serra, Christian Tjandraatmadja, and Srikumar Ramalingam · 2017
Closest in time.