Sample Complexity and Performance Bounds for Non-Parametric Approximate Linear Programming
暂无分享,去创建一个
[1] Branislav Kveton,et al. Kernel-Based Reinforcement Learning on Representative States , 2012, AAAI.
[2] Pierre Geurts,et al. Tree-Based Batch Mode Reinforcement Learning , 2005, J. Mach. Learn. Res..
[3] Jason Pazis,et al. PAC Optimal Exploration in Continuous Space Markov Decision Processes , 2013, AAAI.
[4] Jason Pazis,et al. Generalized Value Functions for Large Action Sets , 2011, ICML.
[5] Andrew W. Moore,et al. Variable Resolution Discretization in Optimal Control , 2002, Machine Learning.
[6] Jason Pazis,et al. Non-Parametric Approximate Linear Programming for MDPs , 2011, AAAI.
[7] Marek Petrik,et al. Feature Selection Using Regularization in Approximate Linear Programs for Markov Decision Processes , 2010, ICML.
[8] Shie Mannor,et al. Regularized Policy Iteration , 2008, NIPS.
[9] Kazuo Tanaka,et al. An approach to fuzzy control of nonlinear systems: stability and design issues , 1996, IEEE Trans. Fuzzy Syst..
[10] Oliver Kroemer,et al. A Non-Parametric Approach to Dynamic Programming , 2011, NIPS.
[11] Gavin Taylor,et al. Kernelized value function approximation for reinforcement learning , 2009, ICML '09.