Learning by switching type of information

The present work is dedicated to the study of modes of data-presentation in the range between text and informant within the framework of inductive inference. In this study, the learner alternatingly requests sequences of positive and negative data. We define various formalizations of valid data presentations in such a scenario. We resolve the relationships between these different formalizations, and show that one of these is equivalent to learning from informant. We also show a hierarchy formed (for each of the formalizations studied) by considering the number of switches between requests for positive and negative data.

[1]  John Case,et al.  Not-So-Nearly-Minimal-Size Program Inference , 1995, GOSLER Final Report.

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

[3]  John Case,et al.  Machine Inductive Inference and Language Identification , 1982, ICALP.

[4]  William I. Gasarch,et al.  Learning via queries to an oracle , 1989, COLT '89.

[5]  G. Sacks.  Higher recursion theory , 1990 .

[6]  Paul Young,et al.  An introduction to the general theory of algorithms , 1978 .

[7]  Sanjay Jain,et al.  Classes with easily learnable subclasses , 2004, Inf. Comput..

[8]  Dana Angluin,et al.  Learning Regular Sets from Queries and Counterexamples , 1987, Inf. Comput..

[9]  Frank Stephan,et al.  On the Learnability of Vector Spaces , 2002, ALT.

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

[11]  Rolf Wiehagen,et al.  Identification of Formal Languages , 1977, MFCS.

[12]  Arun Sharma,et al.  On the Non-Existence of Maximal Inference Degrees for Language Identification , 1993, Inf. Process. Lett..

[13]  Mark A. Fulk.  Prudence and Other Conditions on Formal Language Learning , 1990, Inf. Comput..

[14]  E. Mark Gold,et al.  Language Identification in the Limit , 1967, Inf. Control..

[15]  John Case,et al.  The Power of Vacillation in Language Learning , 1999, SIAM J. Comput..

[16]  Carl H. Smith,et al.  On the Role of Procrastination in Machine Learning , 1993, Inf. Comput..

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

[18]  Tatsuya Motoki,et al.  Inductive Inference from all Positive and Some Negative Data , 1991, Inf. Process. Lett..

[19]  Patrick Brézillon,et al.  Lecture Notes in Artificial Intelligence , 1999 .

[20]  Stephen Cole Kleene,et al.  On notation for ordinal numbers , 1938, Journal of Symbolic Logic.

[21]  D. C. Cooper,et al.  Theory of Recursive Functions and Effective Computability , 1969, The Mathematical Gazette.

[22]  Frank Stephan,et al.  Refuting Learning Revisited , 2001, Theor. Comput. Sci..

[23]  Arun Sharma,et al.  A Note on Batch and Incremental Learnability , 1998, J. Comput. Syst. Sci..

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

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

[26]  John Case,et al.  Language Learning with Some Negative Information , 1993, J. Comput. Syst. Sci..