XCS with computed prediction in continuous multistep environments

2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005. Proceedings

Volumn 3, Issue , 2005, Pages 2032-2039

  Lanzi, Pier Luca ^a,b   Loiacono, Daniele ^a   Wilson, Stewart W ^b,c   Goldberg, David E ^b  

^a POLITECNICO DI MILANO   (Italy)

^b University of Illinois at Urbana Champaign   (United States)

^c Prediction Dynamics   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; KNOWLEDGE ACQUISITION; LEARNING SYSTEMS; OPTIMIZATION; PROBLEM SOLVING;

PREDICTIONS; Q-LEARNING; REINFORCEMENT LEARNING; XCSF;

EVOLUTIONARY ALGORITHMS;

EID: 27144543585     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. J. Boyan and A. Moore. Generalization in reinforcement learning: Safely approximating the value function. In Proceedings of Neural Information Processings Systems 7. Morgan Kaufmann, 1995. http://www.cs.cmu.edu/~awm/papers. html.
2. J. A. Boyan and A. W. Moore. Generalization in reinforcement learning: Safely approximating the value function. In G. Tesauro, D. S. Touretzky, and T. K. Leen, editors, Advances in Neural Information Processing Systems 7, pages 369-376, Cambridge, MA, 1995. The MIT Press.
3. M. V. Butz and S. W. Wilson. An Algorithmic Description of XCS. In P. L. Lanzi, W. Stolzmann, and S. W. Wilson, editors, Advances in Learning Classifier Systems, volume 1996 of LNAI, pages 253-272. Springer-Verlag, Berlin, 2001.
4. P. L. Lanzi, D. Loiacono, S. W Wilson, and D. E. Goldberg. Extending xcsf beyond linear approximation. Technical Report 2005006, Illinois Genetic Algorithms Laboratory - University of Illinois at Urbana-Champaign, 2005.
5. P. L. Lanzi, D. Loiacono, S. W. Wilson, and D. E. Goldberg. Generalization in the xcsf classifier system: Analysis, improvement, and extension. Technical Report 2005012, Illinois Genetic Algorithms Laboratory - University of Illinois at Urbana-Champaign, 2005.
6. P. L. Lanzi, D. Loiacono, S. W. Wilson, and D. E. Goldberg. Xcs with computable prediction for the learning of boolean functions. Technical Report 2005007, Illinois Genetic Algorithms Laboratory - University of Illinois at Urbana-Champaign, 2005.
7. P. L. Lanzi, D. Loiacono, S. W. Wilson, and D. E. Goldberg. Xcs with computable prediction in multistep environments. Technical Report 2005008, Illinois Genetic Algorithms Laboratory - University of Illinois at Urbana-Champaign, 2005.
8. T. J. Perkins and D. Precup. A convergent form of approximate policy iteration. In S. T. S. Becker and K. Obermayer, editors, Advances in Neural Information Processing Systems 15, pages 1595-1602, Cambridge, MA, 2003. MIT Press.
9. R. S. Sutton. Generalization in reinforcement learning: Successful examples using sparse coarse coding. In D. S. Touretzky, M. C. Mozer, and M. E. Hasselmo, editors, Advances in Neural Information Processing Systems 8, pages 1038-1044. The MIT Press, Cambridge, MA., 1996.
10. R. S. Sutton and A. G. Barto. Reinforcement Learning - An Introduction. MIT Press, 1998.
11. G. Tesauro. TD-gammon, a self-teaching backgammon program, achieves master-level play. Neural Computation, 6(2):215-219, 1994.
12. S. Thrun and A. Schwartz. Issues in Using Function Approximation for Reinforcement Learning. In M. Mozer, P. Smolensky, D. Touretzky, J. Elman, and A. Weigend, editors, Proceedings of the 1993 Connectionist Models Summer School, Hillsdale, NJ, 1993. Lawrence Erlbaum.
13. C. Watkins. Learning from delayed reward. PhD thesis, 1989.
14. B. Widrow and M. E. Hoff. Adaptive Switching Circuits, chapter Neurocomputing: Foundation of Research, pages 126-134. The MIT Press, Cambridge, 1988.
15. S. W. Wilson. Classifier Fitness Based on Accuracy. Evolutionary Computation, 3(2):149-175, 1995. http://prediction-dynamics.com/.
16. S. W. Wilson. Function approximation with a classifier system. In L. S. et al., editor, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), pages 974-981, San Francisco, California, USA, 7-11 July 2001. Morgan Kaufmann.
17. S. W. Wilson. Mining Oblique Data with XCS. volume 1996 of Lecture notes in Computer Science, pages 158-174. Springer-Verlag, Apr. 2001.
18. S. W. Wilson. Classifiers that approximate functions. Journal of Natural Computating, 1(2-3):211-234, 2002.
19. S. W. Wilson. Classifier systems for continuous pay-off environments. In K. D. et al., editor, Genetic and Evolutionary Computation - GECCO-2004, Part II, volume 3103 of Lecture Notes in Computer Science, pages 824-835, Seattle, WA, USA, 26-30 June 2004. Springer-Verlag.