Relating reinforcement learning performance to classification performance

ICML 2005 - Proceedings of the 22nd International Conference on Machine Learning

Volumn , Issue , 2005, Pages 473-480

  Langford, John ^a   Zadrozny, Bianca ^b  

^a TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY SEQUENCES; PROBLEM SOLVING; PUBLIC POLICY;

CLASSIFICATION PERFORMANCE; CLASSIFIER LEARNING ALGORITHM; QUANTITATIVE CONNECTION;

LEARNING SYSTEMS;

EID: 31844448029     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1102351.1102411     Document Type: Conference Paper

References (20)

1. Bagnell, D. (2004). Personal communication.
2. Bagnell, D., Kakade, S., Ng, A., & Schneider, J. (2004). Policy search by dynamic programming. Advances in Neural Information Processing Systems 16 (NIPS*2003).
3. Baird, L. C. (1993). Advantage updating (Technical Report). Wright Laboratory.
4. Bertsekas, D. P., & Tsitsiklis, J. N. (1996). Neurodynamic programming. Athena Scientific.
5. Beygelzimer, A., Dani, V., Hayes, T., Langford, J., & Zadrozny, B. (2004). Reductions between classification tasks. Preprint at http://hunch.net/~jl/projects/reductions/ mc_to_c/mc_submission.ps.
6. Evan-Dar, E., Kakade, S., & Mansour, Y. (2005). Reinforcement learning in POMDPs without resets. Preprint at http://www.cis.upenn.edu/ ~skakade/papers/rl/learn_pomdp.ps.
7. Fern, A., Yoon, S., & Givan, R. (2004). Approximate policy iteration with a policy language bias. Advances in Neural Information Processing Systems 16 (NIPS*2003).
8. Kakade, S., & Langford, J. (2002). Approximately optimal approximate reinforcement learning. Proceedings of the Nineteenth International Conference on Machine Learning (ICML-2002) (pp. 267-274).
9. Kearns, M., Ng, A., & Mansour, Y. (1999). A sparse sampling algorithm for near-optimal planning in large markov decision processes. Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI-1999) (pp. 1324-1331).
10. Kearns, M., Ng, A., & Mansour, Y. (2000). Approximate planning in large pomdps via reusable trajectories. Advances in Neural Information Processing Systems 12 (NIPS*1999).
11. Kearns, M., & Singh, S. (1998). Near optimal reinforcement learning in polynomial time. Proceedings of the Fifteenth International Conference on Machine Learning (ICML-1998) (pp. 260-268).
12. Khardon, R. (1999). Learning to take actions. Machine Learning, 35, 57-90.
13. Lagoudakis, M., & Parr, R. (2003). Reinforcement learning as classification: Leveraging modern classifiers. Proceedings of the Twentieth International Conference on Machine Learning (ICML-2003) (pp. 424-431).
14. Langford, J., & Beygelzimer, A. (2005). Sensitive error correcting output codes. Proceedings of the Eighteenth Annual Conference on Learning Theory (COLT-2005). To appear.
15. Langford, J., & Zadrozny, B. (2003). Reducing T-step reinforcement learning to classification. Preprint at http://hunch.net/~jl/projects/ reductions/ RL_to_class/colt_submission.ps%.
16. Langford, J., & Zadrozny, B. (2005). Estimating class membership probabilities using classifier learners. Proceedings of the Tenth International Workshop on AI and Statistics (AISTATS-2005) (pp. 198-205).
17. Singh, S., James, M. R., & Rudary, M. R. (2004). Predictive state representations: A new theory for modeling dynamical systems. Proceedings of the Twentieth Annual Conference on Uncertainty in Artificial Intelligence (UAI-2004) (pp. 512-519).
18. Sutton, R. S., &: Barto, A. G. (1998). Reinforcement learning: An introduction. MIT Press.
19. Watkins, C. (1989). Learning from delayed rewards. Doctoral dissertation. Cambridge University.
20. Zadrozny, B., Langford, J., & Abe, N. (2003). Costsensitive classification by cost-proportionate example weighting. Proceedings of the International Conference on Data Mining (ICDM-2003) (pp. 435-442).