REGAL: A regularization based algorithm for reinforcement learning in weakly communicating MDPs

Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence, UAI 2009

Volumn , Issue , 2009, Pages 35-42

  Bartlett, Peter L ^a   Tewari, Ambuj ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MARKOV PROCESSES;

BIAS VECTORS; MARKOV DECISION PROCESSES; OPTIMAL REGRET; REGRET BOUNDS; S STATE;

REINFORCEMENT LEARNING;

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

References (13)

1. Peter Auer and Ronald Ortner. Logarithmic online regret bounds for undiscounted reinforcement learning. In Advances in Neural Information Processing Systems 19, pages 49-56. MIT Press, 2007.
2. Peter Auer, Thomas Jaksch, and Ronald Ortner. Near-optimal regret bounds for reinforcement learning. In Advances in Neural Information Processing Systems 21, 2009a.
3. Peter Auer, Thomas Jaksch, and Ronald Ortner. Near-optimal regret bounds for reinforcement learning (full version), 2009b. URL: http://institute. unileoben.ac.at/infotech/publications/ucrl2.pdf.
4. Ronen I. Brafman and Moshe Tennenholtz. R-MAX - a general polynomial time algorithm for near-optimal reinforcement learning. Journal of Machine Learning Research, 3:213-231, 2002.
5. A. N. Burnetas and M. N. Katehakis. Optimal adaptive policies for Markov decision processes. Mathematics of Operations Research, 22(1):222-255, 1997. (Pubitemid 127621321)
6. Nicolò Cesa-Bianchi and Gábor Lugosi. Prediction, Learning, and Games. Cambridge University Press, 2006.
7. Sham Kakade. On the Sample Complexity of Reinforcement Learning. PhD thesis, Gatsby Computational Neuroscience Unit, University College London, 2003.
8. Michael Kearns and Satinder Singh. Near-optimal reinforcement learning in polynomial time. Machine Learning, 49:209-232, 2002. (Pubitemid 34325687)
9. P. R. Kumar and P. P. Varaiya. Stochastic systems: Estimation, identification, and adaptive control. Prentice Hall, 1986.
10. Martin L. Puterman. Markov Decision Processes: Discrete Stochastic Dynamic Programming. John Wiley & Sons, 1994.
11. Alexander L. Strehl and Michael Littman. A theoretical analysis of model-based interval estimation. In Proceedings of the Twenty-Second International Conference on Machine Learning, pages 857-864. ACM Press, 2005. (Pubitemid 43183415)
12. Alexander L. Strehl, Lihong Li, Eric Wiewiora, John Lang-ford, and Michael L. Littman. PAC model-free reinforcement learning. In Proceedings of the Twenty-Third International Conference on Machine Learning, 2006.
13. Ambuj Tewari and Peter L. Bartlett. Optimistic linear programming gives logarithmic regret for irreducible MDPs. In Advances in Neural Information Processing Systems 20, pages 1505-1512. MIT Press, 2008.