Sign inSign up
Sparse Kernel-SARSA(λ) with an Eligibility Trace thumbnail
Pause
Mute
Subtitles
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

Sparse Kernel-SARSA(λ) with an Eligibility Trace

Published on Nov 30, 20112955 Views

Matthew Robards

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 maintai

Sessions

Related categories

Kernel Methods

Chapter list

SARSA (λ) In RKHS00:00
Motivation00:00
Kernel Reinforcement Learning00:48
Markov Decision Processes01:36
SARSA(λ) - 102:11
SARSA(λ) - 203:13
SARSA(λ) - 303:41
RKHS-SARSA(λ)03:51
Controlling The Memory! - 104:29
Controlling The Memory! - 205:08
Projectron RKHS-SARSA(λ)05:57
Dealing With the Eligibility Trace - 106:35
Dealing With the Eligibility Trace - 207:13
Projectron RKHS-SARSA(λ) Updates08:09
Mountain Car - 108:21
Mountain Car - 209:38
Cart Pole - 109:53
Cart Pole - 210:48
Memory Efficiency10:57
Algorithm In Summary11:08
Questions11:35