Mind change speed-up for learning languages from positive data

Within the frameworks of learning in the limit of indexed classes of recursive languages from positive data and automatic learning in the limit of indexed classes of regular languages (with automatically computable sets of indices), we study the problem of minimizing the maximum number of mind changes FM(n) by a learner M on all languages with indices not exceeding n. For inductive inference of recursive languages, we establish two conditions under which FM(n) can be made smaller than any recursive unbounded non-decreasing function. We also establish how FM(n) is aected if at least one of these two conditions does not hold. In the case of automatic learning, some partial results addressing speeding up the function FM(n) are obtained.

[1]  Carl H. Smith,et al.  On the Complexity of Inductive Inference , 1986, Inf. Control..

[2]  Thomas Zeugmann,et al.  Learning recursive functions: A survey , 2008, Theor. Comput. Sci..

[3]  Anil Nerode,et al.  Automatic Presentations of Structures , 1994, LCC.

[4]  Rolf Wiehagen,et al.  On the Complexity of Effective Program Synthesis , 1986, AII.

[5]  Lane A. Hemaspaandra,et al.  Query Order , 1998, SIAM J. Comput..

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

[7]  Thomas Zeugmann,et al.  Language Learning with a Bounded Number of Mind Changes , 1993, STACS.

[8]  Rusins Freivalds,et al.  Inductive Inference of Recursive Functions: Complexity Bounds , 1991, Baltic Computer Science.

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

[10]  Dana Angluin,et al.  Finding Patterns Common to a Set of Strings , 1980, J. Comput. Syst. Sci..

[11]  Juris Hartmanis,et al.  The Boolean Hierarchy I: Structural Properties , 1988, SIAM J. Comput..

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

[13]  Carl H. Smith,et al.  On the Intrinsic Complexity of Learning , 1995, Inf. Comput..

[14]  Thomas Zeugmann,et al.  Language learning in dependence on the space of hypotheses , 1993, COLT '93.

[15]  Sanjay Jain,et al.  Mind Change Speed-up for Learning Languages from Positive Data , 2012, STACS.

[16]  Manuel Blum,et al.  A Machine-Independent Theory of the Complexity of Recursive Functions , 1967, JACM.

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

[18]  Sanjay Jain,et al.  Learnability of Automatic Classes , 2010, LATA.

[19]  Klaus W. Wagner,et al.  The Difference and Truth-Table Hierarchies for NP , 1987, RAIRO Theor. Informatics Appl..

[20]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[21]  R. Beigel,et al.  Bounded Queries to SAT and the Boolean Hierarchy , 1991, Theor. Comput. Sci..

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