Intrinsic complexity of partial learning

Abstract A partial learner in the limit [25] , given a representation of the target language (a text), outputs a sequence of conjectures, where one correct conjecture appears infinitely many times and other conjectures each appear a finite number of times. Following [7] and [21] , we define intrinsic complexity of partial learning, based on reducibilities between learning problems. Although the whole class of recursively enumerable languages is partially learnable (see [25] ) and, thus, belongs to the complete learnability degree, we discovered a rich structure of incomplete degrees, reflecting different types of learning strategies (based, to some extent, on topological structures of the target language classes). We also exhibit examples of complete classes that illuminate the character of the strategies for partial learning of the hardest classes.

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

[2]  Sanjay Jain,et al.  Learning languages from positive data and negative counterexamples , 2008, J. Comput. Syst. Sci..

[3]  John Case,et al.  Computability-theoretic learning complexity , 2012, Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences.

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

[5]  Arun Sharma,et al.  On the intrinsic complexity of language identification , 1994, COLT '94.

[6]  Sanjay Jain,et al.  Intrinsic Complexity of Partial Learning , 2019, ALT.

[7]  Rolf Wiehagen,et al.  Language Learning from Texts: Degrees of Intrinsic Complexity and Their Characterizations , 2000, J. Comput. Syst. Sci..

[8]  Daniel Reidenbach,et al.  A non-learnable class of E-pattern languages , 2006, Theor. Comput. Sci..

[9]  Carl H. Smith,et al.  On the intrinsic complexity of learning recursive functions , 2003, Inf. Comput..

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

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

[12]  Takeshi Shinohara,et al.  Polynomial Time Inference of Extended Regular Pattern Languages , 1983, RIMS Symposium on Software Science and Engineering.

[13]  Enrique Vidal,et al.  Learning Locally Testable Languages in the Strict Sense , 1990, ALT.

[14]  Frank Stephan,et al.  Confident and Consistent Partial Learning of Recursive Functions , 2012, ALT.

[15]  Frank Stephan,et al.  Combining Models of Approximation with Partial Learning , 2015, ALT.

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

[17]  Sanjay Jain,et al.  Intrinsic complexity of learning geometrical concepts from positive data , 2003, J. Comput. Syst. Sci..

[18]  Sanjay Jain,et al.  A Survey on Recent Results on Partial Learning , 2015 .

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

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

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

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

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