Kernelizing LSPE(λ)

Proceedings of the 2007 IEEE Symposium on Approximate Dynamic Programming and Reinforcement Learning, ADPRL 2007

Volumn , Issue , 2007, Pages 338-345

  Jung, Tobias ^a   Polani, Daniel ^b  

^a JOHANNES GUTENBERG UNIVERSITY   (Germany)

^b UNIVERSITY OF HERTFORDSHIRE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTATIONAL METHODS; LEAST SQUARES APPROXIMATIONS; PUBLIC POLICY;

BASIS FUNCTIONS; KERNEL-BASED METHODS; POLICY ITERATION;

REINFORCEMENT LEARNING;

EID: 34548765672     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ADPRL.2007.368208     Document Type: Conference Paper

References (28)

1. F. R. Bach and M. I. Jordan. Predictive low-rank decomposition for kernel methods. In Proc. of ICML 22, 2005.
2. D. Bertsekas and J. Tsitsiklis. Neuro-dynamic programming. Athena Scientific, 1996.
3. D. P. Bertsekas, V. S. Borkar, and A. Nedić. Improved temporal difference methods with linear function approximation, LIDS Tech. Report 2573, MIT, 2003, also appears in Learning and Approximate Dynamic Programming, by A. Barto, W. Powell, J. Si, (Eds.), IEEE Press, 2004.
4. D. P. Bertsekas and S. Ioffe. Temporal differences-based policy iteration and applications in neuro-dynamic programming, LIDS Tech. Report LIDS-P-2349, MIT, 1996.
5. J. A. Boyan. Least-squares temporal difference learning. In Proc. of ICML 16, 1999.
6. S. J. Bradtke and A. Barto. Linear least-squares algorithms for temporal difference learning. Machine Learning, 22:33-57, 1996.
7. L. Csató and M. Opper. Sparse representation for Gaussian process models. In Advances in NIPS 13, pages 444-450, 2001.
8. Y. Engel, S. Mannor, and R. Meir. Bayes meets Bellman: The Gaussian process approach to temporal difference learning. In Proc. of ICML 20, pages 154-161, 2003.
9. Y. Engel, S. Mannor, and R. Meir. Reinforcement learning with gaussian processes. In Proc. of ICML 22, 2005.
10. Y. Engel, P. Szabo, and D. Volkinshtein. Learning to control an octopus arm with gaussian process temporal difference methods. In Advances in NIPS 17, 2005.
11. S. Fine and K. Scheinberg. Efficient SVM training using low-rank kernel representation. JMLR, 2:243-264, 2001.
12. G. Golub and C. Van Loan. Matrix Computations (3rd Edition). John Hopkins University Press, Baltimore, 1996.
13. A. E. Hoerl and R. Kennard. Ridge regression: Biased estimation for nonorthogonal problems. Technometrics, 12(3):55-67, 1970.
14. T. Jung and D. Polani. Learning robocup-keepaway with kernels. submitted, 2006.
15. T. Jung and D. Polani. Sequential learning with ls-svm for large-scale data sets. In Proc. of ICANN 16, 2006.
16. M. G. Lagoudakis and R. Parr. Least-squares policy iteration. JMLR, 4:1107-1149, 2003.
17. Z. Luo and G. Wahba. Hybrid adaptive splines. J. Amer. Statist. Assoc., 92:107-116, 1997.
18. A. Nedić and D. P. Bertsekas. Least squares policy evaluation algorithms with linear function approximation. Discrete Event Dynamic Systems: Theory and Applications, 13:79-110, 2003.
19. T. Poggio and F. Girosi. Networks for approximation and learning. Proceedings of IEEE, 78:1481-1497, 1990.
20. C. E. Rasmussen and J. Quinonero-Candela. Healing the relevance vector machine through augmentation. In Proc. of ICML 22, 2005.
21. Carl Edward Rasmussen and Christopher K. I. Williams. Gaussian Processes for Machine Learning. MIT Press, 2006.
22. A. Sayed. Fundamentals of Adaptive Filtering. Wiley Interscience, 2003.
23. B. Schölkopf and A. Smola. Learning with Kernels. Cambridge, MA: MIT Press, 2002.
24. A. J. Smola and P. L. Bartlett. Sparse greedy Gaussian process regression. In Advances in NIPS 13, pages 619-625, 2001.
25. A. J. Smola and B. Schölkopf. Sparse greedy matrix approximation for machine learning. In Proc of ICML 17, pages 911-918, 2000.
26. R. Sutton and A. Barto. Reinforcement Learning: An Introduction. MIT Press, 1998.
27. R. S. Sutton. Learning to predict by the methods of temporal differences. Machine Learning, 3:9-44, 1988.
28. C. Williams and M. Seeger. Using the Nyström method to speed up kernel machines. In Advances in NIPS 13, pages 682-688, 2001.