<html><head><meta name="color-scheme" content="light dark"></head><body><pre style="word-wrap: break-word; white-space: pre-wrap;">\begin{thebibliography}{}

\bibitem[Bagnell, 2004][Bagnell][2004]{Drewp}
Bagnell, D. (2004).
\newblock Personal communication.

\bibitem[Bagnell et~al.\/, 2004][Bagnell et~al.\/][2004]{PSDP}
Bagnell, D., Kakade, S., Ng, A., \&amp; Schneider, J. (2004).
\newblock Policy search by dynamic programming.
\newblock {\em Advances in Neural Information Processing Systems 16
  (NIPS*2003)}.

\bibitem[Baird, 1993][Baird][1993]{baird}
Baird, L.~C. (1993).
\newblock {\em Advantage updating} (Technical Report).
\newblock Wright Laboratory.

\bibitem[Bertsekas \&amp; Tsitsiklis, 1996][Bertsekas and Tsitsiklis][1996]{api}
Bertsekas, D.~P., \&amp; Tsitsiklis, J.~N. (1996).
\newblock {\em Neurodynamic programming}.
\newblock Athena Scientific.

\bibitem[Beygelzimer et~al.\/, 2004][Beygelzimer et~al.\/][2004]{wap}
Beygelzimer, A., Dani, V., Hayes, T., Langford, J., \&amp; Zadrozny, B. (2004).
\newblock Reductions between classification tasks.
\newblock Preprint at
  \url{http://hunch.net/~jl/projects/reductions/mc_to_c/mc_submission.ps}.

\bibitem[Evan-Dar et~al.\/, 2005][Evan-Dar et~al.\/][2005]{sham05}
Evan-Dar, E., Kakade, S., \&amp; Mansour, Y. (2005).
\newblock Reinforcement learning in {POMDPs} without resets.
\newblock Preprint at
  \url{http://www.cis.upenn.edu/~skakade/papers/rl/learn_pomdp.ps}.

\bibitem[Fern et~al.\/, 2004][Fern et~al.\/][2004]{FYG}
Fern, A., Yoon, S., \&amp; Givan, R. (2004).
\newblock Approximate policy iteration with a policy language bias.
\newblock {\em Advances in Neural Information Processing Systems 16
  (NIPS*2003)}.

\bibitem[Kakade \&amp; Langford, 2002][Kakade and Langford][2002]{AOARL}
Kakade, S., \&amp; Langford, J. (2002).
\newblock Approximately optimal approximate reinforcement learning.
\newblock {\em Proceedings of the Nineteenth International Conference on
  Machine Learning (ICML-2002)} (pp.\/ 267--274).

\bibitem[Kearns et~al.\/, 1999][Kearns et~al.\/][1999]{KNM2}
Kearns, M., Ng, A., \&amp; Mansour, Y. (1999).
\newblock A sparse sampling algorithm for near-optimal planning in large markov
  decision processes.
\newblock {\em Proceedings of the Sixteenth International Joint Conference on
  Artificial Intelligence (IJCAI-1999)} (pp.\/ 1324--1331).

\bibitem[Kearns et~al.\/, 2000][Kearns et~al.\/][2000]{KNM}
Kearns, M., Ng, A., \&amp; Mansour, Y. (2000).
\newblock Approximate planning in large pomdps via reusable trajectories.
\newblock {\em Advances in Neural Information Processing Systems 12
  (NIPS*1999)}.

\bibitem[Kearns \&amp; Singh, 1998][Kearns and Singh][1998]{E3}
Kearns, M., \&amp; Singh, S. (1998).
\newblock Near optimal reinforcement learning in polynomial time.
\newblock {\em Proceedings of the Fifteenth International Conference on Machine
  Learning (ICML-1998)} (pp.\/ 260--268).

\bibitem[Khardon, 1999][Khardon][1999]{K}
Khardon, R. (1999).
\newblock Learning to take actions.
\newblock {\em Machine Learning}, {\em 35}, 57--90.

\bibitem[Lagoudakis \&amp; Parr, 2003][Lagoudakis and Parr][2003]{LP}
Lagoudakis, M., \&amp; Parr, R. (2003).
\newblock Reinforcement learning as classification: Leveraging modern
  classifiers.
\newblock {\em Proceedings of the Twentieth International Conference on Machine
  Learning (ICML-2003)} (pp.\/ 424--431).

\bibitem[Langford \&amp; Beygelzimer, 2005][Langford and Beygelzimer][2005]{SECOC}
Langford, J., \&amp; Beygelzimer, A. (2005).
\newblock Sensitive error correcting output codes.
\newblock {\em Proceedings of the Eighteenth Annual Conference on Learning
  Theory (COLT-2005)}.
\newblock To appear.

\bibitem[Langford \&amp; Zadrozny, 2003][Langford and Zadrozny][2003]{rlgen}
Langford, J., \&amp; Zadrozny, B. (2003).
\newblock Reducing {T}-step reinforcement learning to classification.
\newblock Preprint at
  \url{http://hunch.net/~jl/projects/reductions/RL_to_class/colt_submission.ps%
}.

\bibitem[Langford \&amp; Zadrozny, 2005][Langford and Zadrozny][2005]{probing}
Langford, J., \&amp; Zadrozny, B. (2005).
\newblock Estimating class membership probabilities using classifier learners.
\newblock {\em Proceedings of the Tenth International Workshop on AI and
  Statistics (AISTATS-2005)} (pp.\/ 198--205).

\bibitem[Singh et~al.\/, 2004][Singh et~al.\/][2004]{PSR}
Singh, S., James, M.~R., \&amp; Rudary, M.~R. (2004).
\newblock Predictive state representations: A new theory for modeling dynamical
  systems.
\newblock {\em Proceedings of the Twentieth Annual Conference on Uncertainty in
  Artificial Intelligence (UAI-2004)} (pp.\/ 512--519).

\bibitem[Sutton \&amp; Barto, 1998][Sutton and Barto][1998]{SB}
Sutton, R.~S., \&amp; Barto, A.~G. (1998).
\newblock {\em Reinforcement learning: An introduction}.
\newblock MIT Press.

\bibitem[Watkins, 1989][Watkins][1989]{Q}
Watkins, C. (1989).
\newblock {\em Learning from delayed rewards}.
\newblock Doctoral dissertation, Cambridge University.

\bibitem[Zadrozny et~al.\/, 2003][Zadrozny et~al.\/][2003]{ZLA}
Zadrozny, B., Langford, J., \&amp; Abe, N. (2003).
\newblock Cost-sensitive classification by cost-proportionate example
  weighting.
\newblock {\em Proceedings of the International Conference on Data Mining
  (ICDM-2003)} (pp.\/ 435--442).

\end{thebibliography}
</pre></body></html>