Hierarchical model-based reinforcement learning: R-MAX + MAXQ

Proceedings of the 25th International Conference on Machine Learning

Volumn , Issue , 2008, Pages 432-439

  Jong, Nicholas K ^a   Stone, Peter ^a  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; EDUCATION; HIERARCHICAL SYSTEMS; LEARNING SYSTEMS; REINFORCEMENT; REINFORCEMENT LEARNING; ROBOT LEARNING; CONVERGENCE OF NUMERICAL METHODS;

AND MODELS; FINITE-TIME CONVERGENCES; FULLY INTEGRATES; HIERARCHICAL DECOMPOSITIONS; HIERARCHICAL MODELS; LARGE ENVIRONMENTS; LEARNING METHODS; MODEL-BASED; REINFORCEMENT LEARNING ALGORITHMS; SIMULATION ENVIRONMENTS; LEARNING SETTINGS; MODEL-BASED ALGORITHMS; REAL-WORLD PROBLEMS; SAMPLE COMPLEXITY;

LEARNING ALGORITHMS;

EID: 56449090073     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. Barto, A. G., & Mahadevan, S. (2003). Recent advances in hierarchical reinforcement learning. Discrete-Event Systems, 13, 41-77. Special Issue on Reinforcement Learning.
2. Boutilier, C., Dearden, R., & Goldszmidt, M. (1995). Exploiting structure in policy construction. Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (pp. 1104-1111).
3. Brafman, R. I., & Tennenholtz, M. (2002). R-MAX - a general polynomial time algorithm for near-optimal reinforcement learning. Journal of Machine Learning Research, 3, 213-231.
4. Dietterich, T. G. (2000). Hierarchical reinforcement learning with the MAXQ value function decomposition. Journal of Artificial Intelligence Research, 13, 227-303.
5. Diuk, C., Strehl, A. L., & Littman, M. L. (2006). A hierarchical approach to efficient reinforcement learning in deterministic domains. Proceedings of the Fifth International Joint Conference on Autonomous Agents and Multiagent Systems.
6. Jong, N. K., Hester, T., & Stone, P. (2008). The utility of temporal abstraction in reinforcement learning. Proceedings of the Seventh International Joint Conference on Autonomous Agents and Multiagent Systems.
7. Kakade, S. M. (2003). On the sample complexity of reinforcement learning. Doctoral dissertation, University College London.
8. Kearns, M., & Singh, S. (1998). Near-optimal reinforcement learning in polynomial time. Proceedings of the Fifteenth International Conference on Machine Learning (pp. 260-268).
9. Moore, A. W., & Atkeson, C. G. (1993). Prioritized sweeping: Reinforcement learning with less data and less real time. Machine Learning, 13, 103-130.
10. Seri, S., & Tadepalli, P. (2002). Model-based hierarchical average-reward reinforcement learning. Proceedings of the Nineteenth International Conference on Machine Learning (pp. 562-569).
11. Şimşek, Ö., & Barto, A. G. (2004). Using relative novelty to identify useful temporal abstractions in reinforcement learning. Proceedings of the Twenty-First International Conference on Machine Learning (pp. 751-758).
12. Singh, S., Barto, A. G., & Chentanez, N. (2005). Intrinsically motivated reinforcement learning. Advances in Neural Information Processing Systems 17.
13. Sutton, R. S., & Barto, A. G. (1998). Reinforcement learning: An introduction. Cambridge, MA: MIT Press.
14. Sutton, R. S., Precup, D., & Singh, S. (1999). Between MDPs and semi-MDPs: A framework for temporal abstraction in reinforcement learning. Artificial Intelligence, 112, 181-211.