Near-Bayesian exploration in polynomial time

Proceedings of the 26th International Conference On Machine Learning, ICML 2009

Volumn , Issue , 2009, Pages 513-520

  Kolter, J Zico ^a   Ng, Andrew Y ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BAYESIAN; BAYESIAN APPROACHES; BAYESIAN SOLUTION; EXPLORATION STRATEGIES; HIGH PROBABILITY; MODEL-BASED; POLYNOMIAL-TIME; SAMPLE COMPLEXITY BOUNDS; SIMPLE ALGORITHM; TIME STEP;

ALGORITHMS; POLYNOMIAL APPROXIMATION; REINFORCEMENT; ROBOT LEARNING;

BAYESIAN NETWORKS;

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

References (24)

1. Asmuth, J., Li, L., Littman, M. L., Nouri, A., & Wingate, D. (2009). A Bayesian sampling approach to exploration in reinforcement learning. (Preprint).
2. Auer, P., & Ortner, R. (2007). Logarithmic online regret bounds for undiscounted reinforcement learning. Neural Information Processing Systems (pp. 49-56).
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. Brunskill, E., Leffler, B. R., Li, L., Littman, M. L., & Roy, N. (2008). CORL: A continuous-state offset-dynamics reinforcement learner. Proceedings of the International Conference on Uncertainty in Artificial Intelligence (pp. 53-61).
5. Dearden, R., Friedman, N., & Andre, D. (1999). Model based Bayesian exploration. Proceedings of the International Conference on Uncertainty in Artificial Intelligence (pp. 150-159).
6. Fel'dbaum, A. A. (1961). Dual control theory, parts I-IV. Automation and Remote Control, 21 874-880,
7. 21 1033-1039,
8. 22 1-12,
9. 22 109-121.
10. Filatov, N., & Unbehauen, H. (2004). Adaptive dual control: Theory and applications. Springer.
11. Gittins, J. C. (1989). Multiarmed bandit allocation indices. Wiley.
12. Kakade, S., Kearns, M., & Langford, J. (2003). Exploration in metric state spaces. Proceedings of the International Conference on Machine Learning (pp. 306-312).
13. Kakade, S. M. (2003). On the sample complexity of reinforcement learning. Doctoral dissertation, Gatsby Computational Neuroscience Unit, University College, London.
14. Kearns, M., & Koller, D. (1999). Efficient reinforcement learning in factored MDPs. Proceedings of the International Joint Conference on Artificial Intelligence (pp. 740-747).
15. Kearns, M., & Singh, S. (2002). Near-optimal reinforcement learning in polynomial time. Machine Learning, 49, 209-232.
16. Kolter, J. Z., & Ng, A. Y. (2009). Near-Bayesian exploration in polynomial time (full version). Available at http://ai.stanford.edu/ ~kolter.
17. Poupart, P., Vlassis, N., Hoey, J., & Regan, K. (2006). An analytic solution to discrete Bayesian reinforcement learning. Proceedings of the International Conference on Machine Learning (pp. 697-704).
18. Putterman, M. L. (2005). Markov decision processes: Discrete stochastic dynamic programming. Wiley.
19. Slud, E. V. (1977). Distribution inequalities for the binomial law. The Annals of Probability, 5, 404-412.
20. Strehl, A. L., Li, L., Wiewiora, E., Langford, J., & Littman, M. L. (2006). Pac model-free reinforcement learning. Proceedings of the International Conference on Machine Learning (pp. 881-888).
21. Strehl, A. L., & Littman, M. L. (2008a). An analysis of model-based interval estimation for markov decision processes. Journal of Computer and System Sciences, 74, 1209-1331.
22. Strehl, A. L., & Littman, M. L. (2008b). Online linear regression and its application to model-based reinforcement learning. Neural Information Processing Systems (pp. 1417-1424).
23. Strens, M. J. (2000). A Bayesian framework for reinforcement learning. Proceedings of the International Conference on Machine Learning (pp. 943-950).
24. Wang, T., Lizotte, D., Bowling, M., & Schuurmans, D. (2005). Bayesian sparse sampling for on-line reward optimization. Proceedings of the International Conference on Machine Learning (pp. 956-963).