On the VC-dimension of depth four threshold circuits and the complexity of Boolean-valued functions
- 1 January 1993
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 251-264
- https://doi.org/10.1007/3-540-57370-4_52
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Bounds for the computational power and learning complexity of analog neural netsPublished by Association for Computing Machinery (ACM) ,1993
- Learnability and the Vapnik-Chervonenkis dimensionJournal of the ACM, 1989
- What Size Net Gives Valid Generalization?Neural Computation, 1989
- On the capabilities of multilayer perceptronsJournal of Complexity, 1988
- Geometrical and Statistical Properties of Systems of Linear Inequalities with Applications in Pattern RecognitionIEEE Transactions on Electronic Computers, 1965