NEAT, There's No Bloat

The Operator Equalization OE family of bloat control methods have achieved promising results in many domains. In particular, the Flat-OE method, that promotes a flat distribution of program sizes, is one of the simplest OE methods and achieves some of the best results. However, Flat-OE, like all OE variants, can be computationally expensive. This work proposes a simplified strategy for bloat control based on Flat-OE. In particular, bloat is studied in the NeuroEvolution of Augmenting Topologies NEAT algorithm. NEAT includes a very simple diversity preservation technique based on speciation and fitness sharing, and it is hypothesized that with some minor tuning, speciation in NEAT can promote a flat distribution of program size. Results indicate that this is the case in two benchmark problems, in accordance with results for Flat-OE. In conclusion, NEAT provides a worthwhile strategy that could be extrapolated to other GP systems, for effective and simple bloat control.

[1]  Vincenzo Cutello,et al.  Parallel Problem Solving from Nature - PPSN XII , 2012, Lecture Notes in Computer Science.

[2]  Leonardo Vanneschi,et al.  Operator equalisation for bloat free genetic programming and a survey of bloat control methods , 2011, Genetic Programming and Evolvable Machines.

[3]  Riccardo Poli,et al.  On the Limiting Distribution of Program Sizes in Tree-Based Genetic Programming , 2007, EuroGP.

[4]  Leonardo Vanneschi,et al.  Open issues in genetic programming , 2010, Genetic Programming and Evolvable Machines.

[5]  Risto Miikkulainen,et al.  Evolving Neural Networks through Augmenting Topologies , 2002, Evolutionary Computation.

[6]  J. K. Kinnear,et al.  Advances in Genetic Programming , 1994 .

[7]  Pascal Bouvry,et al.  EVOLVE - A Bridge between Probability, Set Oriented Numerics and Evolutionary Computation IV [EVOLVE 2013, Leiden The Netherlands, July 10-13, 2013] , 2013 .

[8]  Leonardo Trujillo,et al.  Searching for novel clustering programs , 2013, GECCO '13.

[9]  Sara Silva,et al.  Reassembling operator equalisation: a secret revealed , 2011, GECCO '11.

[10]  Kenneth O. Stanley,et al.  Abandoning Objectives: Evolution Through the Search for Novelty Alone , 2011, Evolutionary Computation.

[11]  Krzysztof Krawiec,et al.  Geometric Semantic Genetic Programming , 2012, PPSN.

[12]  Riccardo Poli,et al.  Operator Equalisation and Bloat Free GP , 2008, EuroGP.

[13]  Riccardo Poli,et al.  Fitness Causes Bloat , 1998 .

[14]  David E. Goldberg,et al.  Genetic Algorithms with Sharing for Multimodalfunction Optimization , 1987, ICGA.

[15]  Ernesto Costa,et al.  Dynamic limits for bloat control in genetic programming and a review of past and current bloat theories , 2009, Genetic Programming and Evolvable Machines.

[16]  Francisco Fernández de Vega,et al.  Speciation in Behavioral Space for Evolutionary Robotics , 2011, J. Intell. Robotic Syst..

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

[18]  Leonardo Trujillo,et al.  Preliminary Study of Bloat in Genetic Programming with Behavior-Based Search , 2013 .

[19]  Leonardo Trujillo,et al.  Searching for Novel Classifiers , 2013, EuroGP.