Sample complexity for function learning tasks through linear neural networks

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

Volumn 2313, Issue , 2002, Pages 262-271

  Hernández Aguirre, Arturo ^a,b   Koutsougeras, Cris ^b   Buckles, Bill P ^b  

^a CENTRO DE INVESTIGACIÓN EN MATEMÁTICAS   (Mexico)

^b Tulane University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; LINEAR NETWORKS;

DISTRIBUTION-FREE; FUNCTION LEARNING; FUNCTIONAL-LINK NETWORK; LINEAR NEURAL NETWORK; RADIAL BASIS NEURAL NETWORKS; SAMPLE COMPLEXITY; SAMPLE COMPLEXITY BOUNDS; UNIFORM DISTRIBUTION;

COMPLEX NETWORKS;

EID: 49649096512     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46016-0_28     Document Type: Conference Paper

References (18)

1. M. Anthony and P. Bartlett. Neural Network Learning: theoretical foundations. Cambridge University Press, Cambridge, England, 1992
2. M. Anthony and N. Biggs. Computational Learning Theory. Cambridge University Press, Cambridge, England, 1992
3. Gyora M. Benedek and Alon Itai. Learnability with respect to fixed distributions. Theoretical Computer Science, 86:377–389, 1991
4. Anselm Blumer, Andrzej Ehrenfeucht, David Haussler, and Manfred K. Warmuth. Learnability and the Vapnik-Chervonenkis Dimension. Journal of the ACM, 36(4):929–965, October 1989
5. Vladimir S. Cherkassky and Filip M. Mulier. Learning from Data. Concepts, Theory, and Methods. John Wiley and Sons, Inc., New York, 1998
6. F. Denis and R. Gilleron. Pac learning under helpful distributions. In M. Li and A. Maruoka, editors, Algorithmic Learning Theory, ALT97. Springer-Verlag, 1997
7. Arturo Hernández-Aguirre. Sample Complexity and Generalization in Feedforward Neural Networks. PhD thesis, Department of Electrical Engineering and Computer Science, Tulane University, 2000.
8. S.B. Holden and P.J.W. Rayner. Generalization and PAC Learning: Some New Results for the Class of Generalized Single-layer Networks. IEEE Transactions of Neural Networks, 6(2):368–380, March 1995
9. Natarajan B. K. Machine Learning. A theoretical approach. Morgan Kaufmann Publishers, San Mateo, California, 1991
10. Kolmogorov A. N. and V. M. Tihomirov. entropy and capacity of sets in functional space. Americal Mathematical Society Translations, 17:277–364, 1961
11. P. Niyogi and F. Girosi. On the relationship between generalization error, hypothesis complexity, and sample complexity for radial basis functions. A.I. Memo 1467, Massachusetts Institute of Technology, AI Lab, February 1994
12. H. Qia, N. Rao, and V. Protopopescu. Pac learning using nadaraya-watson estimator based on orthonormal systems. In M. Li and A. Maruoka, editors, Algorithmic Learning Theory, ALT97. Springer-Verlag, 1997
13. A. Sierra, J. Macias, and F. Corbacho. Evolution of Functional Link Networks. IEEE Transactions on Neural Networks, 5(1):54–65, February 2001
14. J. Takeuchi. Some improved sample complexity bounds in the probabilistic pac learning model. In S. Doshida and K. Furukawa, editors, Algorithmic Learning Theory, Third Workshop ALT92. Springer-Verlag, 1993
15. Poggio Tomaso and Federico Girosi. A theory of networks for approximation and learning. A.I. Memo No. 1140, Massachusetts Institute of Technology. Artificial Intelligence Laboratory, July 1989
16. Vladimir Naumovich Vapnik. The Nature of Statistical Learning Theory. Springer- Verlag, New York, 1995
17. Vladimir Naumovich Vapnik. Statistical Learning Theory. Wiley, New York, 1996
18. M. Vidyasagar. A theory of learning and generalization: with applications to neural networks and control systems. Springer-Verlag, London, 1997.