Learning from hints in neural networks

DOI10.1016/0885-064X(90)90006-YzbMath0694.68057OpenAlexW2015140204WikidataQ56031198 ScholiaQ56031198MaRDI QIDQ909487

Yaser S. Abu-Mostafa

Publication date: 1990

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0885-064x(90)90006-y

zbMATH Keywords

neural networksLearningcomplexity value of hints

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05) Complexity of computation (including implicit computational complexity) (03D15)

Related Items (9)

A review of combinatorial problems arising in feedforward neural network design ⋮ Unnamed Item ⋮ On the value of partial information for learning from examples ⋮ Constrained neural network training and its application to hyperelastic material modeling ⋮ Physically enhanced training for modeling rate-independent plasticity with feedforward neural networks ⋮ Preference disaggregation and statistical learning for multicriteria decision support: A review ⋮ A data and digital-contracts driven method for pricing complex derivatives ⋮ Commutativity as prior knowledge in fuzzy modeling ⋮ On the learnability of rich function classes

Cites Work

• On the complexity of loading shallow neural networks
• Random problems
• A theory of the learnable
• On connectionist models
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities

This page was built for publication: Learning from hints in neural networks