Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published July 1995 | Published
Journal Article Open

Hints

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.

Additional Information

© 1995 The MIT Press. Received May 10, 1994; accepted December 20, 1994. I wish to acknowledge the members of the Learning Systems Group at Caltech, Mr. Eric Bax, Ms. Zehra Cataltepe, Mr. Joseph Sill, and Ms. Xubo Song, for many valuable discussions. In particular, Ms. Cataltepe was very helpful throughout this work. Dedicated to the memory of Said Abu-Mostafa.

Attached Files

Published - ABUnc95.pdf

Files

ABUnc95.pdf
Files (1.5 MB)
Name Size Download all
md5:9e765e2e18233a643cc6a2c23b7206cd
1.5 MB Preview Download

Additional details

Created:
August 22, 2023
Modified:
October 17, 2023