Fetching the paper…
Reading the bibliography…
Neural Networks (NNs) are the method of choice for building learning algorithms.
1901
Earlier work this paper cites.
1904
Earlier work this paper cites.
1905
Earlier work this paper cites.
1905
Earlier work this paper cites.
1905
Earlier work this paper cites.
1905
Earlier work this paper cites.
1906
Earlier work this paper cites.
1910
Earlier work this paper cites.
[] Hebb, D. O. (1949), The organization of behavior: a neuropsychological theory
1949
Earlier work this paper cites.
[] Rosenblatt, F. (1958), ‘The perceptron:. probabilistic model for information storage and organization in the brain.’, Psychological review
1958
Earlier work this paper cites.
[] Stein, E. M. (1970), Singular integrals and differentiability properties of functions
1970
Earlier work this paper cites.
[] Zaslavsky, T. (1975), Facing up to arrangements: face-count formulas for partitions of space by hyper- planes
1975
Earlier work this paper cites.
[] Bergh, J. & Lofstrom (1976), Interpolation Spaces: An Introduction
1976
Earlier work this paper cites.
[] Peetre, J. (1976), New thoughts on Besov spaces
1976
Earlier work this paper cites.
[] de Boor, C. (1978), A Practical Guide to Splines
1978
Earlier work this paper cites.
[] DeVore, R. & Scherer, K. (1979). ‘Interpolation of linear operators on sobolev spaces’, Annals of Math
1979
Earlier work this paper cites.
[] Traub, J. & Wozniakowski, H. (1980), A General Theory of Optimal Algorithms
1980
Earlier work this paper cites.
[] Carl, B. (1981), ‘Entropy numbers, s-numbers, and eigenvalue problems’, Journal of Functional Analysis
1981
Earlier work this paper cites.
[] Hata, M. (1986), Fractals in mathematics, in
1986
Earlier work this paper cites.
[] DeVore, R. & Popov, V. (1988). ‘Interpolation of besov spaces’, Transactions of the AMS
1988
Earlier work this paper cites.
[] Petrushev, P. (1988), Direct and converse theorems for spline and rational approximation and besov spaces, in
1988
Earlier work this paper cites.
[] Cybenko, G. (1989), ‘Approximation by superpositions of a sigmoidal function’, Mathematics of control, signals and systems
1989
Earlier work this paper cites.
[] DeVore, R., Howard, R. & Micchelli, C. (1989), ‘Optimal non-linear approximation’, Manuscripta Math
1989
Earlier work this paper cites.
[] Hornik, K., Stinchcombe, M., White, H. et al. (1989), ‘Multilayer feedforward networks are universal approximators’, Neural networks
1989
Earlier work this paper cites.
[] Vapnik, V. (1989), Statistical Learning Theory
1989
Earlier work this paper cites.
[] Bennett, C. & Sharpley, R. (1990). Interpolation of Operators
1990
Earlier work this paper cites.
[] Frazier, M. W., Jawerth, B. & Weiss, G. (1991), Littlewood-Paley theory and the study of function spaces
1991
Earlier work this paper cites.
[] Barron, A. (1993), ‘Universal approximation bounds for superpositions of a sigmoidal function’, IEEE Trans. Inf. Theory
1993
Earlier work this paper cites.
[] DeVore, R. A. & Sharpley, R. C. (1993), ‘Besov spaces on domains in rd’, Transactions of the American Mathematical Society
1993
Earlier work this paper cites.
[] DeVore, R., Kyriazis, G., Leviatan, D. & Tikhomirov, V. (1993), ‘Wavelet compression and nonlinearn-widths’, Advances in Computational Mathematics
1993
Earlier work this paper cites.
[] Barron, A. R. (1994), ‘Approximation and estimation bounds for artificial neural networks’, Machine learning
1994
Earlier work this paper cites.
[] DeVore, R. & Temlyakov, V. (1996). ‘Some remarks on greedy algorithms’, Advances in Computational Mathematics
1996
Earlier work this paper cites.
[] Lorenz, G., Makovoz, Y. & von Golitschek, M. (1996), Constructive Approximation: Advanced Problems
1996
Cited alongside, same era.
[] Makovoz, Y. (1996), ‘Random approximants and neural networks’, Journal of Approximation Theory
1996
Cited alongside, same era.
[] DeVore, R., Oskolkov, K. & Petrushev, P. (1997), ‘Approximation by feed-forward neural networks’, Annals of Numerical Mathematics
1997
Cited alongside, same era.
[] DeVore, R. A. (1998), ‘Nonlinear approximation’, Acta Numerica
1998
Cited alongside, same era.
[] Petrushev, P. (1998), ‘Approximation by ridge functions and neural networks’, SIAM Journal on Mathematical Analysis
1998
Cited alongside, same era.
[] Maiorov, V. (1999), ‘On best approximation by ridge functions’, Journal of Approximation Theory
[] Bronstein, M. M., Bruna, J., LeCun, Y., Szlam, A. & Vandergheynst, P. (2017), ‘Geometric deep learning: going beyond euclidean data’, IEEE Signal Processing Magazine
2017
Later among the works it cites.
[] Dziugaite, G. K. & Roy, D. M. (2017), ‘Computing nonvacuous generalization bounds for deep (stochastic) neural networks with many more parameters than training data’, ICML
2017
Later among the works it cites.
[] Silver, D., Schrittwieser, J., Simonyan, K., Antonoglou, I., Huang, A., Guez, A., Hubert, T., Baker, L., Lai, M., Bolton, A. et al. (2017), ‘Mastering the game of go without human knowledge’, nature
2017
Later among the works it cites.
[] Yarotsky, D. (2017), ‘Error bounds for approximations with deep relu networks’, Neural Networks
2017
Later among the works it cites.
[] Zhang, C., Bengio, S., Hardt, M., Recht, B. & Vinyals, O. (2017), ‘Understanding deep learning requires rethinking generalization’, ICLR
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
1999
Cited alongside, same era.
[] Pinkus, A. (1999), ‘Approximation theory of the mlp model in neural networks’, Acta numerica
1999
Cited alongside, same era.
[] Benyamini, Y. & Lindenstrauss, J. (2000), Geometric Nonlinear Functional Analysis, Vol. 1
2000
Cited alongside, same era.
2001
Cited alongside, same era.
[] Adams, R. A. & Fournier, J. J. (2003), Sobolev spaces
2003
Cited alongside, same era.
2003
Cited alongside, same era.
[] Stanley, R. P. et al. (2004), ‘An introduction to hyperplane arrangements’, Geometric combinatorics
2004
Cited alongside, same era.
2017
Later among the works it cites.
[] Arora, S., Ge, R., Neyshabur, B. & Zhang, Y. (2018), ‘Stronger generalization bounds for deep nets via. compression approach’, ICML
2018
Later among the works it cites.
[] E, W. & Wang, Q. (2018). ‘Exponential convergence of the deep neural network approximation for analytic functions’, Sci. China Math
2018
Later among the works it cites.
[] Jacot, A., Gabriel, F. & Hongler, C. (2018), Neural tangent kernel: Convergence and generalization in neural networks, in
2018
Later among the works it cites.
[] Klusowski, J. & Barron (2018). ‘Approximation by combinations of relu and squared relu ridge functions with l1 and l0 controls’, IEEE Trans. Inf. Theory
2018
Later among the works it cites.
2018
Later among the works it cites.
[] Petersen, P. & Voigtlaender, F. (2018), ‘Optimal approximation of piecewise smooth functions using deep relu neural networks’, Neural Networks
2018
Later among the works it cites.
2018
Later among the works it cites.
2018
Later among the works it cites.
[] Allen-Zhu, Z., Li, Y. & Song, Z. (2019), A convergence theory for deep learning via over-parameterization, in
2019
Later among the works it cites.
[] Bartlett, P. L., Harvey, N., Liaw, C. & Mehrabian, A. (2019), ‘Nearly-tight vc-dimension and pseudodimension bounds for piecewise linear neural networks.’, Journal of Machine Learning Research
2019
Later among the works it cites.
[] Bölcskei, H., Grohs, P., Kutyniok, G. & Petersen, P. (2019), ‘Optimal approximation with sparsely connected deep neural networks’, SIAM Journal on Math. Data Sci
2019
Later among the works it cites.
[] Chizat, L., Oyallon, E. & Bach, F. (2019), On lazy training in differentiable programming, in
2019
Later among the works it cites.
[] Csiskos, M., Kupavskii, A. & Mustafa, N. (2019), ‘Tight lower bounds on the vc-dimension of geometric set systems’, Journal of Machine Learning Research
2019
Later among the works it cites.
[] Du, S., Lee, J., Li, H., Wang, L. & Zhai, X. (2019), Gradient descent finds global minima of deep neural networks, in
2019
Later among the works it cites.
[] Du, S. S., Zhai, X., Poczos, B. & Singh, A. (2019), ‘Gradient descent provably optimizes over-parameterized neural networks’, ICLR
2019
Later among the works it cites.
[] Hanin, B. (2019), ‘Universal function approximation by deep neural nets with bounded width and relu activations’, Mathematics
2019
Later among the works it cites.
[] Hanin, B. & Rolnick, D. (2019). Deep relu networks have surprisingly few activation patterns, in
2019
Later among the works it cites.
[] Opschoor, J., Petersen, P. & Schwab, C. (2019), ‘Deep relu networks and high-order finite element methods’, SAM, ETH Zürich
2019
Later among the works it cites.
[] Opschoor, J., Schwab, C. & Zech, J. (2019), Exponential relu dnn expression of holomorphic maps in high dimension, Technical report, ETH Zürich
2019
Later among the works it cites.
[] Savarese, P., Evron, I., Soudry, D. & Srebro, N. (2019), ‘How do infinite width bounded norm networks look in function space?’, In Conference on Learning Theory (COLT2019)
2019
Later among the works it cites.
[] Shen, Z., Yang, H. & Zhang, S. (2019), ‘Nonlinear approximation via compositions’, Neural Networks
2019
Later among the works it cites.
[] Balestriero, R. & Baraniuk, R. (2020), ‘Mad max: Affine spline insights into deep learning’, Proceedings of IEEE
2020
Closest in time.
[] Bartlett, P. L., Long, P. M., Lugosi, G. & Tsigler, A. (2020), ‘Benign overfitting in linear regression’, Proceedings of the National Academy of Sciences
2020
Closest in time.
[] He, J., Li, L., Xu, J. & Zheng, C. (2020), ‘Relu deep neural networks and linear finite elements’, Comp. Math
2020
Closest in time.
[] Petersen, P. (2020), ‘Neural network theory’
2020
Closest in time.
2020
Closest in time.
[] Siegel, J. & Xu, J. (2020), ‘High order approximation rates for neural networks with reluk activation functions’, ArXiv Preprint:ArXiv2012.07205
2020
Closest in time.