Perspectives of Current Research about the Complexity of Learning on Neural Nets
- 1 January 1994
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- Agnostic PAC Learning of Functions on Analog Neural NetsNeural Computation, 1995
- Decision theoretic generalizations of the PAC model for neural net and other learning applicationsInformation and Computation, 1992
- Feedforward nets for interpolation and classificationJournal of Computer and System Sciences, 1992
- On the computational complexity and geometry of the first-order theory of the reals. Part I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the realsJournal of Symbolic Computation, 1992
- Learnability and the Vapnik-Chervonenkis dimensionJournal of the ACM, 1989
- What Size Net Gives Valid Generalization?Neural Computation, 1989
- A theory of the learnableCommunications of the ACM, 1984
- Some special vapnik-chervonenkis classesDiscrete Mathematics, 1981
- ACKNOWLEDGEMENTSActa Physiologica Scandinavica, 1964
- On the Betti numbers of real varietiesProceedings of the American Mathematical Society, 1964