Skip navigation
Skip navigation

Sparse kernel-SARSA(lambda) with an eligibility trace

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


We introduce the first online kernelized version of SARSA(λ) to permit sparsification for arbitrary λ for 0 ≤ λ ≤ 1; this is possible via a novel kernelization of the eligibility trace that is maintained separately from the kernelized value functio

CollectionsANU Research Publications
Date published: 2011
Type: Conference paper
Source: Proceedings of Machine Learning and Knowledge Discovery in Databases - European Conference (ECML PKDD 2011)
DOI: 10.1007/978-3-642-23808-6_1


File Description SizeFormat Image
01_Robards_Sparse_kernel-SARSA(lambda)_2011.pdf454.8 kBAdobe PDF    Request a copy

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

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator