On tractability of neural-network approximation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5495 LNCS, Issue , 2009, Pages 11-21

  Kainen, Paul C ^a   Kůrková, Věra ^b   Sanguineti, Marcello ^c  

^a GEORGETOWN UNIVERSITY   (United States)

^b INSTITUTE OF COMPUTER SCIENCE   (Czech Republic)

^c UNIVERSITY OF GENOA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

GAUSSIANS; NEURAL-NETWORK APPROXIMATIONS; PERCEPTRON NETWORK; WORST-CASE ERRORS;

ALGORITHMS; RADIAL BASIS FUNCTION NETWORKS;

NEURAL NETWORKS;

EID: 77949568241     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04921-7_2     Document Type: Conference Paper

References (25)

1. Traub, J.F., Werschulz, A.G.: Complexity and Information. Cambridge University Press, Cambridge (1999)
2. d. J. of Complexity 17, 722-740 (2001)
3. Woźniakowski, H.: Tractability and strong tractability of linear multivariate problems. J. of Complexity 10, 96-128 (1994)
4. Mhaskar, H.N.: On the tractability of multivariate integration and approximation by neural networks. J. of Complexity 20, 561-590 (2004)
5. Kainen, P.C., Kůrková, V., Sanguineti, M.: Complexity of Gaussian radial basis networks approximating smooth functions. J. of Complexity 25, 63-74 (2009)
6. Barron, A.R.: Universal approximation bounds for superpositions of a sigmoidal function. IEEE Transactions on Information Theory 39, 930-945 (1993)
7. Knuth, D.E.: Big omicron and big omega and big theta. SIGACT News 8(2), 18-24 (1976)
8. Bellman, R.: Dynamic Programming. Princeton University Press, Princeton (1957)
9. Kainen, P.C., Kůrková, V., Vogt, A.: A Sobolev-type upper bound for rates of approximation by linear combinations of Heaviside plane waves. J. of Approximation Theory 147, 1-10 (2007)
10. Kůrková, V., Savický, P., Hlaváč ková, K.: Representations and rates of approximation of real-valued Boolean functions by neural networks. Neural Networks 11, 651-659 (1998)
11. Beliczynski, B., Ribeiro, B.: Several enhancements to hermite-based approximation of one-variable functions. In: Kůrková, V., Neruda, R., Koutník, J. (eds.) ICANN 2008, Part I. LNCS, vol. 5163, pp. 11-20. Springer, Heidelberg (2008)
12. Barron, A.R.: Neural net approximation. In: Narendra, K. (ed.) Proc. 7th Yale Workshop on Adaptive and Learning Systems, pp. 69-72. Yale University Press (1992)
13. Breiman, L.: Hinging hyperplanes for regression, classification and function approximation. IEEE Transactions on Information Theory 39, 999-1013 (1993)
14. Darken, C., Donahue, M., Gurvits, L., Sontag, E.: Rate of approximation results motivated by robust neural network learning. In: Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, pp. 303-309. The Association for Computing Machinery, New York (1993)
15. Jones, L.K.: A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training. Annals of Statistics 20, 608-613 (1992)
16. Pisier, G.: Remarques sur un résultat non publié de B. Maurey. In: Séminaire d'Analyse Fonctionnelle 1980-1981, École Polytechnique, Centre de Mathématiques, Palaiseau, France, vol. I(12)
17. Gurvits, L., Koiran, P.: Approximation and learning of convex superpositions. J. of Computer and System Sciences 55, 161-170 (1997)
18. Kůrková, V.: Dimension-independent rates of approximation by neural networks. In: Warwick, K., Kárný, M. (eds.) Computer-Intensive Methods in Control and Signal Processing. The Curse of Dimensionality, pp. 261-270. Birkhäuser, Basel (1997)
19. Kolmogorov, A.N., Fomin, S.V.: Introductory Real Analysis. Dover Publications Inc. (1970)
20. Kůrková, V., Sanguineti, M.: Error estimates for approximate optimization by the extended Ritz method. SIAM J. on Optimization 15, 461-487 (2005)
21. Stein, E.M.: Singular Integrals and Differentiability Properties of Functions. Princeton University Press, Princeton (1970)
22. Courant, R.: Differential and Integral Calculus, vol. II. Wiley-Interscience, Hoboken (1988)
23. Kainen, P.C.: Utilizing geometric anomalies of high dimension: When complexity makes computation easier. In: Warwick, K., Kárný, M. (eds.) Computer-Intensive Methods in Control and Signal Processing. The Curse of Dimensionality, pp. 283-294. Birkhäuser, Basel (1997)
24. Kůrková, V., Kainen, P.C., Kreinovich, V.: Estimates of the number of hidden units and variation with respect to half-spaces. Neural Networks 10, 1061-1068 (1997)
25. Narcowich, F.J., Ward, J.D., Wendland, H.: Sobolev error estimates and a Bernstein inequality for scattered data interpolation via radial basis functions. Constructive Approximation 24, 175-186 (2006)