Skip navigation
Skip navigation

Sparse Kernel-SARSA(A) with an Eligibility Trace

Robards, Matthew; Sunehag, Peter; Sanner, Scott; Marthi, Bhaskara

Description

We introduce the first online kernelized version of SARSA(?) to permit sparsifi- cation for arbitrary ? for 0 = ? = 1; this is possible via a novel kernelization of the eligibility trace that is maintained separately from the kernelized value function. This separation is crucial for preserving the functional structure of the eligibility trace when using sparse kernel projection techniques that are essential for memory efficiency and capacity control. The result is a simple and practical...[Show more]

CollectionsANU Research Publications
Date published: 2011
Type: Conference paper
URI: http://hdl.handle.net/1885/39164
Source: Proceedings of Machine Learning and Knowledge Discovery in Databases - European Conference (ECML PKDD 2011)

Download

File Description SizeFormat Image
01_Robards_Sparse_Kernel-SARSA(A)_with_an_2011.pdf544.1 kBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator