Learning from hints in neural networks
- 1 June 1990
- journal article
- Published by Elsevier in Journal of Complexity
- Vol. 6 (2) , 192-198
- https://doi.org/10.1016/0885-064x(90)90006-y
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- The Vapnik-Chervonenkis Dimension: Information versus Complexity in LearningNeural Computation, 1989
- Random problemsJournal of Complexity, 1988
- On connectionist modelsCommunications on Pure and Applied Mathematics, 1988
- On the complexity of loading shallow neural networksJournal of Complexity, 1988
- A theory of the learnableCommunications of the ACM, 1984
- On the Uniform Convergence of Relative Frequencies of Events to Their ProbabilitiesTheory of Probability and Its Applications, 1971