Institutional Repository
Technical University of Crete
EN  |  EL

Search

Browse

My Space

Rollout sampling approximate policy iteration

Dimitrakakis Christos, Lagoudakis Michael

Full record


URI: http://purl.tuc.gr/dl/dias/157117EC-5401-47A1-B453-9D39AAFFC2E2
Year 2008
Type of Item Peer-Reviewed Journal Publication
License
Details
Bibliographic Citation C. Dimitrakakis and M. G. Lagoudakis "Rollout sampling approximate policy iteration," Machine Learning, vol. 72, no. 3, pp. 157-171, Sept. 2008. doi: 10.1007/s10994-008-5069-3 https://doi.org/10.1007/s10994-008-5069-3
Appears in Collections

Summary

Several researchers have recently investigated the connection between reinforcement learning and classification. We are motivated by proposals of approximate policy iteration schemes without value functions, which focus on policy representation using classifiers and address policy learning as a supervised learning problem. This paper proposes variants of an improved policy iteration scheme which addresses the core sampling problem in evaluating a policy through simulation as a multi-armed bandit machine. The resulting algorithm offers comparable performance to the previous algorithm achieved, however, with significantly less computational effort. An order of magnitude improvement is demonstrated experimentally in two standard reinforcement learning domains: inverted pendulum and mountain-car.

Services

Statistics