.png){kind=icon}
Return
Kernel-based reinforcement learning
.png){kind=icon}
OA
AI
DOI：10.1023/A:1017928328829.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We present a kernel-based approach to reinforcement learning that overcomes the stability problems of temporal-difference learning in continuous state-spaces. First, our algorithm converges to a unique solution of an approximate Bellman's equation regardless of its initialization values. Second, the method is consistent in the sense that the resulting policy converges asymptotically to the optimal policy. Parametric value function estimates such as neural networks do not possess this property. Our kernel-based approach also allows us to show that the limiting distribution of the value function estimate is a Gaussian process. This information is useful in studying the bias-variance tradeoff in reinforcement learning. We find that all reinforcement learning approaches to estimating the value function, parametric or non-parametric, are subject to a bias. This bias is typically larger in reinforcement learning than in a comparable regression problem.
Keywords:
reinforcement learning
Markov decision process
kernel-based learning
kernel smoothing
local averaging
lazy learning
Journal
IF:
2.9
Papers:
2.7K
Citations:
3.7W
Organization
No organization information available
Cited Papers
No cited papers available