Fetching the paper…
Reading the bibliography…
In this paper, we prove that a shallow neural network with a monotone sigmoid, ReLU, ELU, Softplus, or LeakyReLU activation function can arbitrarily well approximate any L^p(p>=2) integrable functions defined on R*[0,1]^n.
Methods of modern mathematical physics: functional analysis
Michael Reed and Barry Simon, editors · 1980
Earlier work this paper cites.
Approximation by superpositions of a sigmoidal function
G. Cybenko · 1989
Earlier work this paper cites.
On the approximate realization of continuous mappings by neural networks
Ken-Ichi Funahashi · 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.
Universal approximation using feedforward networks with non-sigmoid hidden layer activation functions
M. Stinchcombe and H. White · 1989
Earlier work this paper cites.
Approximating and learning unknown mappings using multilayer feedforward networks with bounded weights
M. Stinchcombe and H. White · 1990
Earlier work this paper cites.
Approximation capabilities of multilayer feedforward networks
Kurt Hornik · 1991
Earlier work this paper cites.
Universal approximation uing radial-basis-function networks
J. Park and I. W. Sandberg · 1991
Earlier work this paper cites.
Approximation of continuous functions on ℝ d \mathbb{R}^{d} by linear combinations of shifted rotations of a sigmoid function with and without scaling
Yoshifusa Ito · 1992
Earlier work this paper cites.
Universal approximation bounds for superpositions of a sigmoidal function
A. R. Barron · 1993
Cited alongside, same era.
Multilayer feedforward networks with a nonpolynomial activation function can approximate any function
Moshe Leshno, Vladimir Ya. Lin, Allan Pinkus, and Shimon Schocken · 1993
Cited alongside, same era.
Ridge functions, sigmoidal functions and neural networks
Will Light · 1993
Cited alongside, same era.
Approximation capability in C ( R ¯ n ) {C}(\overline{R}^{n}) by multilayer feedforward networks and related problems
Tianping Chen, Hong Chen, and Ruey-Wen Liu · 1995
Cited alongside, same era.
Comments on “Approximation capability in C ( R ¯ n ) {C}(\overline{R}^{n}) by multilayer feedforward networks and related problems”
Guang-Bin Huang and Haroon Atique Babri · 1998
Cited alongside, same era.
The power of depth for feedforward neural networks
Ronen Eldan and Ohad Shamir · 2016
Later among the works it cites.
Benefits of depth in neural networks
Matus Telgarsky · 2016
Later among the works it cites.
Approximating continuous functions by ReLU nets of minimal width
Boris Hanin and Mark Sellke · 2017
Later among the works it cites.
The expressive power of neural networks: a view from the width
Zhou Lu, Hongming Pu, Feicheng Wang, Zhiqiang Hu, and Liwei Wang · 2017
Later among the works it cites.
Measure theory, I
B. Vladimir, editor · 2017
Later among the works it cites.
Learning continuous hierarchies in the Lorentz model of hyperbolic geometry
Maximilian Nickel and Douwe Kiela · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Allan Pinkus · 1999
Cited alongside, same era.
Rectified linear units improve restricted Boltzmann machines
Vinod Nair and Geoffrey E. Hinton · 2010
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.
Fast and accurate deep network learning by exponential linear units (ELUs)
Djork-Arne Clevert, Thomas Unterthiner, and Sepp Hochreiter · 2016
Cited alongside, same era.
Deep learning from 21-cm tomography of the cosmic dawn and reionization
Nicolas Gillet, Andrei Mesinger, Bradley Greig, Adrian Liu, and Graziano Ucci · 2019
Closest in time.
Universal approximation with deep narrow networks
Patrick Kidger and Terry Lyons · 2020
Closest in time.