Classifier prediction based on tile coding

This paper introduces XCSF extended with tile coding prediction: each classifier implements a tile coding approximator; the genetic algorithm is used to adapt both classifier conditions (i.e., to partition the problem) and the parameters of each approximator; thus XCSF evolves an ensemble of tile coding approximators instead of the typical monolithic approximator used in reinforcement learning. The paper reports a comparison between (i) XCSF with tile coding prediction and (ii) plain tile coding. The results show that XCSF with tile coding always reaches optimal performance, it usually learns as fast as the best parametrized tile coding, and it can be faster than the typical tile coding setting. In addition, the analysis of the evolved tile coding ensembles shows that XCSF actually adapts local approximators following what is currently considered the best strategy to adapt the tile coding parameters in a given problem. Categories and Subject Descriptors

• Type: Conference
• Year: 2006
• Where: GECCO
• Authors: Pier Luca Lanzi, Daniele Loiacono, Stewart W. Wilson, David E. Goldberg
• Keywords: GECCO 2006, Optimization, Tile Coding, Tile Coding Approximators, Tile Coding Prediction