The effects of constant neutrality on performance and problem hardness in GP

Authors:
Edgar Galván-López;Stephen Dignum;Riccardo Poli
Affiliations:
Department of Computing and Electronic Systems, University of Essex, Colchester, UK;Department of Computing and Electronic Systems, University of Essex, Colchester, UK;Department of Computing and Electronic Systems, University of Essex, Colchester, UK
Venue:
EuroGP'08 Proceedings of the 11th European conference on Genetic programming
Year:
2008

Citing 14
Cited 5

Genetic programming: on the programming of computers by means of natural selection

Genetic programming: on the programming of computers by means of natural selection
The royal tree problem, a benchmark for single and multiple population genetic programming

Advances in genetic programming
How neutral networks influence evolvability

Complexity
Fitness Distance Correlation and Ridge Functions

PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
On the Utility of Redundant Encodings in Mutation-Based Evolutionary Search

PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Fitness Distance Correlation And Problem Difficulty For Genetic Programming

GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Finding Needles in Haystacks Is Not Hard with Neutrality

EuroGP '02 Proceedings of the 5th European Conference on Genetic Programming
Redundant representations in evolutionary computation

Evolutionary Computation
Finding needles in haystacks is harder with neutrality

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
A Study of Fitness Distance Correlation as a Difficulty Measure in Genetic Programming

Evolutionary Computation
Deceptiveness and neutrality the ND family of fitness landscapes

Proceedings of the 8th annual conference on Genetic and evolutionary computation
Difficulty of unimodal and multimodal landscapes in genetic programming

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
On the effects of bit-wise neutrality on fitness distance correlation, phenotypic mutation rates and problem hardness

FOGA'07 Proceedings of the 9th international conference on Foundations of genetic algorithms
Some steps towards understanding how neutrality affects evolutionary search

PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature

An Empirical Investigation of How Degree Neutrality Affects GP Search

MICAI '09 Proceedings of the 8th Mexican International Conference on Artificial Intelligence
On the effects of locality in a permutation problem: the Sudoku puzzle

CIG'09 Proceedings of the 5th international conference on Computational Intelligence and Games
Predicting problem difficulty for genetic programming applied to data classification

Proceedings of the 13th annual conference on Genetic and evolutionary computation
Defining locality as a problem difficulty measure in genetic programming

Genetic Programming and Evolvable Machines
Nonlinear modeling of soil deformation modulus through LGP-based interpretation of pressuremeter test results

Engineering Applications of Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

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).