Rollout sampling approximate policy iteration

Machine Learning

Volumn 72, Issue 3, 2008, Pages 157-171

  Dimitrakakis, Christos ^a   Lagoudakis, Michail G ^b  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

^b TECHNICAL UNIVERSITY OF CRETE   (Greece)

Author keywords

Approximate policy iteration; Bandit problems; Classification; Reinforcement learning; Rollouts; Sample complexity

Indexed keywords

BOOLEAN FUNCTIONS; CLASSIFICATION (OF INFORMATION); EDUCATION; REINFORCEMENT; STANDARDS;

COMPUTATIONAL EFFORTS; INVERTED PENDULUMS; LEARNING PROBLEMS; ORDER-OF MAGNITUDES; POLICY ITERATION; VALUE FUNCTIONS;

REINFORCEMENT LEARNING;

EID: 48349140736     PISSN: 08856125     EISSN: 15730565     Source Type: Journal    
DOI: 10.1007/s10994-008-5069-3     Document Type: Conference Paper

References (16)

1. Antos, A., Szepesvári, C., & Munos, R. (2008). Learning near-optimal policies with Bellman-residual minimization based fitted policy iteration and a single sample path. Machine Learning, 71(1), 89-129. 10.1007/s10994-007-5038-2.
2. Auer, P., Cesa-Bianchi, N., & Fischer, P. (2002). Finite-time analysis of the multiarmed bandit problem. Machine Learning Journal 47(2-3), 235-256.
3. Dimitrakakis, C., & Lagoudakis, M. (2008). Algorithms and bounds for sampling-based approximate policy iteration. (To be presented at the 8th European Workshop on Reinforcement Learning).
4. Even-Dar, E., Mannor, S., & Mansour, Y. (2006). Action elimination and stopping conditions for the multi-armed bandit and reinforcement learning problems. Journal of Machine Learning Research, 7, 1079-1105. ISSN 1533-7928.
5. Fern, A., Yoon, S., & Givan, R. (2004). Approximate policy iteration with a policy language bias. Advances in Neural Information Processing Systems, 16(3).
6. Fern, A., Yoon, S., & Givan, R. (2006). Approximate policy iteration with a policy language bias: Solving relational Markov decision processes. Journal of Artificial Intelligence Research, 25, 75-118.
7. Howard, R. A. (1960). Dynamic programming and Markov processes. Cambridge: MIT Press.
8. Kocsis, L., & Szepesvári, C. (2006). Bandit based Monte-Carlo planning. In Proceedings of the European conference on machine learning.
9. Lagoudakis, M. G. (2003). Efficient approximate policy iteration methods for sequential decision making in reinforcement learning. PhD thesis, Department of Computer Science, Duke University.
10. Lagoudakis, M. G., & Parr, R. (2003a). Least-squares policy iteration. Journal of Machine Learning Research, 4(6), 1107-1149.
11. Lagoudakis, M. G. & Parr, R. (2003b). Reinforcement learning as classification: Leveraging modern classifiers. In Proceedings of the 20th international conference on machine learning (ICML) (pp. 424-431). Washington, DC, USA.
12. Langford, J., & Zadrozny, B. (2005). Relating reinforcement learning performance to classification performance. In Proceedings of the 22nd international conference on machine learning (ICML) (pp. 473-480). Bonn, Germany, 2005. ISBN 1-59593-180-5. doi: 10.1145/1102351.1102411.
13. Rexakis, I., & Lagoudakis, M. (2008). Classifier-based policy representation. (To be presented at the 8th European Workshop on Reinforcement Learning).
14. Riedmiller, M. (2005). Neural fitted Q iteration-first experiences with a data efficient neural reinforcement learning method. In 16th European conference on machine learning (pp. 317-328).
15. Sutton, R., & Barto, A. (1998). Reinforcement learning: an introduction. Cambridge: MIT Press.
16. Wang, H. O., Tanaka, K., & Griffin, M. F. (1996). An approach to fuzzy control of nonlinear systems: Stability and design issues. IEEE Transactions on Fuzzy Systems, 4(1), 14-23.