Compact spectral bases for value function approximation using Kronecker factorization

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2007, Pages 559-564

  Johns, Jeff ^a   Mahadevan, Sridhar ^a   Chang, Wang ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

DIFFUSION OPERATORS; KRONECKER FACTORIZATION; SPECTRAL GAPS; VALUE FUNCTION APPROXIMATION;

APPROXIMATION THEORY; GRAPH THEORY; LAPLACE EQUATION; MARKOV PROCESSES; MATHEMATICAL OPERATORS; MATRIX ALGEBRA;

FUNCTIONAL ANALYSIS;

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

References (14)

1. Bellman, R. 1970. Introduction to Matrix Analysis. New York, NY: McGraw-Hill Education, 2nd edition.
2. Bertsekas, D., and Tsitsiklis, J. 1996. Neuro-Dynamic Programming. Belmont, MA: Athena Scientific.
3. Billera, L., and Diaconis, P. 2001, A geometric interpretation of the Metropolis-Hasting algorithm. Statist. Science 16:335-339.
4. Chung, F. 1997. Spectral Graph Theory. Number 92 in CBMS Regional Conference Series in Mathematics. Providence, RI: American Mathematical Society.
5. Drineas, P., and Mahoney, M. 2005. On the Nyström method for approximating a Gram matrix for improved kernel-based learning. Journal of Machine Learning Research 6:2153-2175.
6. Golub, G., and Van Loan, C. 1996. Matrix Computations. Baltimore, MD: Johns Hopkins University Press, 3rd edition.
7. Karypis, G., and Kumar, V. 1999. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing 20(1):359-392.
8. Kostrykin, V.; Makarov, K. A.; and Motovilov, A. K. 2003. On a subspace perturbation problem. In Proc. of the American Mathematical Society, volume 131, 1038-1044.
9. Lagoudakis, M., and Parr, R. 2003. Least-Squares Policy Iteration. Journal of Machine Learning Research 4:1107-1149.
10. Mahadevan, S.; Maggioni, M.; Ferguson, K.; and Osentoski, S. 2006. Learning representation and control in continuous Markov decision processes, In Proc. of the 21st National Conference on Artificial Intelligence. Menlo Park, CA: AAAI Press.
11. Mahadevan, S. 2005, Representation Policy Iteration. In Proceedings of the 21st Conference on Uncertainty in Artificial Intelligence, 372-379. Arlington, VA: AUAI Press.
12. Petrik, M. 2007. An analysis of Laplacian methods for value function approximation in MDPs. In Proc. of the 20th International Joint Conference on Artificial Intelligence, 2574-2579.
13. Pitsianis, N. 1997. The Kronecker Product in Approximation and Fast Transform Generation. Ph.D. Dissertation, Department of Computer Science, Cornell University, Ithaca, NY
14. Sutton, R., and Barto, A. 1998. Reinforcement Learning. Cambridge, MA: MIT Press.