| Prediction update algorithms for XCSF: RLS, Kalman filter, and gain adaptation |
| Full text |
Pdf
(190 KB)
|
| Source
|
Genetic And Evolutionary Computation Conference
archive
Proceedings of the 8th annual conference on Genetic and evolutionary computation
table of contents
Seattle, Washington, USA
SESSION: Learning Classifier systems and other genetics-based machine learning: papers
table of contents
Pages: 1505 - 1512
Year of Publication: 2006
ISBN:1-59593-186-4
|
|
Authors
|
|
Pier Luca Lanzi
|
Politecnico di Milano, Milano, Italy and University of Illinois at Urbana Champaign, Urbana, IL
|
|
Daniele Loiacono
|
Politecnico di Milano, Milano, Italy
|
|
Stewart W. Wilson
|
University of Illinois at Urbana Champaign, Urbana, IL and Prediction Dynamics, Concord, MA
|
|
David E. Goldberg
|
University of Illinois at Urbana Champaign, Urbana, IL
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 7, Downloads (12 Months): 62, Citation Count: 2
|
|
|
ABSTRACT
We study how different prediction update algorithms influence the performance of XCSF. We consider three classical parameter estimation algorithms (NLMS, RLS, and Kalman filter) and four gain adaptation algorithms (K1, K2, IDBD, and IDD). The latter have been shown to perform comparably to the best algorithms (RLS and Kalman), but they have a lower complexity. We apply these algorithms to update classifier prediction in XCSF and compare the performances of the seven versions of XCSF on a set of real functions. Our results show that the best known algorithms still perform best: XCSF with RLS and XCSF with Kalman perform significantly better than the others. In contrast, when added to XCSF, gain adaptation algorithms perform comparably to NLMS, the simplest estimation algorithm, the same used in the original XCSF. Nevertheless, algorithms that perform similarly generalize differently. For instance: XCSF with Kalman filter evolves more compact solutions than XCSF with RLS and gain adaptation algorithms allow better generalization than NLMS.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
M. V. Butz and S. W. Wilson. An algorithmic description of XCS. Journal of Soft Computing, 6(3-4):144--153, 2002.
|
| |
3
|
S. A. Glantz and B. K. Slinker. Primer of Applied Regression & Analysis of Variance. McGraw Hill, 2001. second edition.
|
| |
4
|
G. C. Goodwin and K. S. Sin. Adaptive Filtering: Prediction and Control. Prentice-Hall information and system sciences series, Mar. 1984.
|
| |
5
|
M. E. Harmon and L. C. B. III. Multi-player residual advantage learning with general function. Technical report, Air Force Base Ohio: Wright Laboratory, 1996.
|
| |
6
|
|
 |
7
|
|
| |
8
|
P. L. Lanzi, D. Loiacono, S. W. Wilson, and D. E. Goldberg. Generalization in the XCSF classifier system: Analysis, improvement, and extension. Technical Report 2005012, Illinois Genetic Algorithms Laboratory - University of Illinois at Urbana-Champaign, 2005.
|
| |
9
|
P. L. Lanzi, D. Loiacono, S. W. Wilson, and D. E. Goldberg. XCS with computed prediction for the learning of Boolean functions. In Proceedings of the IEEE Congress on Evolutionary Computation - CEC-2005, pages 588--595, Edinburgh, UK, Sept. 2005. IEEE.
|
| |
10
|
P. L. Lanzi, D. Loiacono, S. W. Wilson, and D. E. Goldberg. Prediction update algorithms for XCSF: Rls, kalman filter, and gain adaptation. Technical Report 2006008, Illinois Genetic Algorithms Laboratory - University of Illinois at Urbana-Champaign, 2006.
|
| |
11
|
R. S. Sutton. Adapting bias by gradient descent: An incremental version of delta-bar-delta. In Proceedings of the Tenth National Conference on Artificial Intelligence, pages 171--176. MIT Press, 1992.
|
| |
12
|
R. S. Sutton. Gain adaptation beats least squares? In Proceedings of the Seventh Yale Workshop on Adaptive and Learning Systems, pages 161--166. Yale University, New Haven, CT, 1992.
|
| |
13
|
|
| |
14
|
|
|