Sciweavers

GECCO
2005
Springer
111views Optimization» more  GECCO 2005»

XCS with eligibility traces

15 years 10 months ago
XCS with eligibility traces
The development of the XCS Learning Classifier System has produced a robust and stable implementation that performs competitively in direct-reward environments. Although investigations in delayed-reward (i.e. multi-step) environments have shown promise, XCS still struggles to efficiently find optimal solutions in environments with long action-chains. This paper highlights the strong relation of XCS to reinforcement learning and identifies some of the major differences. This makes it possible to add Eligibility Traces to XCS, a method taken from reinforcement learning to update the prediction of the whole action-chain on each step, which should cause prediction update to be faster and more accurate. However, it is shown that the discrete nature of the condition representation of a classifier and the operation of the genetic algorithm cause traces to propagate back incorrect prediction values and in some cases results in a decrease of system performance. As a result further investi...
Jan Drugowitsch, Alwyn Barry
Added 27 Jun 2010
Updated 27 Jun 2010
Type Conference
Year 2005
Where GECCO
Authors Jan Drugowitsch, Alwyn Barry
Comments (0)