Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/1388969.1389016acmconferencesArticle/Chapter ViewAbstractPublication PagesgeccoConference Proceedingsconference-collections
demonstration

Towards increasing learning speed and robustness of XCSF: experimenting with larger offspring set sizes

Published: 12 July 2008 Publication History

Abstract

The XCS classifier system has been successfully applied to various problem domains including datamining, boolean classifications, and function approximation. In all these applications just two classifiers were reproduced in a match or action set, given a time-recency threshold was met in the set. In this paper, we investigate the effect of selecting more than two classifiers for reproduction in XCSF. We either increase the number of selected classifiers or select a number of classifiers relative to the current match set size. In the functions investigated, both approaches showed a highly significant increase in initial learning speed. Also, in less challenging approximation tasks, the final accuracy reached is not affected by the approach. However, in harder functions, learning may stall due to over-reproductions of inaccurate, ill-estimated classifiers. Thus, we propose an adaptive offspring size rate that may depend on the current reliability of classifier parameter estimates. First results with a fixed offspring set size decrement show promising results. Future work is needed to speed-up XCS's learning progress and adjust its learning speed to the perceived problem difficulty.

References

[1]
M. V. Butz, D. E. Goldberg, and P. L. Lanzi. Bounding learning time in XCS. Proceedings of the Sixth Genetic and Evolutionary Computation Conference (GECCO-2004): Part II, pages 739--750, 2004.]]
[2]
M. V. Butz, D. E. Goldberg, P. L. Lanzi, and K. Sastry. Problem solution sustenance in XCS: Markov chain analysis of niche support distributions and the impact on computational complexity. Genetic Programming and Evolvable Machines, 8:5--37, 2007.]]
[3]
M. V. Butz, D. E. Goldberg, and K. Tharakunnel. Analysis and improvement of fitness exploitation in XCS: Bounding models, tournament selection, and bilateral accuracy. Evolutionary Computation, 11:239--277, 2003.]]
[4]
M. V. Butz, T. Kovacs, P. L. Lanzi, and S. W. Wilson. Toward a theory of generalization and learning in XCS. IEEE Transactions on Evolutionary Computation, 8:28--46, 2004.]]
[5]
M. V. Butz, P. L. Lanzi, and S. W. Wilson. Hyper-ellipsoidal conditions in XCS: Rotation, linear approximation, and solution structure. GECCO 2006: Genetic and Evolutionary Computation Conference, pages 1457--1464, 2006.]]
[6]
M. V. Butz, P. L. Lanzi, and S. W. Wilson. Function approximation with XCS: Hyperellipsoidal conditions, recursive least squares, and compaction. IEEE Transactions on Evolutionary Computation, in press.]]
[7]
J. Drugowitsch and A. Barry. A formal framework and extensions for function approximation in learning classifier systems. Machine Learning, 70:45--88, 2008.]]
[8]
J. H. Holland. Adaptation. In R. Rosen and F. Snell, editors, Progress in theoretical biology, volume 4, pages 263--293. Academic Press, New York, 1976.]]
[9]
J. H. Holland. Properties of the bucket brigade algorithm. Proceedings of an International Conference on Genetic Algorithms and their Applications, pages 1--7, 1985.]]
[10]
P. L. Lanzi, D. Loiacono, S. W. Wilson, and D. E. Goldberg. Prediction update algorithms for XCSF: RLS, kalman filter and gain adaptation. GECCO 2006: Genetic and Evolutionary Computation Conference, pages 1505--1512, 2006.]]
[11]
A. Orriols-Puig and E. Bernadó-Mansilla. Bounding XCS's parameters for unbalanced datasets. GECCO 2006: Genetic and Evolutionary Computation Conference, pages 1561--1568, 2006.]]
[12]
B. Widrow and M. Hoff. Adaptive switching circuits. Western Electronic Show and Convention, 4:96--104, 1960.]]
[13]
S. W. Wilson. Classifier fitness based on accuracy. Evolutionary Computation, 3(2):149--175, 1995.]]
[14]
S. W. Wilson. Get real! XCS with continuous-valued inputs. In P. L. Lanzi, W. Stolzmann, and S. W. Wilson, editors, Learning classifier systems: From foundations to applications (LNAI 1813), pages 209--219. Springer-Verlag, Berlin Heidelberg, 2000.]]
[15]
S. W. Wilson. Classifiers that approximate functions. Natural Computing, 1:211--234, 2002.]]

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
GECCO '08: Proceedings of the 10th annual conference companion on Genetic and evolutionary computation
July 2008
1182 pages
ISBN:9781605581316
DOI:10.1145/1388969
  • Conference Chair:
  • Conor Ryan,
  • Editor:
  • Maarten Keijzer
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 12 July 2008

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. XCSF
  2. learning classifier systems
  3. reproduction
  4. selection pressure

Qualifiers

  • Demonstration

Conference

GECCO08
Sponsor:

Acceptance Rates

Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 123
    Total Downloads
  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 19 Sep 2024

Other Metrics

Citations

View Options

Get Access

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media