PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Regularized Least Squares Temporal Difference learning with nested L2 and L1 penalization
Matthew Hoffman, Alessandro Lazaric, Mohammad Ghavamzadeh and Remi Munos
In: Ninth European Workshop on Reinforcement Learning (EWRL-2011), Athens, Greece(2011).

Abstract

The construction of a suitable set of features to approximate value functions is a central problem in reinforcement learning (RL). A popular approach to this problem is to use high-dimensional feature spaces together with least-squares temporal difference (LSTD). Although this combination allows for very accurate approximations, it often exhibits poor prediction performance because of overfitting when the number of samples is small compared to the number of features in the approximation space. In the linear regression setting, regularization is commonly used to overcome this problem. In this paper, we review some regularized approaches to policy evaluation and we introduce a novel scheme (L21) which uses l2 regularization in the projection operator and an l1 penalty in the fixed point step of LSTD. We show that such formulation reduces to a standard Lasso problem. As a result, any off-the-shelf solver can be used to compute its solution and standardization techniques can be applied to the data. We report experimental results showing that L21 is effective in avoiding overfitting and that it compares favorably to existing l1 regularized methods.

EPrint Type:Conference or Workshop Item (Paper)
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Learning/Statistics & Optimisation
Theory & Algorithms
COMPLACS
ID Code:9081
Deposited By:Mohammad Ghavamzadeh
Deposited On:21 February 2012