Learning representation and control in continuous Markov decision processes

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2006, Pages 1194-1199

  Mahadevan, Sridhar ^a   Maggioni, Mauro ^b   Ferguson, Kimberly ^a   Osentoski, Sarah ^a  

^a Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

^b YALE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LEARNING REPRESENTATION; LEAST-SQUARES POLICY ITERATION METHOD; MARKOV DECISION PROCESSES; PROTO-VALUE FUNCTIONS;

DECISION THEORY; EIGENVALUES AND EIGENFUNCTIONS; FUNCTIONS; LAPLACE TRANSFORMS; LEARNING SYSTEMS; MARKOV PROCESSES; PARAMETER ESTIMATION; RADIAL BASIS FUNCTION NETWORKS;

KNOWLEDGE REPRESENTATION;

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

References (16)

1. Baker, C. T. H. 1977. The numerical treatment of integral equations. Oxford: Clarendon Press.
2. Belkin, M., and Niyogi, P. 2004. Semi-supervised learning on Riemannian manifolds. Machine Learning 56:209-239.
3. Belongie, S.: Fowlkes, C.; Chung, F.; and Malik, J. 2002. Spectral partitioning with indefinite kernels using the Nystrom extension. ECCV.
4. Bertsekas, D. P., and Tsitsiklis, J. N. 1996. Neuro-Dynamic Programming. Belmont, Massachusetts: Athena Scientific.
5. Drineas, P., and Mahoney, M. W. 2005. On the Nyström method for approximating a Gram matrix for improved kernel-based learning. J. Machine Learning Research (6):2153-2175.
6. Frieze, A.; Kannan, R.; and Vempala, S. 1998. Fast Monte Carlo algorithms for finding low-rank approximations. In Proceedings of the 39th annual IEEE symposium on foundations of computer science, 370-378.
7. L. Zelnik-Manor, P. P. 2004. Self-tuning spectral clustering. In Advances in Neural Information Processing Systems 17.
8. Lafon, S. 2004. Diffusion maps and geometric harmonics. Ph.D. Dissertation, Yale University, Dept of Mathematics & Applied Mathematics.
9. Lagoudakis, M., and Parr, R. 2003. Least-squares policy iteration. Journal of Machine Learning Research 4:1107-1149.
10. Maggioni, M., and Mahadevan, S. 2006. Fast direct policy evaluation using multiscale analysis of markov diffusion processes. In International Conference on Machine Learning (ICML).
11. nd International Conference on Machine Learning.
12. Platt, J. C. 2004. Fastmap, metricmap, and landmark mds are all nyström algorithms. Technical Report MSR-TR-2004-26, Microsoft Research.
13. Puterman, M. L. 1994. Markov decision processes. New York, USA: Wiley Interscience.
14. Rosenberg, S. 1997. The Laplacian on a Riemannian Manifold. Cambridge University Press.
15. Sutton, R., and Barto, A. G. 1998. An Introduction to Reinforcement Learning. MIT Press.
16. Williams, C. K. I., and Seeger, M. 2000. Using the nyström method to speed up kernel machines. In NIPS, 682-688.