A learning theory approach of bloat

GECCO 2005 - Genetic and Evolutionary Computation Conference

Volumn , Issue , 2005, Pages 1783-1784

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

^a INRIA   (France)

Author keywords

Code Bloat; Code Growth; Genetic Programming; Statistical Learning Theory

Indexed keywords

COMPUTATION THEORY; CONVERGENCE OF NUMERICAL METHODS; MATHEMATICAL PROGRAMMING; REGRESSION ANALYSIS; SEARCH ENGINES; STATISTICAL METHODS;

CODE BLOAT; CODE GROWTH; GENETIC PROGRAMMING; STATISTICAL LEARNING THEORY;

LEARNING SYSTEMS;

EID: 32444445642     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1068009.1068309     Document Type: Conference Paper

References (16)

1. W. Banzhaf and W. B. Langdon. Some considerations on the reason for bloat. Genetic Programming and Evolvable Machines, 3(1):81-91, 2002.
2. T. Blickle and L. Thiele. Genetic programming and redundancy. In J. Hopf, editor, Genetic Algorithms Workshop at KI-94, pages 33-38. Max-Planck-Institut für Informatik, 1994.
3. S. Gelly, O. Teytaud, N. Bredeche, and M. Schoenauer. Apprentissage statistique et programmation gntique: la croissance du code est-elle invitable? In Actes de la conference CAp. PUG, 2005.
4. S. Gelly, O. Teytaud, N. Bredeche, and M. Schoenauer. A statistical learning theory approach of bloat. www.lri.fr/teytaud/longBloat.pdf, 2005.
5. J. R. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, MA, USA, 1992.
6. W. B. Langdon. The evolution of size in variable length representations. In ICEC'98, pages 633-638. IEEE Press, 1998.
7. W. B. Langdon. Size fair and homologous tree genetic programming crossovers. Genetic Programming And Evolvable Machines, 1(1/2):95-119, 2000.
8. W. B. Langdon and R. Poli. Fitness causes bloat: Mutation. In J. Koza, editor, Late Breaking Papers at GP'97, pages 132-140. Stanford Bookstore, 1997.
9. W. B. Langdon, T. Soule, R. Poli, and J. A. Foster. The evolution of size and shape. In L. Spector, W. B. Langdon, U.-M. O'Reilly, and P. Angeline, editors, Advances in Genetic Programming III, pages 163-190. MIT Press, 1999.
10. S. Luke and L. Panait. Lexicographic parsimony pressure. In W. B. L. et al., editor, GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, pages 829-836. Morgan Kaufmann Publishers, 2002.
11. N. F. McPhee and J. D. Miller. Accurate replication in genetic programming. In L. Eshelman, editor, Genetic Algorithms: Proceedings of the Sixth International Conference (ICGA95), pages 303-309, Pittsburgh, PA, USA, 1995. Morgan Kaufmann.
12. P. Nordin and W. Banzhaf. Complexity compression and evolution. In L. Eshelman, editor, Genetic Algorithms: Proceedings of the Sixth International Conference (ICGA95), pages 310-317, Pittsburgh, PA, USA, 15-19 July 1995. Morgan Kaufmann.
13. A. Ratle and M. Sebag. Avoiding the bloat with probabilistic grammar-guided genetic programming. In P. C. et al., editor, Artificial Evolution VI. Springer Verlag, 2001.
14. S. Silva and J. Almeida. Dynamic maximum tree depth: A simple technique for avoiding bloat in tree-based gp. In E. C.-P. et al., editor, Genetic and Evolutionary Computation - GECCO-2003, volume 2724 of LNCS, pages 1776-1787. Springer-Verlag, 2003.
15. T. Soule. Exons and code growth in genetic programming. In J. A. F. et al., editor, EuroGP 2002, volume 2278 of LNCS, pages 142-151. Springer-Verlag, 2002.
16. T. Soule and J. A. Foster. Effects of code growth and parsimony pressure on populations in genetic programming. Evolutionary Computation, 6(4):293-309, 1998.