Iterative learning from texts and counterexamples using additional information

A variant of iterative learning in the limit (cf. Lange and Zeugmann 1996) is studied when a learner gets negative examples refuting conjectures containing data in excess of the target language and uses additional information of the following four types: (a) memorizing up to n input elements seen so far; (b) up to nfeedback memberships queries (testing if an item is a member of the input seen so far); (c) the number of input elements seen so far; (d) the maximal element of the input seen so far. We explore how additional information available to such learners (defined and studied in Jain and Kinber 2007) may help. In particular, we show that adding the maximal element or the number of elements seen so far helps such learners to infer any indexed class of languages class-preservingly (using a descriptive numbering defining the class)—as it is proved in Jain and Kinber (2007), this is not possible without using additional information. We also study how, in the given context, different types of additional information fare against each other, and establish hierarchies of learners memorizing n+1 versus n input elements seen and n+1 versus n feedback membership queries.

[1]  Chen Lin,et al.  Neural Information Processing -letters and Reviews Simplify Support Vector Machines by Iterative Learning , 2022 .

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

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

[4]  John Case,et al.  Incremental Concept Learning for Bounded Data Mining , 1997, Inf. Comput..

[5]  Sanjay Jain,et al.  Iterative Learning from Positive Data and Negative Counterexamples , 2007, ALT.

[6]  D. Angluin.  Queries and Concept Learning , 1988 .

[7]  C. Jockusch.  Semirecursive sets and positive reducibility , 1968 .

[8]  Shutao Li,et al.  Gene Feature Extraction Using T-Test Statistics and Kernel Partial Least Squares , 2006, ICONIP.

[9]  Ronald J. Brachman,et al.  The Process of Knowledge Discovery in Databases , 1996, Advances in Knowledge Discovery and Data Mining.

[10]  Thomas Zeugmann,et al.  Incremental Learning from Positive Data , 1996, J. Comput. Syst. Sci..

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

[12]  Thomas Zeugmann,et al.  Types of monotonic language learning and their characterization , 1992, COLT '92.

[13]  Padhraic Smyth,et al.  From Data Mining to Knowledge Discovery in Databases , 1996, AI Mag..

[14]  Sanjay Jain,et al.  Learning Languages from Positive Data and Negative Counterexamples , 2004, ALT.

[15]  守屋 悦朗,et al.  J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .

[16]  Thomas Zeugmann,et al.  Learning indexed families of recursive languages from positive data: A survey , 2008, Theor. Comput. Sci..

[17]  Karl R. Popper.  The Logic of Scientific Discovery. , 1977 .

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

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

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

[21]  Sanjay Jain,et al.  Iterative Learning from Texts and Counterexamples Using Additional Information , 2009, ALT.

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

[23]  Rolf Wiehagen.  Limes-Erkennung rekursiver Funktionen durch spezielle Strategien , 1975, J. Inf. Process. Cybern..

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

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

[26]  John Case,et al.  U-shaped, iterative, and iterative-with-counter learning , 2007, Machine Learning.

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

[28]  John Case,et al.  Periodicity in generations of automata , 1974, Mathematical systems theory.