Çataltepe, Zehra Kök (1994) The scheduling problem in learning from hints. Master's thesis, California Institute of Technology. http://resolver.caltech.edu/CaltechTHESIS:03272012-100501462
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 a 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:||Thesis (Master's thesis)|
|Subject Keywords:||Computer Science|
|Degree Grantor:||California Institute of Technology|
|Division:||Engineering and Applied Science|
|Major Option:||Computer Science|
|Thesis Availability:||Restricted to Caltech community only|
|Defense Date:||26 May 1994|
|Other Numbering System:|
|Default Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Benjamin Perez|
|Deposited On:||27 Mar 2012 17:55|
|Last Modified:||09 May 2016 19:24|
- Final Version
Restricted to Caltech community only
See Usage Policy.
Repository Staff Only: item control page