Abstract
Wilson’s recent XCS classifier system forms complete mappings of the payoff environment in the reinforcement learning tradition thanks to its accuracy based fitness. According to Wilson’s Generalization Hypothesis, XCS has a tendency towards generalization. With the XCS Optimality Hypothesis, I suggest that XCS systems can evolve optimal populations (representations); populations which accurately map all input/action pairs to payoff predictions using the smallest possible set of non-overlapping classifiers. The ability of XCS to evolve optimal populations for boolean multiplexer problems is demonstrated using condensation, a technique in which evolutionary search is suspended by setting the crossover and mutation rates to zero. Condensation is automatically triggered by self-monitoring of performance statistics, and the entire learning process is terminated by autotermination. Combined, these techniques allow a classifier system to evolve optimal representations of boolean functions without any form of supervision. A more complex but more robust and efficient technique for obtaining optimal populations called subset extraction is also presented and compared to condensation.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Watkins, C., 1989, Learning from Delayed Rewards, PhD Thesis, Cambridge University, U.K.
Lin, L. J., 1992, Self-improving reactive agents based on reinforcement learning, planning and teaching. Machine Learning, 8, 293–321.
Munos, R., and Patinel, J., 1994, Reinforcement learning with dynamic covering of state-action space: Partitioning Q-Learning, in From Animals to Animats 3: Proceedings of the Third International Conference on Simulation of Adaptive Behavior (SAB-94), pp. 354–363.
Wilson, S. W., 1995, Classifier Fitness Based on Accuracy, Evolutionary Computation, 3.
Wilson, S. W., 1996, Generalization in XCS, Unpublished contribution to ICML ′96 Workshop on Evolutionary Computing and Machine Learning.
Holland, J., H., 1975, Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor.
Holland, J., H., 1986, Machine Learning, an Artificial Intelligence Approach. Volume II, chapter Escaping Brittleness: The possibilities of General-Purpose Learning Algorithms Applied to Parallel Rule-Based Systems, pp. 593-623, Morgan Kaufmann.
Kovacs, T., 1996, Evolving Optimal Populations with XCS Classifier Systems, Technical Report CSR-96-17 and CSRP-96-17, School of Computer Science, University of Birmingham, United Kingdom, available from http://www.cs.bham.ac.uk/system/tech-reports/tr.html
Wilson, S. W., 1994, ZCS: A zeroth level classifier system, Evolutionary Computation, 2.
Schuurmans, D., and Schaeffer, J., 1989, Representational Difficulties with Classifier Systems, in Proceedings Third International Conference on Genetic Algorithms, pp. 328-333.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag London
About this paper
Cite this paper
Kovacs, T. (1998). XCS Classifier System Reliably Evolves Accurate, Complete, and Minimal Representations for Boolean Functions. In: Chawdhry, P.K., Roy, R., Pant, R.K. (eds) Soft Computing in Engineering Design and Manufacturing. Springer, London. https://doi.org/10.1007/978-1-4471-0427-8_7
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0427-8_7
Publisher Name: Springer, London
Print ISBN: 978-3-540-76214-0
Online ISBN: 978-1-4471-0427-8
eBook Packages: Springer Book Archive