On Identification by Teams and Probabilistic Machines

Inductive inference in the scientific domain is seldom an individual enterprise. Many a scientific breakthrough are result of the efforts of several scientists investigating a problem; scientific success is achieved if any one or more of members of the scientific community are successful. This observation about the practice of science can be partially incorporated in a model of computational learning that employs a ‘team’ of algorithmic machines instead of a single algorithmic machine. The team is said to be successful just in case one or more members in the team are successful.

[1]  Bala Kalyanasundaram,et al.  Capabilities of fallible FINite learning , 1993, COLT '93.

[2]  Robert P. Daley.  Inductive inference hierarchies: probabilistic vs pluralistic strategies , 1985, Mathematical Methods of Specification and Synthesis of Software Systems.

[3]  Rusins Freivalds,et al.  On the Power of Probabilistic Strategies in Inductive Inference , 1984, Theor. Comput. Sci..

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

[5]  Bala Kalyanasundaram,et al.  The Power of Probabilism in Popperian FINite Learning (extended abstract) , 1992, AII.

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

[7]  Robert P. Daley.  On the Error Correcting Power of Pluralism in BC-Type Inductive Inference , 1983, Theoretical Computer Science.

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

[9]  Paul Young,et al.  An introduction to the general theory of algorithms , 1978 .

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

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

[12]  Bala Kalyanasundaram,et al.  The power of probabilism in Popperian FINite learning , 1994, J. Exp. Theor. Artif. Intell..

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

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

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

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

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

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

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

[20]  Robert P. Daley.  Transformation of probabilistic learning strategies into deterministic learning strategies , 1988, COLT '88.

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

[22]  Carl H. Smith,et al.  Trade-Off among Parameters Effecting Inductive Inference , 1989, Inf. Comput..

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

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

[25]  Arun Sharma,et al.  Language Learning by a "Team" (Extended Abstract) , 1990, ICALP.

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

[27]  Bala Kalyanasundaram,et al.  Capabilities of probabilistic learners with bounded mind changes , 1993, COLT '93.

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

[29]  Arun Sharma,et al.  Finite Identification of Functions by Teams with Success Ratio 1\over2 and Above , 1995, Inf. Comput..

[30]  Bala Kalyanasundaram,et al.  Use of Reduction Arguments in Determining Popperian FIN-Type Learning Capabilities , 1993, ALT.

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

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

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

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

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

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

[37]  Arun Sharma,et al.  Computational Limits on Team Identification of Languages , 1996, Inf. Comput..