Effects of program simplification on simple building blocks in Genetic Programming

This paper investigates the effects on building blocks of using simplification in a genetic programming (GP) system to combat the problem of code bloat. The evolved genetic programs are simplified online during the evolutionary process using algebraic simplification rules and hashing techniques. A simplified form of building block (numerical-nodes) is tracked throughout individual GP runs both when using or not using online simplification of evolved genetic programs. The results suggest that online simplification disrupts existing potential building blocks during the evolution process. However, GP with simplification is capable of creating new building blocks which are used to form a more accurate solution, when compared to the standard GP. The effectiveness of GP systems utilising simplification can be correlated to the creation of these new building blocks.

[1]  Dana H. Ballard,et al.  Rooted-tree schemata in genetic programming , 1999 .

[2]  Mengjie Zhang,et al.  Algebraic simplification of GP programs during evolution , 2006, GECCO.

[3]  Anikó Ekárt,et al.  Shorter Fitness Preserving Genetic Programs , 1999, Artificial Evolution.

[4]  Riccardo Poli,et al.  General Schema Theory for Genetic Programming with Subtree-Swapping Crossover , 2001, EuroGP.

[5]  ProgrammingJustinian P. RoscaComputer.  Analysis of Complexity Drift in Genetic , 1997 .

[6]  Nicholas S. Flann,et al.  Improving the accuracy and robustness of genetic programming through expression simplification , 1996 .

[7]  Riccardo Poli,et al.  An Experimental Analysis of Schema Creation, Propagation and Disruption in Genetic Programming , 1997, ICGA.

[8]  Matthew J. Streeter,et al.  The Root Causes of Code Growth in Genetic Programming , 2003, EuroGP.

[9]  P. Nordin,et al.  Explicitly defined introns and destructive crossover in genetic programming , 1996 .

[10]  Peter Nordin,et al.  Genetic programming - An Introduction: On the Automatic Evolution of Computer Programs and Its Applications , 1998 .

[11]  Conor Ryan,et al.  A Competitive Building Block Hypothesis , 2004, GECCO.

[12]  Jason M. Daida,et al.  What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming , 1999, Genetic Programming and Evolvable Machines.

[13]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[14]  William D. Smart,et al.  Program Simplification in Genetic Programming for Object Classification , 2005, KES.

[15]  Lee Altenberg,et al.  The Schema Theorem and Price's Theorem , 1994, FOGA.

[16]  P.A. Whigham,et al.  A Schema Theorem for context-free grammars , 1995, Proceedings of 1995 IEEE International Conference on Evolutionary Computation.

[17]  Melanie Mitchell,et al.  Relative Building-Block Fitness and the Building Block Hypothesis , 1992, FOGA.

[18]  William B. Langdon,et al.  Quadratic Bloat in Genetic Programming , 2000, GECCO.

[19]  David E. Goldberg,et al.  BUILDING-BLOCK SUPPLY IN GENETIC PROGRAMMING , 2003 .

[20]  Peter J. Angeline,et al.  Extending Genetic Programming with Recombinative Guidance , 1996 .

[21]  John R. Koza,et al.  Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.

[22]  Una-May O'Reilly,et al.  An analysis of genetic programming , 1995 .

[23]  Hammad Majeed,et al.  A new approach to evaluate GP schema in context , 2005, GECCO '05.

[24]  Terence Soule,et al.  Code growth in genetic programming , 1996 .

[25]  Jason M. Daida,et al.  Analysis of single-node (building) blocks in genetic programming , 1999 .

[26]  Riccardo Poli,et al.  General Schema Theory for Genetic Programming with Subtree-Swapping Crossover: Part II , 2003, Evolutionary Computation.

[27]  Terence Soule,et al.  An Analysis of the Causes of Code Growth in Genetic Programming , 2002, Genetic Programming and Evolvable Machines.

[28]  Mengjie Zhang,et al.  Online Program Simplification in Genetic Programming , 2006, SEAL.

[29]  Terence Soule,et al.  Growth of self-canceling code in evolutionary systems , 2006, GECCO.

[30]  Riccardo Poli,et al.  General Schema Theory for Genetic Programming with Subtree-Swapping Crossover: Part I , 2003, Evolutionary Computation.

[31]  Lothar Thiele,et al.  Genetic Programming and Redundancy , 1994 .

[32]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[33]  L. Altenberg.  The evolution of evolvability in genetic programming , 1994 .