Robust learning aided by context

Empirical st,udies of multitask learning provide some evidence that the performance of a learning system on its intended targets improves by presenting to the learning system related tasks, also called contexts, as additional input. Angluin, Gasarch, and Smith, as well as Kinber, Smith, Velauthapillai, and Wiehagen have provided mathematical justification for this phenomenon in the inductive inference framework. However, their proofs rely heavily on self-referential coding tricks, that is, they directly code the solution of the learning problem into the context. Fulk has shown that for the Exand Bc-anomaly hierarchies. such results, which rely on self-referential coding tricks, may not hold robustly. In this work we analyze robust versions of learning aided by context and show that ~~ in contrast to Fulk’s result above --the rob,ust versions of *This work was carried out while J. Case, S. Jain, M. Ott, and F. Stephan were visiting the School of Computer Science and Engineering at the University of New South Wales. ‘Supported hy the Deutsche Forschungsgemeinschaft (DFG) Graduiertenkolleg *‘Beherrschbarkeit, komplexer Systen:; (GRK 209/Z-96). upported by Australian Research Council Grant A49600456. SSupported by t,he Deutsche Forschungsgemeinschaft (DF’G) Grant Am 60/9-Z. Pennission to make digital or hard copies ofnll or part ofthis work for personal or classroom use is gmnted without fee provided that copies are not made or distributed for profit or commercial adwantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servem or to redistrihute to lists, requires prior specific permission and/or a fee. COLT 98 Madison WI 1JSA Copyright ACM 1998 l-581 13-057--O/981 7...$5.00 t,hese learning notions are st,ill very powerful. Also, studied is the difficulty of the functional dependence between the intended target, tasks and useful associated contexts.

[1]  Carl H. Smith,et al.  On learning multiple concepts in parallel , 1993, COLT '93.

[2]  Tom M. Mitchell,et al.  Experience with a learning personal assistant , 1994, CACM.

[3]  Sanjay Jain Robust Behaviourally Correct Learning , 1998 .

[4]  Manuel Blum,et al.  Toward a Mathematical Theory of Inductive Inference , 1975, Inf. Control..

[5]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[6]  P. Odifreddi Classical recursion theory , 1989 .

[7]  LearningStan Matwin,et al.  The Role of Context in Concept , 1996 .

[8]  Rich Caruana,et al.  Algorithms and Applications for Multitask Learning , 1996, ICML.

[9]  John Case,et al.  Comparison of Identification Criteria for Machine Inductive Inference , 1983, Theor. Comput. Sci..

[10]  Jack Mostow,et al.  Direct Transfer of Learned Information Among Neural Networks , 1991, AAAI.

[11]  Carl H. Smith,et al.  Training Sequences , 1989, Theor. Comput. Sci..

[12]  Carl H. Smith,et al.  On the role of procrastination for machine learning , 1992, COLT '92.

[13]  Daniel N. Osherson,et al.  Systems That Learn: An Introduction to Learning Theory for Cognitive and Computer Scientists , 1990 .

[14]  Frank Stephan,et al.  Inclusion Problems in Parallel Learning and Games , 1996, J. Comput. Syst. Sci..

[15]  Rolf Wiehagen,et al.  Inductive Inference with Additional Information , 1979, J. Inf. Process. Cybern..

[16]  Mark A. Fulk Robust separations in inductive inference , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[17]  Hartley Rogers,et al.  Gödel numberings of partial recursive functions , 1958, Journal of Symbolic Logic.

[18]  Jr. Hartley Rogers Theory of Recursive Functions and Effective Computability , 1969 .

[19]  James S. Royer A Connotational Theory of Program Structure , 1987, Lecture Notes in Computer Science.

[20]  Frank Stephan,et al.  On the structure of degrees of inferability , 1993, COLT '93.

[21]  Carl H. Smith,et al.  On the power of learning robustly , 1998, COLT' 98.

[22]  Terrence J. Sejnowski,et al.  NETtalk: a parallel network that learns to read aloud , 1988 .

[23]  Gholamreza Nakhaeizadeh,et al.  Incorporating Prior Knowledge About Financial Markets Through Neural Multitask Learning , 1998 .

[24]  Stuart A. Kurtz,et al.  Extremes in the Degrees of Inferability , 1994, Ann. Pure Appl. Log..

[25]  Arun Sharma,et al.  Learning with the Knowledge of an Upper Bound on Program Size , 1993, Inf. Comput..