A connectionist learning algorithm with provable generalization and scaling bounds
- 31 December 1990
- journal article
- Published by Elsevier in Neural Networks
- Vol. 3 (2) , 191-201
- https://doi.org/10.1016/0893-6080(90)90089-4
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Perceptron-based learning algorithmsIEEE Transactions on Neural Networks, 1990
- Learnability and the Vapnik-Chervonenkis dimensionJournal of the ACM, 1989
- What Size Net Gives Valid Generalization?Neural Computation, 1989
- Alphanumeric character recognition using a connectionist model with the pocket algorithmPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Automatic pattern recognition: a study of the probability of errorPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- Learning quickly when irrelevant attributes abound: A new linear-threshold algorithmMachine Learning, 1988
- Connectionist expert systemsCommunications of the ACM, 1988
- Occam's RazorInformation Processing Letters, 1987
- Geometrical and Statistical Properties of Systems of Linear Inequalities with Applications in Pattern RecognitionIEEE Transactions on Electronic Computers, 1965
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963