PAC reinforcement learning bounds for RTDP and Rand-RTDP

AAAI Workshop - Technical Report

Volumn WS-06-11, Issue , 2006, Pages 50-56

  Strehl, Alexander L ^a   Li, Hong ^a   Littman, Michael L ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; DECISION MAKING; LEARNING ALGORITHMS; MARKOV PROCESSES; POLYNOMIAL APPROXIMATION; PROBABILITY DISTRIBUTIONS; REAL TIME SYSTEMS;

PROBABLY APPROXIMATELY CORRECT (PAC); REAL-TIME DYNAMIC PROGRAMMING (RTDP);

DYNAMIC PROGRAMMING;

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

References (14)

1. Barto, A. G., Bradtke, S. J., & Singh, S. P. (1995). Learning to act using real-time dynamic programming. Artificial Intelligence, 72, 81-138.
2. Bertsekas, D. P., & Tsitsiklis, J. N. (1996). Neuro-dynamic programming. Belmont, MA: Athena Scientific.
3. Bonet, B., & Geffner, H. (2003). Labeled RTDP: Improving the convergence of real-time dynamic programming. Proc. 13th International Conf. on Automated Planning and Scheduling (pp. 12-21). Trento, Italy: AAAI Press.
4. 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.
5. Kakade, S. M. (2003). On the sample complexity of reinforcement learning. Doctoral dissertation, Gatsby Computational Neuro-science Unit, University College London.
6. Kearns, M., Mansour, Y., & Ng, A. Y. (1999). A sparse sampling algorithm for near-optimal planning in large Markov decision processes. Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI-99) (pp. 1324-1331).
7. Kearns, M. J., & Singh, S. P. (2002). Near-optimal reinforcement learning in polynomial time. Machine Learning, 49, 209-232.
8. Knuth, D. (1969). The art of computer programming: Vol 2 / seminumerical algorithms, chapter 3: Random numbers. Addison-Wesley.
9. Korf, R. E. (1990). Real-time heuristic search. Artificial Intelligence, 42, 189-211.
10. McMahan, H. B., Likhachev, M., & Gordon, G. J. (2005). Bounded real-time dynamic programming: RTDP with monotone upper bounds and performance guarantees. Proceedings of the Twenty-second International Conference on Machine Learning (ICML-05) (pp. 569-576).
11. Strehl, A. L., Li, L., & Littman, M. L. (2006). Incremental model-based learners with formal learning-time guarantees. To appear in Proceedings of the Twenty-second Conference on Uncertainty in Artificial Intelligence (UAI-06).
12. Sutton, R. S., & Barto, A. G. (1998). Reinforcement learning: An introduction. The MIT Press.
13. Valiant, L. G. (1984). A theory of the learnable. Communications of the ACM, 27, 1134-1142.
14. Watkins, C. J. C. H., & Dayan, P. (1992). Q-learning. Machine Learning, 8, 279-292.