Computational Limits on Team Identification of Languages

A team of learning machines is a multiset of learning machines. A team is said to successfully identify a concept just in case each member of some nonempty subset, of predetermined size, of the team identifies the concept. Team identification of programs for computable functions from their graphs has been investigated by Smith. Pitt showed that this notion is essentially equivalent to function identification by a single probabilistic machine. The present paper introduces, motivates, and studies the more difficult subject of team identification of grammars for languages from positive data. It is shown that an analog of Pitt's result about equivalence of team function identification and probabilistic function identification does not hold for language identification, and the results in the present paper reveal a very complex structure for team language identification. It is also shown that for certain cases probabilistic language identification is strictly more powerful than team language identification. Proofs of many results in the present paper involve very sophisticated diagonalization arguments. Two very general tools are presented that yield proofs of new results from simple arithmetic manipulation of the parameters of known ones.

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

[2]  Carl H. Smith,et al.  Probability and Plurality for Aggregations of Learning Machines , 1987, Inf. Comput..

[3]  Patrick Billingsley,et al.  Probability and Measure. , 1986 .

[4]  Carl H. Smith,et al.  The Power of Pluralism for Automatic Program Synthesis , 1982, JACM.

[5]  Bala Kalyanasundaram,et al.  Breaking the probability ½ barrier in FIN-type learning , 1992, COLT '92.

[6]  Arun Sharma,et al.  On Aggregating Teams of Learning Machines , 1995, Theor. Comput. Sci..

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

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

[9]  Daniel N. Osherson,et al.  Aggregating Inductive Expertise , 1986, Inf. Control..

[10]  Leonard Pitt,et al.  A Characterization of Probabilistic Inference , 1984, FOCS.

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

[12]  Hartley Rogers,et al.  Gödel numberings of partial recursive functions , 1958, Journal of Symbolic Logic.

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

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

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

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

[17]  Leonard Pitt,et al.  Probabilistic inductive inference , 1989, JACM.

[18]  R. V. Freivald.  Functions Computable in the Limit by Probabilistic Machines , 1974, MFCS.

[19]  John T. Gill,et al.  Computational complexity of probabilistic Turing machines , 1974, STOC '74.

[20]  Arun Sharma,et al.  Finite learning by a “team” , 1990, COLT '90.

[21]  Arun Sharma,et al.  Probability is more powerful than team for language identification from positive data , 1993, COLT '93.

[22]  Carl H. Smith,et al.  The power of parallelism for automatic program synthesis , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[23]  Bala Kalyanasundaram,et al.  Breaking the Probability 1/2 Barrier in FIN-Type Learning , 1995, J. Comput. Syst. Sci..

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

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

[26]  Leonard Pitt,et al.  Relations between probabilistic and team one-shot learners (extended abstract) , 1991, COLT '91.

[27]  Mahendran Velauthapillai.  Inductive inference with bounded number of mind changes , 1989, COLT '89.

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