Prescribed Learning of Indexed Families

This work extends studies of Angluin, Lange and Zeugmann on how learnability of a language class depends on the hypothesis space used by the learner. While previous studies mainly focused on the case where the learner chooses a particular hypothesis space, the goal of this work is to investigate the case where the learner has to cope with all possible hypothesis spaces. In that sense, the present work combines the approach of Angluin, Lange and Zeugmann with the question of how a learner can be synthesized. The investigation for the case of uniformly r.e. classes has been done by Jain, Stephan and Ye [6]. This paper investigates the case for indexed families and gives a special attention to the notions of conservative and non U-shaped learning.

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

[2]  Sanjay Jain,et al.  Prescribed Learning of R.E. Classes , 2007, ALT.

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

[4]  Klaus P. Jantke Monotonic and non-monotonic inductive inference , 2009, New Generation Computing.

[5]  Sandra Zilles Separation of uniform learning classes , 2004, Theor. Comput. Sci..

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

[7]  Ludwig Staiger On the Power of Reading the Whole Infinite Input Tape , 1999, Grammars.

[8]  D. C. Cooper,et al.  Theory of Recursive Functions and Effective Computability , 1969 .

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

[10]  Thomas Zeugmann,et al.  Monotonic and Dual Monotonic Language Learning , 1996, Theor. Comput. Sci..

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

[12]  Sandra Zilles,et al.  Increasing the power of uniform inductive learners , 2005, J. Comput. Syst. Sci..

[13]  John Case,et al.  When unlearning helps , 2008, Inf. Comput..

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

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

[16]  Rocco A. Servedio,et al.  Algorithmic Learning Theory, 18th International Conference, ALT 2007, Sendai, Japan, October 1-4, 2007, Proceedings , 2007, ALT.

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

[18]  Emil L. Post Recursively enumerable sets of positive integers and their decision problems , 1944 .