Efficient structure learning in factored-state MDPs

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2007, Pages 645-650

  Strehl, Alexander L ^a   Diuk, Carlos ^a   Littman, Michael L ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BAYESIAN NETWORKS; DATA STRUCTURES; LEARNING ALGORITHMS; PROBABILITY; PROBLEM SOLVING;

STRUCTURE LEARNING;

REINFORCEMENT LEARNING;

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

References (11)

1. Abbeel, P.; Koller, D.; and Ng, A. Y. 2006. Learning factor graphs in polynomial time and sample complexity. JMLR.
2. Boutilier, C.; Dean, T.; and Hanks, S. 1999. Decision-theoretic planning: Structural assumptions and computational leverage. Journal of Artificial Intelligence Research 11:1-94.
3. Brafman, R. I., and Tennenholtz, M. 2002. R-MAX-a general polynomial time algorithm for near-optimal reinforcement learning. Journal of Machine Learning Research 3:213-231.
4. Degris, T.; Sigaud, O.; and Wuillemin, P.-H. 2006. Learning the structure of factored Markov decision processes in reinforcement learning problems. In ICML-06: Proceedings of the 23rd international conference on Machine learning, 257-264.
5. Dietterich, T. G. 2000. Hierarchical reinforcement learning with the MAXQ value function decomposition. Journal of Artificial Intelligence Research 13:227-303.
6. Guestrin, C.; Patrascu, R.; and Schuurmans, D. 2002. Algorithmdirected exploration for model-based reinforcement learning in factored MDPs. In Pmceedings of the International Conference on Machine Learning, 235-242.
7. Kakade, S. M. 2003. On the Sample Complexity of Reinforcement Learning. Ph.D. Dissertation, Gatsby Computational Neuroscience Unit, University College London.
8. Kearns, M. J., and Koller, D. 1999. Efficient reinforcement learning in factored MDPs. In Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI), 740-747.
9. Kearns, M. J., and Singh, S. P. 2002. Near-optimal reinforcement learning in polynomial time. Machine Learning 49(2-3):209-232.
10. Strehl, A. L.; Li, L.; and Littman, M. L. 2006. Incremental modelbased learners with formal learning-time guarantees. In UAI-06: Proceedings of the 22nd conference on Uncertainty in Artificial Intelligence, 485-493.
11. Sutton, R. S., and Barto, A. G. 1998. Reinforcement Learning: An Introduction. The MIT Press.