Reinforcement Learning as Classification: Leveraging Modern Classifiers

Proceedings, Twentieth International Conference on Machine Learning

Volumn 1, Issue , 2003, Pages 424-431

  Lagoudakis, Michail G ^a   Parr, Ronald ^a  

^a Duke University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CLASSIFICATION (OF INFORMATION); CRYSTAL ORIENTATION; FEATURE EXTRACTION; MARKOV PROCESSES; MONTE CARLO METHODS; NEURAL NETWORKS; PARAMETER ESTIMATION;

FEATURE ENGINEERING; KERNEL TRICK;

LEARNING SYSTEMS;

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

References (18)

1. Bertsekas, D., & Tsitsiklis, J. (1996). Neuro-dynamic programming. Belmont, Massachusetts: Athena Scientific.
2. Collobert, R., & Bengio, S. (2001). SVMTorch: Support vector machines for large-scale regression problems. Journal of Machine Learning Research (JMLR), 1, 143-160.
3. Dietterich, T. G., & Wang, X. (2001). Batch value funtion approximation via support vectors. Advances in Neural Information Processing Systems 14: Proceedings of the 2001 Conference. Vancouver, British Columbia: MIT Press.
4. Fern, A., Yoon, S., & Givan, R. (2003). Approximate policy iteration with a policy language bias: Learning control knowledge in planning domainsTechnical report TR-ECE-03-11). Purdue University School of Electrical and Computer Engineering.
5. Guestrin, C. E., Koller, D., & Parr, R. (2001). Max-norm projections for factored MDPs. Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI-01) (pp. 673 - 680). Seattle, Washington: Morgan Kaufmann.
6. Jaakkola, T., Jordan, M., & Singh, S. (1994). On the convergence of stochastic iterative dynamic programming algorithms. Neural Computation, 6, 1185-1201.
7. Jaakkola, T., Singh, S. P., & Jordan, M. I. (1995). Reinforcement learning algorithm for partially observable Markov decision problems. Advances in Neural Information Processing Systems 7 (pp. 345-352). Cambridge, Massachusetts: MIT Press.
8. Kaelbling, L. P. (1993). Learning in embedded systems. Cambridge, Massachusetts: MIT Press.
9. Kakade, S., & Langford, J. (2002). Approximately optimal approximate reinforcement learning. The Nineteenth International Conference on Machine Learning (ICML-2002). Sydney, Australia.
10. Kearns, M., Mansour, Y., & Ng, A. Y. (1999). A sparse sampling algorithm for near-optimal planning large markov decision processes. Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI-99) (pp. 1324-1331). Stockholm, Sweden: Morgan Kaufmann.
11. Lagoudakis, M., & Parr, R. (2001). Model free least squares policy iteration. To appear in 14th Neural Information Processing Systems (NIPS-14). Vancouver, Canada.
12. Ng, A. Y., Harada, D., & Russell, S. (1999). Policy invariance under reward transformations: theory and application to reward shaping. Proc. 16th International Conf. on Machine Learning (pp. 278-287). Morgan Kaufmann, San Francisco, CA.
13. Randløv, J., & Alstrøm, P. (1998). Learning to drive a bicycle using reinforcement learning and shaping. The Fifteenth International Conference on Machine Learning. Madison, Wisconsin: Morgan Kaufmann.
14. Sutton, R., & Barto, A. (1998). Reinforcement learning: An introduction. Cambridge, MA: MIT Press.
15. Tesauro, G., & Tesauro, G. (1997). On-line policy improvement using monte-carlo search. 9th Neural Information Processing Systems (NIPS-9). Denver, Colorado.
16. Wang, H. Tanaka, K., & Griffin, M. (1996). An approach to fuzzy control of nonlinear systems: Stability and design issues. IEEE Transactions on Fuzzy Systems, 4, 14-23.
17. Williams, R. J. (1992). Simple statistical gradient-following algorithms for connectionist reinforcement learning. Machine Learning, 8, 229-256.
18. Yoon, S. W., Fern, A., & Givan, B. (2002). Inductive policy selection for first-order MDPs. Proceedings of the Eighteenth Conference on Uncertainty in Artificial Intelligence (UAI-02). Edmonton, Canada: Morgan Kaufmann.