Function Approximation With XCS: Hyperellipsoidal Conditions, Recursive Least Squares, and Compaction
Authors:
- Pier Luca LanziPLPier Luca Lanzi
- Stewart W. WilsonSWStewart W. Wilson
- 28 May 2008
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Evolutionary Computation
- Vol. 12 (3) , 355-376
Abstract
An important strength of learning classifier systems (LCSs) lies in the combination of genetic optimization techniques with gradient-based approximation techniques. The chosen approximation technique develops locally optimal approximations, such as accurate classification estimates, Q-value predictions, or linear function approximations. The genetic optimization technique is designed to distribute these local approximations efficiently over the problem space. Together, the two components develop a distributed, locally optimized problem solution in the form of a population of expert rules, often called classifiers. In function approximation problems, the XCSF classifier system develops a problem solution in the form of overlapping, piecewise linear approximations. This paper shows that XCSF performance on function approximation problems additively benefits from: 1) improved representations; 2) improved genetic operators; and 3) improved approximation techniques. Additionally, this paper introduces a novel closest classifier matching mechanism for the efficient compaction of XCS's final problem solution. The resulting compaction mechanism can boil the population size down by 90% on average, while decreasing prediction accuracy only marginally. Performance evaluations show that the additional mechanisms enable XCSF to reliably, accurately, and compactly approximate even seven dimensional functions. Performance comparisons with other, heuristic function approximation techniques show that XCSF yields competitive or even superior noise-robust performance.Keywords
This publication has 29 references indexed in Scilit:
- Classifier prediction based on tile coding2006
- An Analysis of Continuous-Valued Representations for Learning Classifier Systems2005
- Computational Complexity of the XCS Classifier System2005
- Extending XCSF beyond linear approximation2005
- A Preliminary Investigation of Modified XCS as a Generic Data Mining ToolLecture Notes in Computer Science, 2002
- How neutral networks influence evolvabilityComplexity, 2001
- Get Real! XCS with Continuous-Valued Inputs2000
- Locally Weighted LearningArtificial Intelligence Review, 1997
- Classifier systems and genetic algorithmsArtificial Intelligence, 1989
- COGNITIVE SYSTEMS BASED ON ADAPTIVE ALGORITHMS11Research reported in this paper was supported in part by the National Science Foundation under grant DCR 71-01997 and by the Horace H. Rackham School of Graduate Studies under grant 387156.1978