Using confidence bounds for exploitation-exploration trade-offs
The Journal of Machine Learning Research
Proceedings of the 25th international conference on Machine learning
Reinforcement learning: a survey
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
An agent that must learn to act in the world by trial and error faces the reinforcement learning problem, which is quite different from standard concept learning. Although good algorithms exist for this problem in the general case, they are often quite inefficient and do not exhibit generalization. One strategy is to find restricted classes of action policies that can be learned more efficiently. This paper pursues that strategy by developing an algorithm that performans an on-line search through the space of action mappings, expressed as Boolean formulae. The algorithm is compared with existing methods in empirical trials and is shown to have very good performance.