Learning regular sets from queries and counterexamples
Information and Computation
COLT '90 Proceedings of the third annual workshop on Computational learning theory
Technical Note: \cal Q-Learning
Machine Learning
Decision theoretic generalizations of the PAC model for neural net and other learning applications
Information and Computation
Inference of finite automata using homing sequences
Information and Computation
THE WEIGHTED MAJORITY ALGORITHM (Supersedes 89-16)
THE WEIGHTED MAJORITY ALGORITHM (Supersedes 89-16)
| Hi-index | 0.00 |
We describe and compare two paradigms of on-line learning, which we call Bayesian and Popperian. In this paper the Bayesian paradigm is represented by Littlestone and Warmuth's Weighted Majority Algorithm, and the Popperian paradigm is represented by Rivest and Schapire's reset-free algorithm for exact learning of finite automata with membership and equivalence queries. Both algorithms are applied to the problem of optimal control of a finite-state plant in a finite-state environment. The advantage of the control strategy based on the Weighted Majority Algorithm is its robustness and better performance (actually, its performance is nearly optimal in the class of deterministic control strategies), and the advantage of the control strategy based on Rivest and Schapire's algorithm is its computational efficiency.