XCS with computed prediction in multistep environments

  • Authors:
  • Pier Luca Lanzi;Daniele Loiacono;Stewart W. Wilson;David E. Goldberg

  • Affiliations:
  • Artificial Intelligence and Robotics Laboratory (AIRLab), Milano, Italy and University of Illinois at Urbana Champaign, Urbana, IL;Artificial Intelligence and Robotics Laboratory (AIRLab), Milano, Italy;University of Illinois at Urbana Champaign, Urbana, IL and Prediction Dynamics, Concord, MA;University of Illinois at Urbana Champaign, Urbana, IL

  • Venue:
  • GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

XCSF extends the typical concept of learning classifier systems through the introduction of computed classifier prediction. Initial results show that XCSF's computed prediction can be used to evolve accurate piecewise linear approximations of simple functions. In this paper, we take XCSF one step further and apply it to typical reinforcement learning problems involving delayed rewards. In essence, we use XCSF as a method of generalized (linear) reinforcement learning to evolve piecewise linear approximations of the payoff surfaces of typical multistep problems. Our results show that XCSF can easily evolve optimal and near optimal solutions for problems introduced in the literature to test linear reinforcement learning methods.