Fetching the paper…
Reading the bibliography…
Understanding the representational power of Deep Neural Networks (DNNs) and how their structural properties (e.g., depth, width, type of activation unit) affect the functions they can compute, has been an important yet challenging question in deep learning and approximation theory.
Estimation of the complexity of the tabulation problem, 1959
AG Vitushkin · 1959
Earlier work this paper cites.
Coexistence of the cycles of a continuous mapping of the line into itself
OM Sharkovsky · 1964
Earlier work this paper cites.
On cycles and structure of continuous mapping
OM Sharkovsky · 1965
Earlier work this paper cites.
Period three implies chaos
Tien-Yien Li and James A Yorke · 1975
Earlier work this paper cites.
Universality in complex discrete dynamics
MJ Feigenbaum · 1976
Earlier work this paper cites.
Simple mathematical models with very complicated dynamics
Robert M May · 1976
Earlier work this paper cites.
Neocognitron: A self-organizing neural network model for a mechanism of pattern recognition unaffected by shift in position
Kunihiko Fukushima · 1980
Earlier work this paper cites.
Almost optimal lower bounds for small depth circuits
John Hastad · 1986
Earlier work this paper cites.
Computational limitations of small-depth circuits
Johan Håstad · 1987
Earlier work this paper cites.
Approximation by superpositions of a sigmoidal function
George Cybenko · 1989
Earlier work this paper cites.
Multilayer feedforward networks are universal approximators
Kurt Hornik, Maxwell Stinchcombe, and Halbert White · 1989
Earlier work this paper cites.
Circuit complexity and neural networks
Ian Parberry, Michael R Garey, and Albert Meyer · 1994
Earlier work this paper cites.
Lower bounds on the complexity of approximating continuous functions by sigmoidal neural networks
Michael Schmitt · 2000
Cited alongside, same era.
The sharkovsky theorem: A natural direct proof
Keith Burns and Boris Hasselblatt · 2011
Cited alongside, same era.
Shallow vs. deep sum-product networks
Olivier Delalleau and Yoshua Bengio · 2011
Cited alongside, same era.
Adam: A method for stochastic optimization
Diederik P Kingma and Jimmy Ba · 2014
Cited alongside, same era.
On the expressive efficiency of sum product networks
James Martens and Venkatesh Medabalimi · 2014
Cited alongside, same era.
On the number of linear regions of deep neural networks
Reynolds averaged turbulence modelling using deep neural networks with embedded invariance
Julia Ling, Andrew Kurzawski, and Jeremy Templeton · 2016
Later among the works it cites.
Why deep neural networks for function approximation?
Shiyu Liang and Rayadurgam Srikant · 2016
Later among the works it cites.
Exponential expressivity in deep neural networks through transient chaos
Ben Poole, Subhaneil Lahiri, Maithra Raghu, Jascha Sohl-Dickstein, and Surya Ganguli · 2016
Later among the works it cites.
benefits of depth in neural networks
Matus Telgarsky · 2016
Later among the works it cites.
Multiplicative weights update with constant step-size in congestion games: Convergence, limit cycles and chaos
Gerasimos Palaiopanos, Ioannis Panageas, and Georgios Piliouras · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Guido F Montufar, Razvan Pascanu, Kyunghyun Cho, and Yoshua Bengio · 2014
Cited alongside, same era.
An average-case depth hierarchy theorem for boolean circuits
Benjamin Rossman, Rocco A Servedio, and Li-Yang Tan · 2015
Cited alongside, same era.
Representation benefits of deep feedforward networks
Matus Telgarsky · 2015
Cited alongside, same era.
Understanding deep neural networks with rectified linear units
Raman Arora, Amitabh Basu, Poorya Mianjy, and Anirbit Mukherjee · 2016
Cited alongside, same era.
The power of depth for feedforward neural networks
Ronen Eldan and Ohad Shamir · 2016
Cited alongside, same era.
Super-linear gate and super-quadratic wire lower bounds for depth-two and depth-three threshold circuits
Daniel M Kane and Ryan Williams · 2016
Cited alongside, same era.
Über die analytische darstellbarkeit sogenannter willkürlicher functionen einer reellen veränderlichen
Karl Weierstrass
Cited in the paper.
Maithra Raghu, Ben Poole, Jon Kleinberg, Surya Ganguli, and Jascha Sohl Dickstein · 2017
Later among the works it cites.
Collapse of deep and narrow neural nets
Lu Lu, Yanhui Su, and George Em Karniadakis · 2018
Later among the works it cites.
Newton vs the machine: solving the chaotic three-body problem using deep neural networks
Philip G Breen, Christopher N Foley, Tjarda Boekholt, and Simon Portegies Zwart · 2019
Closest in time.
Thiparat Chotibut, Fryderyk Falniowski, Michal Misiurewicz, and Georgios Piliouras · 2019
Closest in time.
On the expressive power of deep polynomial neural networks
Joe Kileel, Matthew Trager, and Joan Bruna · 2019
Closest in time.
Is deeper better only when shallow is good?
Eran Malach and Shai Shalev-Shwartz · 2019
Closest in time.