Fitted Q-iteration in continuous action-space MDPs

Advances in Neural Information Processing Systems 20 - Proceedings of the 2007 Conference

Volumn , Issue , 2008, Pages

  Antos, András ^a   Munos, Rémi ^b   Szepesvári, Csaba ^a,c  

^a INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

^b INRIA   (France)

^c UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

REINFORCEMENT LEARNING;

ACTION SELECTION; ACTION SPACES; BATCH REINFORCEMENT LEARNING; CONTINUOUS ACTIONS; CONTINUOUS STATE; FINITE-TIME; GREEDY ACTION; LEARN+; RIGOROUS ANALYSIS; TIME BOUND;

ITERATIVE METHODS;

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

References (16)

1. A. Antos, Cs. Szepesvári, and R. Munos. Learning near-optimal policies with Bellman-residual minimization based fitted policy iteration and a single sample path. In COLT-19, pages 574-588, 2006. (Pubitemid 44072220)
2. A. Antos, Cs. Szepesvári, and R. Munos. Learning near-optimal policies with Bellman-residual minimization based fitted policy iteration and a single sample path. Machine Learning, 2007. (accepted).
3. A. Antos, Cs. Szepesvári, and R. Munos. Value-iteration based fitted policy iteration: learning with a single trajectory. In IEEE ADPRL, pages 330-337, 2007. (Pubitemid 47431404)
4. D. P. Bertsekas and S.E. Shreve. Stochastic Optimal Control (The Discrete Time Case). Academic Press, New York, 1978.
5. D. Ernst, P. Geurts, and L.Wehenkel. Tree-based batch mode reinforcement learning. Journal of Machine Learning Research, 6:503-556, 2005.
6. R.S. Sutton and A.G. Barto. Reinforcement Learning: An Introduction. Bradford Book. MIT Press, 1998.
7. N. Cristianini and J. Shawe-Taylor. An introduction to support vector machines (and other kernel-based learning methods). Cambridge University Press, 2000.
8. J.A. Boyan and A.W. Moore. Generalization in reinforcement learning: Safely approximating the value function. In NIPS-7, pages 369-376, 1995.
9. P.L. Bartlett, P.M. Long, and R.C.Williamson. Fat-shattering and the learnability of real-valued functions. Journal of Computer and System Sciences, 52:434-452, 1996. (Pubitemid 126359770)
10. A.N. Kolmogorov and V.M. Tihomirov. ε-entropy and ε-capacity of sets in functional space. American Mathematical Society Translations, 17(2):277-364, 1961.
11. R. Munos and Cs. Szepesvári. Finite time bounds for sampling based fitted value iteration. Technical report, Computer and Automation Research Institute of the Hungarian Academy of Sciences, Kende u. 13-17, Budapest 1111, Hungary, 2006.
12. A.Y. Ng and M. Jordan. PEGASUS: A policy search method for large MDPs and POMDPs. In Proceedings of the 16th Conference in Uncertainty in Artificial Intelligence, pages 406-415, 2000.
13. P.L. Bartlett and A. Tewari. Sample complexity of policy search with known dynamics. In NIPS-19. MIT Press, 2007.
14. M. Anthony and P. L. Bartlett. Neural Network Learning: Theoretical Foundations. Cambridge University Press, 1999.
15. M. Riedmiller. Neural fitted Q iteration - first experiences with a data efficient neural reinforcement learning method. In 16th European Conference on Machine Learning, pages 317-328, 2005.
16. S. Kalyanakrishnan and P. Stone. Batch reinforcement learning in a complex domain. In AAMAS-07, 2007.