Partial Learning of Recursively Enumerable Languages

This paper studies several typical learning criteria in the model of partial learning of r.e. sets in the recursion-theoretic framework of inductive inference. Its main contribution is a complete picture of how the criteria of confidence, consistency and conservativeness in partial learning of r.e. sets separate, also in relation to basic criteria of learning in the limit. Thus this paper constitutes a substantial extension to prior work on partial learning. Further highlights of this work are very fruitful characterisations of some of the inference criteria studied, leading to interesting consequences about the structural properties of the collection of classes learnable under these criteria. In particular a class is consistently partially learnable iff it is a subclass of a uniformly recursive family.

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

[2]  Sanjay Jain,et al.  Consistent Partial Identification , 2009, COLT.

[3]  John Case,et al.  The Synthesis of Language Learners , 1999, Inf. Comput..

[4]  John Case,et al.  Difficulties in Forcing Fairness of Polynomial Time Inductive Inference , 2009, ALT.

[5]  Akihiro Yamamoto,et al.  Learning Families of Closed Sets in Matroids , 2012, Computation, Physics and Beyond.

[6]  Dick de Jongh,et al.  Angluin's theorem for indexed families of r.e. sets and applications , 1996, COLT '96.

[7]  Robert H. Sloan,et al.  BOOK REVIEW: "SYSTEMS THAT LEARN: AN INTRODUCTION TO LEARNING THEORY, SECOND EDITION", SANJAY JAIN, DANIEL OSHERSON, JAMES S. ROYER and ARUN SHARMA , 2001 .

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

[9]  Sanjay Jain,et al.  On Conservative Learning of Recursively Enumerable Languages , 2013, CiE.

[10]  Dana Angluin,et al.  Inductive Inference of Formal Languages from Positive Data , 1980, Inf. Control..

[11]  Rolf Wiehagen,et al.  Learning and Consistency , 1995, GOSLER Final Report.

[12]  Leonard Pitt,et al.  Inductive Inference, DFAs, and Computational Complexity , 1989, AII.

[13]  Thomas Zeugmann,et al.  Characterizations of Monotonic and Dual Monotonic Language Learning , 1995, Inf. Comput..

[14]  Steffen Lange,et al.  Algorithmic Learning for Knowledge-Based Systems: Gosler Final Report , 1995 .

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

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

[17]  Frank Stephan,et al.  Confident and consistent partial learning of recursive functions , 2012, Theor. Comput. Sci..

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