Foundations of Genetic Programming Tutorial at GECCO 2003

Riccardo Poli Department of Computer Science, University of Essex UK

W. B. Langdon Computer Science, University College, London

Part I 8:30-10:15 Riccardo Poli

• Tutorial (partly) based upon Foundations of Genetic Programming
  
• 1. Introduction
  
• 4. Pessimistic GP Schema Theories
  
• Exact GP Schema Theory: Backbone
  
• Exact GP Schema Theory: Nuts and Bolts (some in 5)
  
• Operator Biases (partly in 6)
  
• Operator Interaction
  
• Exact Size Evolution Equations and Bloat
  
• Tarpeian Method for Bloat Control
  
• Conclusions and Outlook for GA/GP Schema Analysis

Part II 10:35-12:20 Bill Langdon

• 2. Fitness Landscapes
  
• 7. and 8. The Genetic Programming Search Space
  New rates of convergence and limits.
  
• 9. Empirical: Santa Fe Ant
  
• 10. The MAX problem
  
• 11. Genetic Programming Convergence and Bloat
  
• Conclusions

Slides (postscript)

• Contents
• Part I
• Peferences (part I)
• Part II
• References (part II)