Efficient PAC-optimal exploration in concurrent, continuous state MDPs with delayed updates

30th AAAI Conference on Artificial Intelligence, AAAI 2016

Volumn , Issue , 2016, Pages 1977-1985

  Pazis, Jason ^a   Parr, Ronald ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b Duke University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONTINUOUS STATE; DISCRETE STATE; EXPLORATION ALGORITHMS; FINE GRAINED; NOCV1; PAC BOUNDS; REAL-TIME ENVIRONMENT; VALUE FUNCTIONS;

ARTIFICIAL INTELLIGENCE;

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

References (15)

1. Grande, R. C.; Walsh, T. J.; and How, J. P. 2014. Sample efficient reinforcement learning with Gaussian processes. In International Conference on Machine Learning, 1332-1340.
2. Guo, Z., and Brunskill, E. 2015. Concurrent PAC RL. In AAAI Conference on Artificial Intelligence, 2624-2630.
3. Hester, T., and Stone, P. 2012. Intrinsically motivated model learning for a developing curious agent. In The Eleventh International Conference on Development and Learning.
4. Hester, T., and Stone, P. 2013. TEXPLORE: Real-Time sampleefficient reinforcement learning for robots. Machine Learning 90(3):385-429.
5. Hester, T.; Quinlan, M.; and Stone, P. 2012. RTMBA: A realtime model-based reinforcement learning architecture for robot control. In IEEE International Conference on Robotics and Automation, 85-90.
6. Jaksch, T.; Ortner, R.; and Auer, P. 2010. Near-optimal regret bounds for reinforcement learning. Journal of Machine Learning Research 11:1563-1600.
7. Kakade, S.; Kearns, M. J.; and Langford, J. 2003. Exploration in metric state spaces. In International Conference on Machine Learning, 306-312.
8. Kakade, S. M. 2003. On the sample complexity of reinforcement learning. Ph.D. Dissertation, Gatsby Computational Neuroscience Unit, University College London.
9. Lattimore, T., and Hutter, M. 2012. PAC bounds for discounted MDPs. In Proceedings of the 23th International Conference on Algorithmic Learning Theory, volume 7568 of Lecture Notes in Computer Science, 320-334. Springer Berlin/Heidelberg.
10. Mann, T. A. 2012. Scaling Up Reinforcement Learning Without Sacrificing Optimality by Constraining Exploration. Ph.D. Dissertation, Texas A & M University.
11. Moldovan, T. M., and Abbeel, P. 2012. Safe exploration in Markov decision processes. In Proceedings of the 29th International Conference on Machine Learning, 1711-1718.
12. Pazis, J., and Parr, R. 2013. PAC optimal exploration in continuous space Markov decision processes. In AAAI Conference on Artificial Intelligence, 774-781.
13. Strehl, A. L.; Li, L.; and Littman, M. L. 2009. Reinforcement learning in finite MDPs: PAC analysis. Journal of Machine Learning Research 10:2413-2444.
14. Sutton, R., and Barto, A. 1998. Reinforcement Learning: An Introduction. The MIT Press, Cambridge, Massachusetts.
15. Szita, I., and Szepesvari, C. 2010. Model-based reinforcement learning with nearly tight exploration complexity bounds. In International Conference on Machine Learning, 1031-1038.