Polynomial Bounds for VC Dimension of Sigmoidal and General Pfaffian Neural Networks
- 1 February 1997
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 54 (1) , 169-176
- https://doi.org/10.1006/jcss.1997.1477
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Polynomial bounds for VC dimension of sigmoidal neural networksPublished by Association for Computing Machinery (ACM) ,1995
- The Elementary Theory of Restricted Analytic Fields with ExponentiationAnnals of Mathematics, 1994
- A result of Vapnik with applicationsDiscrete Applied Mathematics, 1993
- VC Dimension and Uniform Learnability of Sparse Polynomials and Rational FunctionsSIAM Journal on Computing, 1993
- Bounds for the computational power and learning complexity of analog neural netsPublished by Association for Computing Machinery (ACM) ,1993
- Decision theoretic generalizations of the PAC model for neural net and other learning applicationsInformation and Computation, 1992
- Vapnik-Chervonenkis Classes of Definable SetsJournal of the London Mathematical Society, 1992
- On the decidability of sparse univariate polynomial interpolationPublished by Association for Computing Machinery (ACM) ,1990
- Definable sets in ordered structures. IITransactions of the American Mathematical Society, 1986
- Properties of Logarithmico-Exponential FunctionsProceedings of the London Mathematical Society, 1912