Approximation and estimation bounds for artificial neural networks
- 1 January 1994
- journal article
- Published by Springer Nature in Machine Learning
- Vol. 14 (1) , 115-133
- https://doi.org/10.1007/bf00993164
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Statistical properties of artificial neural networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Elements of Information TheoryPublished by Wiley ,2001
- Universal approximation bounds for superpositions of a sigmoidal functionIEEE Transactions on Information Theory, 1993
- Decision theoretic generalizations of the PAC model for neural net and other learning applicationsInformation and Computation, 1992
- Approximation of Density Functions by Sequences of Exponential FamiliesThe Annals of Statistics, 1991
- Minimum complexity density estimationIEEE Transactions on Information Theory, 1991
- Applied Nonparametric RegressionPublished by Cambridge University Press (CUP) ,1990
- Approximation by superpositions of a sigmoidal functionMathematics of Control, Signals, and Systems, 1989
- Multilayer feedforward networks are universal approximatorsNeural Networks, 1989
- Approximation of Least Squares Regression on Nested SubspacesThe Annals of Statistics, 1988