The Effects of Constant Neutrality on Performance and Problem Hardness in GP

The neutral theory of molecular evolution and the associated notion of neutrality have interested many researchers in Evolutionary Computation. The hope is that the presence of neutrality can aid evolution. However, despite the vast number of publications on neutrality, there is still a big controversy on its effects. The aim of this paper is to clarify under what circumstances neutrality could aid Genetic Programming using the traditional representation (i.e. treelike structures). For this purpose, we use fitness distance correlation as a measure of hardness. In addition we have conducted extensive empirical experimentation to corroborate the fitness distance correlation predictions. This has been done using two test problems with very different landscape features that represent two extreme cases where the different effects of neutrality can be emphasised. Finally, we study the distances between individuals and global optimum to understand how neutrality affects evolution (at least with the one proposed in this paper).

[1]  Richard A. Watson,et al.  On the Utility of Redundant Encodings in Mutation-Based Evolutionary Search , 2002, PPSN.

[2]  Lee Altenberg,et al.  Fitness Distance Correlation Analysis: An Instructive Counterexample , 1997, ICGA.

[3]  Leonardo Vanneschi,et al.  Theory and practice for efficient genetic programming , 2004 .

[4]  Leonardo Vanneschi,et al.  Difficulty of Unimodal and Multimodal Landscapes in Genetic Programming , 2003, GECCO.

[5]  Tim Jones.  Evolutionary Algorithms, Fitness Landscapes and Search , 1995 .

[6]  Riccardo Poli,et al.  Some Steps Towards Understanding How Neutrality Affects Evolutionary Search , 2006, PPSN.

[7]  Carlos M. Fonseca,et al.  Developing redundant binary representations for genetic search , 2005, 2005 IEEE Congress on Evolutionary Computation.

[8]  Julian Francis Miller,et al.  Finding Needles in Haystacks Is Not Hard with Neutrality , 2002, EuroGP.

[9]  Nikolay I. Nikolaev,et al.  Fitness Landscapes and Inductive Genetic Programming , 1997, ICANNGA.

[10]  M. Kimura.  Evolutionary Rate at the Molecular Level , 1968, Nature.

[11]  M. Collins.  Finding needles in haystacks is harder with neutrality , 2005, GECCO '05.

[12]  Riccardo Poli,et al.  On the effects of bit-wise neutrality on fitness distance correlation, phenotypic mutation rates and problem hardness , 2007, FOGA'07.

[13]  M. Collins.  Finding needles in haystacks is harder with neutrality , 2006, Genetic Programming and Evolvable Machines.

[14]  Edmund K. Burke,et al.  Parallel Problem Solving from Nature - PPSN IX: 9th International Conference, Reykjavik, Iceland, September 9-13, 2006, Proceedings , 2006, PPSN.

[15]  Peter J. Angeline,et al.  The Royal Tree Problem, a Benchmark for Single and Multiple Population Genetic Programming , 1996 .

[16]  Leonardo Vanneschi,et al.  A Study of Fitness Distance Correlation as a Difficulty Measure in Genetic Programming , 2005, Evolutionary Computation.

[17]  Kalyanmoy Deb,et al.  Massive Multimodality, Deception, and Genetic Algorithms , 1992, PPSN.

[18]  Julian F. Miller,et al.  Genetic and Evolutionary Computation — GECCO 2003 , 2003, Lecture Notes in Computer Science.

[19]  Sébastien Vérel,et al.  Deceptiveness and neutrality the ND family of fitness landscapes , 2006, GECCO.

[20]  M. Ebner.  On the search space of genetic programming and its relation to nature's search space , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[21]  Franz Rothlauf,et al.  Redundant Representations in Evolutionary Computation , 2003, Evolutionary Computation.

[22]  Thomas Bäck,et al.  Parallel Problem Solving from Nature — PPSN V , 1998, Lecture Notes in Computer Science.

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

[24]  Victor J. Rayward-Smith,et al.  Fitness Distance Correlation and Ridge Functions , 1998, PPSN.

[25]  Leonardo Vanneschi,et al.  Fitness Distance Correlation And Problem Difficulty For Genetic Programming , 2002, GECCO.

[26]  Marc Ebner,et al.  How neutral networks influence evolvability , 2001, Complex..

[27]  Juan Julián Merelo Guervós,et al.  Parallel Problem Solving from Nature - PPSN IX: 9th International Conference, Reykjavik, Iceland, September 9-13, 2006, Proceedings , 2006, PPSN.