ACM Home Page
Please provide us with feedback. Feedback
Empirical analysis of generalization and learning in XCS with gradient descent
Full text PdfPdf (230 KB)
Source
Genetic And Evolutionary Computation Conference archive
Proceedings of the 9th annual conference on Genetic and evolutionary computation table of contents
London, England
SESSION: Genetics-based machine learning: papers table of contents
Pages: 1814 - 1821  
Year of Publication: 2007
ISBN:978-1-59593-697-4
Authors
Pier Luca Lanzi  Politecnico di Milano, Milano, Italy
Martin V. Butz  University of Wurzburg, Wurzburg, Germany
David E. Goldberg  University of Illinois at Urbana Champaign, Urbana, IL
Sponsors
SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 21,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1276958.1277321
What is a DOI?

ABSTRACT

We analyze generalization and learning in XCS with gradient descent. At first, we show that the addition of gradient in XCS may slow down learning because it indirectly decreases the learning rate. However, in contrast to what was suggested elsewhere, gradient descent has no effect on the achieved generalization. We also show that when gradient descent is combined with roulette wheel selection, which is known to be sensitive to small values of the learning rate, the learning speed can slow down dramatically. Previous results reported no difference in the performance of XCS with gradient descent when roulette wheel selection or tournament selection were used. In contrast, we suggest that gradient descent should always be combined with tournament selection, which is not sensitive to the value of the learning rate. When gradient descent is used in combination with tournament selection, the results show that (i) the slowdown in learning is limited and (ii) the generalization capabilities of XCS are not affected.


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
Alwyn M. Barry. Limits in long path learning with XCS. In Springer-Verlag, editor, Genetic and Evolutionary Computation Conference (GECCO-2003), pages 1832--1843, Chicago, IL, 2003.
 
2
Alwyn M. Barry, John H. Holmes, and Xavier Llorà. Data mining using learning classifier systems. In Bull {5}, pages 15--67.
 
3
 
4
Justin A. Boyan and Andrew W. Moore. Generalization in reinforcement learning: Safely approximating the value function. In G. Tesauro et al., editors, Advances in Neural Information Processing Systems 7, pages 369--376, 1995. The MIT Press.
 
5
 
6
Martin Butz, David G. Goldberg, and Pier Luca Lanzi. Gradient descent methods in learning classifier systems. Technical Report 2003028, Illinois Genetic Algorithms Laboratory - University of Illinois at Urbana-Champaign, 117 Transportation Building, 104 S. Mathews Avenue, Urbana, IL 61801, January 2003.
 
7
Martin V. Butz. Rule-Based Evolutionary Online Learning Systems: A Principled Approach to LCS Analysis and Design. Springer-Verlag, Berlin, 2006
 
8
Martin V. Butz, David E. Goldberg, and Pier Luca Lanzi. Gradient descent methods in learning classifier systems: Improving XCS performance in multistep problems. IEEE Transaction on Evolutionary Computation, 9(5):452--473, October 2005.
 
9
 
10
Martin V. Butz and Stewart W. Wilson. An algorithmic description of XCS. Journal of Soft Computing, 6(3-4):144--153, 2002.
 
11
Marco Dorigo. Genetic and non-genetic operators in alecsys. Evolutionary Computation, 1(2):151--164, 1993.
 
12
Jan Drugowitsch and Alwyn M. Barry. A formal framework and extensions for function approximation in learning classifier systems. Technical Report CSBU-2006-02, Department of Computer Science, University of Bath, January 2006.
 
13
Jan Drugowitsch and Alwyn M. Barry. A formal framework for reinforcement learning with function approximation in learning classifier systems. Technical Report CSBU-2006-02, Department of Computer Science, University of Bath, January 2006.
 
14
Geoffrey J. Gordon. Online fitted reinforcement learning from the value function approximation. Workshop on Value Function Approximation held during the 12th International Conference on Machine Learning, 1995.
 
15
Pier Luca Lanzi. An Analysis of Generalization in the XCS Classifier System. Evolutionary Computation Journal, 7(2):125--149, 1999.
 
16
Pier Luca Lanzi. Learning classifier systems from a reinforcement learning perspective. Soft Computing - A Fusion of Foundations, Methodologies and Applications, 6(3):162--170, 2002
17
18
 
19
Pier Luca Lanzi, Wolfgang Stolzmann, and Stewart W. Wilson, editors. Learning Classifier Systems: From Foundations to Applications, volume 1813 of Lecture Notes in Computer Science. Springer-Verlag, April 2000.
 
20
Stuart Ian Reynolds. Reinforcement Learning with Exploration. PhD thesis, School of Computer Science. The University of Birmingham, Birmingham, B15 2TT, December 2002.
 
21
22
 
23
Atsushi Wada, Keiki Takadama, Katsumori Shimohara, and Osamu Katai. Learning classifier systems with convergence and generalization. In Larry Bull and Tim Kovacs, editors, Foundations of Learning Classifier Systems, volume 183 of Studies in Fuzziness and Soft Computing, pages 285--304. Springer, 2005.
 
24
Stewart W. Wilson. Classifier Fitness Based on Accuracy. Evolutionary Computation, 3(2):149--175, 1995. http://prediction-dynamics.com/.
 
25
Stewart W. Wilson. Generalization in the XCS classifier system. In Genetic Programming 1998: Proceedings of the Third Annual Conference, pages 665--674. Morgan Kaufmann, 1998.


Collaborative Colleagues:
Pier Luca Lanzi: colleagues
Martin V. Butz: colleagues
David E. Goldberg: colleagues