Complexity results on learning by neural nets
Open Access
- 1 May 1991
- journal article
- Published by Springer Nature in Machine Learning
- Vol. 6 (3), 211-230
- https://doi.org/10.1007/bf00114777
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Learnability and the Vapnik-Chervonenkis dimensionJournal of the ACM, 1989
- Connectionist learning proceduresArtificial Intelligence, 1989
- What Size Net Gives Valid Generalization?Neural Computation, 1989
- Modular Construction of Time-Delay Neural Networks for Speech RecognitionNeural Computation, 1989
- Quantifying inductive bias: AI learning algorithms and Valiant's learning frameworkArtificial Intelligence, 1988
- On the complexity of loading shallow neural networksJournal of Complexity, 1988
- A theory of the learnableCommunications of the ACM, 1984
- Complete sets and the polynomial-time hierarchyTheoretical Computer Science, 1976
- The polynomial-time hierarchyTheoretical Computer Science, 1976
- Word problems requiring exponential time(Preliminary Report)Published by Association for Computing Machinery (ACM) ,1973