Some comparisons of model complexity in linear and neural-network approximation

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

Volumn 6354 LNCS, Issue PART 3, 2010, Pages 358-367

  Gnecco, Giorgio ^a   Kůrková, Věra ^b   Sanguineti, Marcello ^a  

^a UNIVERSITY OF GENOA   (Italy)

^b INSTITUTE OF COMPUTER SCIENCE   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL UNITS; HIGH-DIMENSIONAL; LINEAR APPROXIMATIONS; LOWER BOUNDS; MODEL COMPLEXITY; NEURAL-NETWORK APPROXIMATIONS; UPPER BOUND; WORST-CASE ERRORS;

ERRORS;

NEURAL NETWORKS;

EID: 78049387383     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15825-4_48     Document Type: Conference Paper

References (23)

1. Kainen, P. C., Kůrková, V., Vogt, A.: Best approximation by Heaviside perceptron networks. Neural Networks 13, 695-697 (2000)
2. Kainen, P. C., Kůrková, V., Vogt, A.: Geometry and topology of continuous best and near best approximations. J. of Approximation Theory 105, 252-262 (2000)
3. p-spaces. Annals of Operational Research 101, 143-147 (2001) (Pubitemid 33634366)
4. Barron, A. R.: Universal approximation bounds for superpositions of a sigmoidal function. IEEE Trans. on Information Theory 39, 930-945 (1993)
5. Kůrková, V., Sanguineti, M.: Comparison of worst case errors in linear and neural network approximation. IEEE Trans. on Information Theory 48, 264-275 (2002)
6. 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) (1981)
7. 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 24, 608-613 (1992)
8. Kůrková, V., Sanguineti, M.: Geometric upper bounds on rates of variable-basis approximation. IEEE Trans. on Information Theory 54, 5681-5688 (2008)
9. Gribonval, R., Vandergheynst, P.: On the exponential convergence of matching pursuits in quasi-incoherent dictionaries. IEEE Trans. on Information Theory 52, 255-261 (2006)
10. Kolmogorov, A. N.: Über die beste Annäherung von Funktionen einer gegebenen Funktionenklasse. Annals of Mathematics 37(1), 107-110 (1936)
11. 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, Boston (1997)
12. Barron, A. R.: Neural net approximation. In: Proc. 7th Yale Workshop on Adaptive and Learning Systems, pp. 69-72. Yale University Press, New Haven (1992)
13. Kůrková, V.: High-dimensional approximation and optimization by neural networks. In: Suykens, J., Horvàth, G., Basu, S., Micchelli, C., Vandewalle, J. (eds.) Advances in Learning Theory: Methods, Models and Applications, ch. 4, pp. 69-88. IOS Press, Amsterdam (2003)
14. Kůrkovà, V.: Model complexity of neural networks and integral transforms. In: Alippi, C., Polycarpou, M., Panayiotou, C., Ellinas, G. (eds.) ICANN 2009. LNCS, vol. 5768, pp. 708-718. Springer, Heidelberg (2009)
15. Girosi, F., Anzellotti, G.: Rates of convergence for radial basis functions and neural networks. In: Mammone, R. J. (ed.) Artificial Neural Networks for Speech and Vision, pp. 97-113. Chapman & Hall, Boca Raton (1993)
16. 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)
17. Kainen, P. C., Kůrkovà, V.: An integral upper bound for neural network approximation. Neural Computation 21, 2970-2989 (2009)
18. 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)
19. Kainen, P. C., Kůrkovà, V., Sanguineti, M.: Complexity of Gaussian radial basis networks approximating smooth functions. J. of Complexity 25, 63-74 (2009)
20. Pinkus, A.: n-Widths in Approximation Theory. Springer, Heidelberg (1985)
21. Shubin, M. A.: Pseudodifferential operators and spectral theory. Springer, Heidelberg (2001)
22. Birman, M. S., Solomyak, M. Z.: Spectral Theory of Self-Adjoint Operators in Hilbert Space. D. Reidel Publishing, Dordrecht (1987)
23. Gnecco, G., Kůrkovà, V., Sanguineti, M.: Some comparisons of complexity of dictionary-based and linear computational models (2010) (manuscript)