Representation Discovery for Kernel-Based Reinforcement Learning
Name
MIT-CSAIL-TR-2015-032.pdf
Size
1.87 MB
Format
Adobe PDF
Checksum (MD5)
fb3f2bcbd484983afa15b530bcb04ced
Download all files submitted through automated deposit
Author(s)
Zewdie, Dawit H.
Konidaris, George
Advisor(s)
Leslie Kaelbling
Date Issued
November 24, 2015
Series/Report no.
MIT-CSAIL-TR-2015-032
Abstract
Recent years have seen increased interest in non-parametric reinforcement learning. There are now practical kernel-based algorithms for approximating value functions; however, kernel regression requires that the underlying function being approximated be smooth on its domain. Few problems of interest satisfy this requirement in their natural representation. In this paper we define Value-Consistent Pseudometric (VCPM), the distance function corresponding to a transformation of the domain into a space where the target function is maximally smooth and thus well-approximated by kernel regression. We then present DKBRL, an iterative batch RL algorithm interleaving steps of Kernel-Based Reinforcement Learning and distance metric adjustment. We evaluate its performance on Acrobot and PinBall, continuous-space reinforcement learning domains with discontinuous value functions.
Subjects
Metric learning
Terms of Use
Creative Commons Attribution-ShareAlike 4.0 International
Persistent DSpace Link
