How Fitness Estimates Interact with Reproduction Rates: Towards Variable Offspring Set Sizes in XCSF
Despite many successful applications of the XCS classifier system, a rather crucial aspect of XCS’ learning mechanism has hardly ever been modified: exactly two classifiers are reproduced when XCSF’s iterative evolutionary algorithm is applied in a sampled problem niche. In this paper, we investigate the effect of modifying the number of reproduced classifiers. In the investigated problems, increasing the number of reproduced classifiers increases the initial learning speed. In less challenging approximation problems, also the final approximation accuracy is not affected. In harder problems, however, learning may stall, yielding worse final accuracies. In this case, over-reproductions of inaccurate, ill-estimated, over-general classifiers occur. Since the quality of the fitness signal decreases if there is less time for evaluation, a higher reproduction rate can deteriorate the fitness signal, thus—dependent on the difficulty of the approximation problem—preventing further learning improvements. In order to speed-up learning where possible while still assuring learning success, we propose an adaptive offspring set size that may depend on the current reliability of classifier parameter estimates. Initial experiments with a simple offspring set size adaptation show promising results.
KeywordsLCS XCS Reproduction Selection Pressure
Unable to display preview. Download preview PDF.
- 1.Holland, J.H.: Adaptation. In: Progress in Theoretical Biology, vol. 4, pp. 263–293. Academic Press, New York (1976)Google Scholar
- 2.Holland, J.H.: Properties of the bucket brigade algorithm. In: Proceedings of the 1st International Conference on Genetic Algorithms, Hillsdale, NJ, USA, pp. 1–7. L. Erlbaum Associates Inc., Mahwah (1985)Google Scholar
- 3.Widrow, B., Hoff, M.E.: Adaptive switching circuits. Western Electronic Show and Convention, Convention Record, Part 4, 96–104 (1960)Google Scholar
- 5.Lanzi, P.L., Loiacono, D., Wilson, S.W., Goldberg, D.E.: Prediction update algorithms for XCSF: RLS, Kalman filter, and gain adaptation. In: GECCO 2006: Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation, pp. 1505–1512. ACM, New York (2006)Google Scholar
- 7.Orriols-Puig, A., Bernadó-Mansilla, E.: Bounding XCS’s parameters for unbalanced datasets. In: GECCO 2006: Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation, pp. 1561–1568. ACM, New York (2006)Google Scholar
- 11.Butz, M.V., Wilson, S.W.: An algorithmic description of XCS. In: Lanzi, P.L., Stolzmann, W., Wilson, S.W. (eds.) IWLCS 2000. LNCS (LNAI), vol. 1996, pp. 267–274. Springer, Heidelberg (2001)Google Scholar