Enhancing Learning Capabilities by XCS with Best Action Mapping
This paper proposes a novel approach of XCS called XCS with Best Action Mapping (XCSB) to enhance the learning capabilities of XCS. The feature of XCSB is to learn only best actions having the highest predicted payoff with the high accuracy unlike XCS which learns actions having the highest and lowest predicted payoff with the high accuracy. To investigate the effectiveness of XCSB, we applied XCSB to two benchmark problems: multiplexer problem as a single step problem and maze problem as a multi step problem. The experimental results show that (1) XCSB can solve quickly the problem which has a large state space and (2) XCSB can achieve a high performance with a small max population size.
Unable to display preview. Download preview PDF.
- 4.Butz, M.V., Sastry, K., Goldberg, D.E.: Tournament Selection in XCS. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2003), pp. 1857–1869 (2003)Google Scholar
- 5.Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison Wesley (1989)Google Scholar
- 6.Holland, J.H.: Escaping Brittleness: The Possibilities of General Purpose Learning Algorithms Applied to Parallel Rule-based system. Machine Learning 2, 593–623 (1986)Google Scholar
- 8.Sutton, R.S.: Learning to Predict by the Methods of Temporal Differences. Machine Learning 3(1), 9–44 (1988)Google Scholar