Relations between Gold-style learning and query learning

Different formal learning models address different aspects of human learning. Below we compare Gold-style learning-modelling learning as a limiting process in which the learner may change its mind arbitrarily often before converging to a correct hypothesis-to learning via queries-modelling learning as a one-shot process in which the learner is required to identify the target concept with just one hypothesis. In the Gold-style model considered below, the information presented to the learner consists of positive examples for the target concept, whereas in query learning, the learner may pose a certain kind of queries about the target concept, which will be answered correctly by an oracle (called teacher). Although these two approaches seem rather unrelated at first glance, we provide characterisations of different models of Gold-style learning (learning in the limit, conservative inference, and behaviourally correct learning) in terms of query learning. Thus we describe the circumstances which are necessary to replace limit learners by equally powerful one-shot learners. Our results are valid in the general context of learning indexable classes of recursive languages. This analysis leads to an important observation, namely that there is a natural query learning type hierarchically in-between Gold-style learning in the limit and behaviourally correct learning. Astonishingly, this query learning type can then again be characterised in terms of Gold-style inference.

[1]  Dana Angluin Queries revisited , 2004, Theor. Comput. Sci..

[2]  Patrick Brézillon,et al.  Lecture Notes in Artificial Intelligence , 1999 .

[3]  Thomas Zeugmann,et al.  A Guided Tour Across the Boundaries of Learning Recursive Languages , 1995, GOSLER Final Report.

[4]  D. C. Cooper,et al.  Theory of Recursive Functions and Effective Computability , 1969, The Mathematical Gazette.

[5]  Sandra Zilles,et al.  Formal language identification: query learning vs. Gold-style learning , 2004, Inf. Process. Lett..

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

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

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

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

[10]  Sandra Zilles,et al.  Comparison of Query Learning and Gold-Style Learning in Dependence of the Hypothesis Space , 2004, ALT.

[11]  Sanjay Jain,et al.  Learning Languages from Positive Data and a Finite Number of Queries , 2004, FSTTCS.

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

[13]  Daniel Reidenbach A Negative Result on Inductive Inference of Extended Pattern Languages , 2002, ALT.

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

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

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

[17]  Sandra Zilles,et al.  On the Learnability of Erasing Pattern Languages in the Query Model , 2003, ALT.

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

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

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

[21]  Dana Angluin,et al.  Queries and concept learning , 1988, Machine Learning.

[22]  Sandra Zilles,et al.  Replacing Limit Learners with Equally Powerful One-Shot Query Learners , 2004, COLT.