Abstract

The systematic use of hints in the learning-from-examples paradigm is the subject of this review. Hints are the properties of the target function that are known to us independently of the training examples. The use of hints is tantamount to combining rules and data in learning, and is compatible with different learning models, optimization techniques, and regularization techniques. The hints are represented to the learning process by virtual examples, and the training examples of the target function are treated on equal footing with the rest of the hints. A balance is achieved between the information provided by the different hints through the choice of objective functions and learning schedules. The Adaptive Minimization algorithm achieves this balance by relating the performance on each hint to the overall performance. The application of hints in forecasting the very noisy foreign-exchange markets is illustrated. On the theoretical side, the information value of hints is contrasted to the complexity value and related to the VC dimension.

Keywords

Computer scienceArtificial intelligenceRegularization (linguistics)Machine learningDimension (graph theory)MinificationMathematics

Affiliated Institutions

Related Publications

An Overview of Overfitting and its Solutions

Overfitting is a fundamental issue in supervised machine learning which prevents us from perfectly generalizing the models to well fit observed data on training data, as well as...

2019 Journal of Physics Conference Series 2055 citations

Publication Info

Year
1995
Type
review
Volume
7
Issue
4
Pages
639-671
Citations
118
Access
Closed

External Links

Social Impact

Altmetric
PlumX Metrics

Social media, news, blog, policy document mentions

Citation Metrics

118
OpenAlex

Cite This

Yaser S. Abu‐Mostafa (1995). Hints. Neural Computation , 7 (4) , 639-671. https://doi.org/10.1162/neco.1995.7.4.639

Identifiers

DOI
10.1162/neco.1995.7.4.639