Çataltepe, Zehra (1994) The Scheduling Problem in Learning From Hints. Computer Science Technical Reports, 94-09. California Institute of Technology , Pasadena, CA. (Unpublished) http://resolver.caltech.edu/CaltechCSTR:1994.cs-tr-94-09
- Published Version
See Usage Policy.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechCSTR:1994.cs-tr-94-09
Any information about the function to be learned is called a hint. Learning from hints is a generalization of learning from examples. In this paradigm, hints are expressed by their examples and then taught to a learning-from-examples system. In general, using other hints in addition to the examples of the function, improves the generalization performance. The scheduling problem in learning from hints is deciding which hint to teach at which time during training. Over- or under- emphasizing a hint may render it useless, making scheduling very important. Fixed and adaptive schedules are two types of schedules that are discussed. Adaptive minimization is a general adaptive schedule that uses an estimate of generalization error in terms of errors on hints. When such an estimate is available, it can also be optimized by means of directly descending on it. An estimate may be used to decide on when to stop training, too. A method to find an estimate incorporating the errors on invariance hints, and simulation results on this estimate, are presented. Two computer programs that provide a learning- from- hints environment and improvements on them are discussed.
|Item Type:||Report or Paper (Technical Report)|
|Group:||Computer Science Technical Reports|
|Usage Policy:||You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.|
|Deposited By:||Imported from CaltechCSTR|
|Deposited On:||25 Apr 2001|
|Last Modified:||09 May 2016 19:24|
Repository Staff Only: item control page