Online linear regression and its application to model-based reinforcement learning

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

Volumn , Issue , 2008, Pages

  Strehl, Alexander L ^a   Littman, Michael L ^b  

^a YAHOO RESEARCH   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

E-LEARNING; LEARNING ALGORITHMS; REINFORCEMENT LEARNING;

ACTION SPACES; CONTINUOUS ACTIONS; CONTINUOUS STATE SPACE; ITS APPLICATIONS; MARKOV DECISION PROCESSES; MODEL BASED APPROACH; MODEL-BASED REINFORCEMENT LEARNING; ON-LINE SETTING; ONLINE LINEAR REGRESSION; REGRESSION APPLICATIONS;

MARKOV PROCESSES;

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

References (14)

1. Abbeel, P., & Ng, A. Y. (2005). Exploration and apprenticeship learning in reinforcement learning. ICML '05: Proceedings of the 22nd international conference on Machine learning (pp. 1-8). New York, NY, USA: ACM Press. (Pubitemid 43183309)
2. Auer, P. (2002). Using confidence bounds for exploitation-exploration trade-offs. Journal of Machine Learning Research, 3, 397-422.
3. Brafman, R. I., & Tennenholtz, M. (2002). R-MAX-a general polynomial time algorithm for near-optimal reinforcement learning. Journal of Machine Learning Research, 3, 213-231.
4. Chow, C.-S., & Tsitsiklis, J. N. (1991). An optimal one-way multigrid algorithmfor discrete time stochastic control. IEEE Transactions on Automatic Control, 36, 898-914.
5. Fiechter, C.-N. (1997). PAC adaptive control of linear systems. Tenth Annual Conference on Computational Learning Theory (COLT) (pp. 72-80).
6. Golub, G. H., & Van Loan, C. F. (1996). Matrix computations. Baltimore, Maryland: The Johns Hopkins University Press. 3rd edition.
7. Kakade, S. M. (2003). On the sample complexity of reinforcement learning. Doctoral dissertation, Gatsby Computational Neuroscience Unit, University College London.
8. Kakade, S. M. K., Kearns, M. J., & Langford, J. C. (2003). Exploration in metric state spaces. Proceedings of the 20th International Conference on Machine Learning (ICML-03).
9. Kearns, M., Mansour, Y., & Ng, A. 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-99) (pp. 1324-1331).
10. Kearns, M. J., & Singh, S. P. (2002). Near-optimal reinforcement learning in polynomial time. Machine Learning, 49, 209-232.
11. Ng, A. Y., Kim, H. J., Jordan, M. I., & Sastry, S. (2003). Autonomous helicopter flight via reinforcement learning. Advances in Neural Information Processing Systems 16 (NIPS-03).
12. Seber, G. A. F., & Lee, A. J. (2003). Linear regression analysis. Wiley-Interscience.
13. Sutton, R. S., & Barto, A. G. (1998). Reinforcement learning: An introduction. The MIT Press.
14. Tesauro, G. (1994). TD-Gammon, a self-teaching backgammon program, achieves master-level play. Neural Computation, 6, 215-219.