Sample complexity for learning recurrent perceptron mappings
- 1 January 1996
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 42 (5) , 1479-1487
- https://doi.org/10.1109/18.532888
Abstract
No abstract availableThis publication has 19 references indexed in Scilit:
- A New Algorithm to Find a Point in Every Cell Defined by a Family of PolynomialsPublished by Springer Nature ,1998
- Neural Networks with Quadratic VC DimensionJournal of Computer and System Sciences, 1997
- 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
- FIR and IIR Synapses, a New Neural Network Architecture for Time Series ModelingNeural Computation, 1991
- Complexity of computation on real algebraic numbersJournal of Symbolic Computation, 1990
- Extracting state information from a quantized output recordSystems & Control Letters, 1989
- Learnability and the Vapnik-Chervonenkis dimensionJournal of the ACM, 1989
- Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic setsJournal of Symbolic Computation, 1988
- A theory of the learnableCommunications of the ACM, 1984