Universal consistency and bloat in GP some theoretical considerations about genetic programming from a statistical learning theory viewpoint

Revue d'Intelligence Artificielle

Volumn 20, Issue 6, 2006, Pages 805-827

  Gelly, Sylvain ^a   Teytaud, Olivier ^a   Bredeche, Nicolas ^a   Schoenauer, Marc ^a  

^a UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur

Author keywords

Bloat; Genetic programming; Statistical learning theory; Symbolic regression; Universal consistency

Indexed keywords

ERROR ANALYSIS; LEARNING SYSTEMS; PROBLEM SOLVING; REGRESSION ANALYSIS;

STATISTICAL LEARNING THEORY; SYMBOLIC REGRESSION; UNIVERSAL CONSISTENCY;

GENETIC PROGRAMMING;

EID: 34548143010     PISSN: 0992499X     EISSN: None     Source Type: Journal    
DOI: 10.3166/ria.20.805-827     Document Type: Article

References (27)

1. Antony M., Bartlett P., Neural Network Learning: Theoretical Foundations, Cambridge University Press, 1999.
2. Banzhaf W., Langdon W. B., «Some Considerations on the Reason for Bloat.», Genetic Programming andEvolvable Machines, vol. 3, no 1, p. 81-91, 2002.
3. Banzhaf W., Nordin P., Keller R., Francone F., Genetic Programming : an introduction, Morgan Kaufmann Publisher Inc., San Francisco, CA, USA, 1998.
4. Bleuler S., Brack M., Thiele L., Zitzler E., «Multiobjective Genetic Programming: Reducing Bloat Using SPEA2», Proceedings of the 2001 Congress on Evolutionary Computation CEC2001, IEEE Press, COEX, World Trade Center, 159 Samseong-dong, Gangnam-gu, Seoul, Korea, p. 536-543, 27-30, 2001.
5. Blickle T., Thiele L., «Genetic Programming and Redundancy», in , J. Hopf (ed.), Genetic Algorithms Workshop at KI-94, Max-Planck-Institut für Informatik, p. 33-38, 1994.
6. Daida J. M., Bertram R. R., Stanhope S. A., Khoo J. C., Chaudhary S. A., Chaudhri O. A., Polito J. A. I., «What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming», Genetic Programming and Evolvable Machines, vol. 2, no 2, p. 165-191, 2001.
7. De Jong E. D., Watson R. A., Pollack J. B., «Reducing Bloat and Promoting Diversity using Multi-Objective Methods», Proceedings of the Genetic and Evolutionary Computation Conference, GECCO-2001, Morgan Kaufmann Publishers, San Francisco, CA, p. 11-18, 2001.
8. Devroye L., Györfi L., Lugosi G., A Probabilistic Theory of Pattern Recognition, Springer, 1997.
9. Ekart A., Nemeth S., «Maintaining the Diversity of Genetic Programs», EuroGP "02: Proceedings of the 5th European Conference on Genetic Programming, Springer-Verlag, London, UK, p. 162-171, 2002.
10. Grenander U., Abstract Inference, Wiley, New York, 1981.
11. Gustafson S., Ekart A., Burke E., Kendall G., «Problem difficulty and code growth in genetic programming», Genetic Programming and Evolvable Machines, vol. 4, no 3, p. 271-290, 2004.
12. Koza J. R., Genetic Programming: On the Programming of Computers by Means of Natural Selection, MIT Press, Cambridge, MA, USA, 1992.
13. Langdon W. B., «The Evolution of Size in Variable Length Representations», IEEE International Congress on Evolutionary Computations (ICEC 1998), IEEE Press, p. 633-638, 1998.
14. Langdon W. B., «Size fair and homologous tree genetic programming crossovers», Genetic Programming And Evolvable Machines, vol. 1, no 1/2, p. 95-119, 2000.
15. Langdon W. B., Poli R., «Fitness Causes Bloat: Mutation», Late Breaking Papers at GP "97, Stanford Bookstore, p. 132-140, 1997.
16. Langdon W. B., Soule T., Poli R., Foster J. A., «The Evolution of Size and Shape», Advances in Genetic Programming III, MIT Press, p. 163-190, 1999.
17. Luke S., Panait L., «Lexicographic Parsimony Pressure», GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, Morgan Kaufmann Publishers, p. 829-836, 2002.
18. McPhee N. F., Miller J. D., «Accurate Replication in Genetic Programming», Genetic Algorithms: Proceedings of the Sixth International Conference (ICGA95), Morgan Kaufmann, Pittsburgh, PA, USA, p. 303-309, 1995.
19. Nordin P., Banzhaf W., «Complexity Compression and Evolution», Genetic Algorithms: Proceedings of the Sixth International Conference (ICGA95), Morgan Kaufmann, Pittsburgh, PA, USA, p. 310-317, 15-19, 1995.
20. Ratle A., Sebag. M., «Avoiding the bloat with Probabilistic Grammar-guided Genetic Programming», Artificial Evolution VI, Springer Verlag, 2001.
21. Silva S., Almeida J., «Dynamic Maximum Tree Depth : A Simple Technique for Avoiding Bloat in Tree-Based GP», Genetic and Evolutionary Computation - GECCO-2003, LNCS, Springer-Verlag, p. 1776-1787, 2003.
22. Silva S., Costa E., «Dynamic Limits for Bloat Control: Variations on Size and Depth.», GECCO (2), p. 666-677, 2004.
23. Soule T., «Exons and Code Growth in Genetic Programming», European Conference on Genetic Programming (EuroGP 2002), vol. 2278 of LNCS, Springer-Verlag, p. 142-151, 2002.
24. Soule T., Foster J. A., «Effects of Code Growth and Parsimony Pressure on Populations in Genetic Programming», Evolutionary Computation, vol. 6, no 4, p. 293-309, 1998.
25. Vapnik V., The Nature of Statistical Learning Theory, Springer, 1995.
26. Zhang B.-T., Mühlenbein H., «Balancing Accuracy and Parsimony in Genetic Programming», Evolutionary Computation, 1995.
27. Zhang B.-T., Ohm P., Mühlenbein H., «Evolutionary Induction of Sparse Neural Trees», Evolutionary Computation, vol. 5, no 2, p. 213-236, 1997.