Compact Spectral Bases for Value Function Approximation Using Kronecker Factorization
暂无分享,去创建一个
[1] Richard Bellman,et al. Introduction to Matrix Analysis , 1972 .
[2] John N. Tsitsiklis,et al. Neuro-Dynamic Programming , 1996, Encyclopedia of Machine Learning.
[3] N. Pitsianis. The Kronecker Product in Approximation and Fast Transform Geration , 1997 .
[4] Richard Bellman,et al. Introduction to matrix analysis (2nd ed.) , 1997 .
[5] Andrew G. Barto,et al. Reinforcement learning , 1998 .
[6] Richard S. Sutton,et al. Introduction to Reinforcement Learning , 1998 .
[7] Vipin Kumar,et al. A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..
[8] P. Diaconis,et al. A geometric interpretation of the Metropolis-Hastings algorithm , 2001 .
[9] V. Kostrykin,et al. ON A SUBSPACE PERTURBATION PROBLEM , 2002, math/0203240.
[10] Michail G. Lagoudakis,et al. Least-Squares Policy Iteration , 2003, J. Mach. Learn. Res..
[11] Petros Drineas,et al. On the Nyström Method for Approximating a Gram Matrix for Improved Kernel-Based Learning , 2005, J. Mach. Learn. Res..
[12] Sridhar Mahadevan,et al. Representation Policy Iteration , 2005, UAI.
[13] Sridhar Mahadevan,et al. Learning Representation and Control in Continuous Markov Decision Processes , 2006, AAAI.
[14] Marek Petrik,et al. An Analysis of Laplacian Methods for Value Function Approximation in MDPs , 2007, IJCAI.