Automatic learners with feedback queries

Automatic classes are classes of languages for which a finite automaton can decide whether a given element is in a set given by its index. The present work studies the learnability of automatic families by automatic learners which, in each round, output a hypothesis and update a long-term memory, depending on the input datum, via an automatic function. Many variants of automatic learners are investigated: where the long-term memory is restricted to be the current hypothesis whenever this exists, cannot be of length larger than the length of the longest datum seen, or has to consist of a constant number of examples seen so far. Learnability is also studied with respect to queries which reveal information about past data or past computation history; the number of queries per round is bounded by a constant. This paper first studies feedback queries for learning of automatic families.The types of feedback which allow to learn all automatic families are determined.Further variants like marked memory space are studied.

[1]  John Case,et al.  Automatic Learners with Feedback Queries , 2011, CiE.

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

[3]  Aurélien Lemay,et al.  Some Classes of Regular Languages Identifiable in the Limit from Positive Data , 2002, ICGI.

[4]  Sanjay Jain,et al.  ON AUTOMATIC FAMILIES , 2011 .

[5]  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 .

[6]  Todor Tsankov,et al.  The additive group of the rationals does not have an automatic presentation , 2009, The Journal of Symbolic Logic.

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

[8]  Sanjay Jain,et al.  Uncountable automatic classes and learning , 2009, Theor. Comput. Sci..

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

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

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

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

[13]  William I. Gasarch,et al.  Book Review: An introduction to Kolmogorov Complexity and its Applications Second Edition, 1997 by Ming Li and Paul Vitanyi (Springer (Graduate Text Series)) , 1997, SIGACT News.

[14]  Sanjay Jain,et al.  Robust Learning of Automatic Classes of Languages , 2011, ALT.

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

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

[17]  Dana Angluin,et al.  Inference of Reversible Languages , 1982, JACM.

[18]  Ming Li,et al.  An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.

[19]  Carl H. Smith,et al.  On the impact of forgetting on learning machines , 1995, JACM.

[20]  David B. A. Epstein,et al.  Word processing in groups , 1992 .

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

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

[23]  Sasha Rubin,et al.  Automata Presenting Structures: A Survey of the Finite String Case , 2008, Bulletin of Symbolic Logic.

[24]  Achim Blumensath,et al.  Automatic structures , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).

[25]  Frank Stephan,et al.  Language Learning from Texts: Mindchanges, Limited Memory, and Monotonicity , 1995, Inf. Comput..

[26]  Kenneth Wexler,et al.  Formal Principles of Language Acquisition , 1980 .

[27]  Henning Fernau,et al.  Identification of function distinguishable languages , 2000, Theor. Comput. Sci..

[28]  Satoshi Kobayashi,et al.  Locality, Reversibility, and Beyond: Learning Languages from Positive Data , 1998, ALT.

[29]  André Nies,et al.  Finite automata presentable abelian groups , 2007, Ann. Pure Appl. Log..

[30]  Sanjay Jain,et al.  Learnability of automatic classes , 2012, J. Comput. Syst. Sci..

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

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

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

[34]  André Nies,et al.  Describing Groups , 2007, Bulletin of Symbolic Logic.

[35]  John Case,et al.  Automatic Learning of Subclasses of Pattern Languages , 2011, LATA.