Abstract-We consider the problem of on-line value function estimation in reinforcement learning. We concentrate on the function approximator to use. To try to break the curse of dimensionality, we focus on non parametric function approximators. We propose to fit the use of kernels into the temporal difference algorithms by using regression via the LASSO. We introduce the equi-gradient descent algorithm (EGD) which is a direct adaptation of the one recently introduced in the LARS algorithm family for solving the LASSO. We advocate our choice of the EGD as a judicious algorithm for these tasks. We present the EGD algorithm in details as well as some experimental results. We insist on the qualities of the EGD for reinforcement learning.
We also investigate a kernelized version of the LARS algorithm REF .
Sparse Temporal Difference Learning Using LASSO
2007 IEEE International Symposium on Approximate Dynamic Programming and Reinforcement Learning
2007 IEEE International Symposium on Approximate Dynamic Programming and Reinforcement Learning
Mathematics