Hypothesis spaces for learning

In this paper we survey some results in inductive inference showing how learnability of a class of languages may depend on the hypothesis space chosen. Additionally, optimal hypothesis spaces, usable for every learnable class, are considered. We also discuss results which consider how learnability is effected if one requires learning using every suitable hypothesis space.

[1]  Thomas Zeugmann,et al.  Learning recursive functions: A survey , 2008, Theor. Comput. Sci..

[2]  Thomas Zeugmann,et al.  Learning Recursive Languages with Bounded Mind Changes , 1993, Int. J. Found. Comput. Sci..

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

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

[5]  Sanjay Jain,et al.  Prescribed Learning of Indexed Families , 2008, Fundam. Informaticae.

[6]  Sanjay Jain,et al.  Prescribed learning of r.e. classes , 2009, Theor. Comput. Sci..

[7]  R. Stavy,et al.  U-shaped behavioral growth , 1982 .

[8]  Rolf Wiehagen.  A Thesis in Inductive Inference , 1990, Nonmonotonic and Inductive Logic.

[9]  Arun Sharma,et al.  Learning with the Knowledge of an Upper Bound on Program Size , 1993, Inf. Comput..

[10]  Gregory A. Riccardi.  The Independence of Control Structures in Abstract Programming Systems , 1981, J. Comput. Syst. Sci..

[11]  S Pinker,et al.  Overregularization in language acquisition. , 1992, Monographs of the Society for Research in Child Development.

[12]  Sanjay Jain,et al.  A general comparison of language learning from examples and from queries , 2007, Theor. Comput. Sci..

[13]  Sanjay Jain,et al.  Learning in Friedberg numberings , 2008, Inf. Comput..

[14]  Rusins Freivalds,et al.  Inductive Inference and Computable One-One Numberings , 1982, Math. Log. Q..

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

[16]  Roger S. Brown,et al.  Three Processes in the Child's Acquisition of Syntax , 1964 .

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

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

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

[20]  J. Case,et al.  Subrecursive Programming Systems: Complexity & Succinctness , 1994 .

[21]  John Case,et al.  The Power of Vacillation in Language Learning , 1999, SIAM J. Comput..

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

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

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

[25]  Rolf Wiehagen,et al.  Inductive Inference with Additional Information , 1979, J. Inf. Process. Cybern..

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

[27]  Carl H. Smith,et al.  Inductive Inference: Theory and Methods , 1983, CSUR.

[28]  Sanjay Jain,et al.  Numberings optimal for learning , 2010, J. Comput. Syst. Sci..

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

[30]  James S. Royer,et al.  Subrecursive Programming Systems , 1994, Progress in Theoretical Computer Science.

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

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

[33]  Mark A. Fulk.  A study of inductive inference machines , 1986 .

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

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

[36]  M. Bowerman.  Starting to talk worse: Clues to language acquisition from children's late speech errors , 1982 .

[37]  Thomas Zeugmann,et al.  Set-driven and rearrangement-independent learning of recursive languages , 1994, Mathematical systems theory.

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

[39]  Rolf Wiehagen,et al.  Learning and Consistency , 1995, GOSLER Final Report.

[40]  Daniel N. Osherson,et al.  Criteria of Language Learning , 1982, Inf. Control..

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

[42]  John Case,et al.  Control structures in hypothesis spaces: the influence on learning , 2002, Theor. Comput. Sci..

[43]  James S. Royer.  A Connotational Theory of Program Structure , 1987, Lecture Notes in Computer Science.

[44]  Richard M. Friedberg,et al.  Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication , 1958, Journal of Symbolic Logic.

[45]  John Case,et al.  Comparison of Identification Criteria for Machine Inductive Inference , 1983, Theor. Comput. Sci..

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

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

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

[49]  Yoav Freund,et al.  ALT 2008. 19th international conference on algorithmic learning theory. Budapest, 2008. (Lecture notes in artificial intelligence 5254.) , 2008 .

[50]  P. Dale.  Language development; structure and function , 1972 .