Probability and plurality for aggregations of learning machines
Information and Computation
Probabilistic inductive inference
Journal of the ACM (JACM)
Regular Article: Open problems in “systems that learn”
Proceedings of the 30th IEEE symposium on Foundations of computer science
On the impact of forgetting on learning machines
Journal of the ACM (JACM)
Learning branches and learning to win closed games
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Incremental concept learning for bounded data mining
Information and Computation
Predictive learning models for concept drift
Theoretical Computer Science - Algorithmic learning theory
Learning to win process-control games watching game-masters
Information and Computation
Dynamic Modeling in Inductive Inference
ALT '08 Proceedings of the 19th international conference on Algorithmic Learning Theory
Learning secrets interactively. Dynamic modeling in inductive inference
Information and Computation
| Hi-index | 0.00 |
A mere bounded number of random bits judiciously employed by a probabilistically correct algorithmic coordinator is shown to increase the power of learning to coordinate compared to deterministic algorithmic coordinators. Furthermore, these probabilistic algorithmic coordinators are provably not characterized in power by teams of deterministic ones. An insightful, enumeration technique based, normal form characterization of the classes that are learnable by total computable coordinators is given. These normal forms are for insight only since it is shown that the complexity of the normal form of a total computable coordinator can be infeasible compared to the original coordinator. Montagna and Osherson showed that the competence class of a total coordinator cannot be strictly improved by another total coordinator. It is shown in the present paper that the competencies of any two total coordinators are the same modulo isomorphism. Furthermore, a completely effective, index set version of this competency isomorphism result is given, where all the coordinators are total computable. We also investigate the competence classes of total coordinators from the points of view of topology and descriptive set theory.