Robert Daley
ABSTRACT
We show that for every probabilistic FIN-type learner with success ratio greater than 24/49, there is another probabilistic FIN-type learner with success ratio 1/2 that simulates the former. We will also show that this simulation result is tight. We obtain as a consequence of this work a characterization of FIN-type team learning with success ratio between 24/49 and 1/2. We conjecture that the learning capabilities of probabilistic FIN-type learners for probabilities beginning at probability 1/2 are delimited by the sequence 8n/17n-2 for n > 2, which has an accumulation point at 8/17.
- DK92a.R. Daley and B. Kalyanasundaram. Capabilities of probabilistic learners with bounded mind changes. Submitted for Publication, 1992.Google Scholar
- DK92b.R. Daley and B. Kalyanasundaram. Probabilistic and pluralistic learners with mind changes. In Mathmatical Foundations in Computer Science. Springer-Verlag, 1992. Google ScholarDigital Library
- DKV92.R. Daley, B. Kalyanasundaram, and M. Velauthapillai. The power of probabilism in popperian finite learning. In Analogical and Inductive Inference. Springer-Verlag, 1992. Google ScholarDigital Library
- DPVW91.R. Daley, L. Pitt, M. Velauthapillai, and T. Will. Relations between probabilistic and team one-shot learners. In The 1991 Workshop on Computational Learning Theory. Morgan Kaufmann, San Mateo, CA, 1991. Google ScholarDigital Library
- Fre79.R. Freivalds. Finite Identification of General Recursive Functions by Probabilistic Strategies. Akademie Verlag, Berlin, 1979.Google Scholar
- Gol67.E.M. Gold. Language identification in the limit. Information and Control, 10:447-474, 1967.Google ScholarCross Ref
- JS90.S. Jain and A. Sharma. Finite learning by a team. In The 1990 Workshop on Computational Learning Theory. Morgan Kaufmann, San Mateo, CA, 1990. Google ScholarDigital Library
- Pit89.L. Pitt. Probabilistic inductive inference. Journal of the ACM, 36:383-433, 1989. Google ScholarDigital Library
- PS88.L. Pitt and C. Smith. Probability and plurality for aggregations of learning machines. Information and Computation, 77:77-92, 1988. Google ScholarDigital Library
- Smi82.C. Smith. The power of pluralism for automatic program synthesis. Journal of the ACM, 29:1144-1165, 1982. Google ScholarDigital Library
- Vel89.M. Velauthapillai. Inductive inference with a bounded number of mind changes. In The 1989 Workshop on Computational Learning Theory. Morgan Kaufmann, San Mateo, CA, 1989. Google ScholarDigital Library
Index Terms
- Breaking the probability ½ barrier in FIN-type learning
Recommendations
Breaking the Probability 12 Barrier in FIN-Type Learning
We show that for every probabilistic FIN-type learner with success ratio greater than 2449, there is another pluralistic (or team) FIN-type learner with success ratio 24 that simulates the former. We will also show that this simulation result is tight. ...
Logic, Probability and Learning, or an Introduction to Statistical Relational Learning
SBIA '08: Proceedings of the 19th Brazilian Symposium on Artificial Intelligence: Advances in Artificial IntelligenceProbabilistic inductive logic programming (PILP), sometimes also called statistical relational learning, addresses one of the central questions of artificial intelligence: the integration of probabilistic reasoning with first order logic ...
Hierarchies of probabilistic and team FIN -learning
A FIN-learning machine M receives successive values of the function f it is learning and at some moment outputs a conjecture which should be a correct index of f. FIN learning has two extensions: (1) If M flips fair coins and learns a function with ...
Comments