Evolving graphs with semantic neutral drift
Open Access
- 29 October 2019
- journal article
- research article
- Published by Springer Nature in Natural Computing
- Vol. 20 (1) , 127-143
Abstract
We introduce the concept of Semantic Neutral Drift (SND) for genetic programming (GP), where we exploit equivalence laws to design semantics preserving mutations guaranteed to preserve individuals’ fitness scores. A number of digital circuit benchmark problems have been implemented with rule-based graph programs and empirically evaluated, demonstrating quantitative improvements in evolutionary performance. Analysis reveals that the benefits of the designed SND reside in more complex processes than simple growth of individuals, and that there are circumstances where it is beneficial to choose otherwise detrimental parameters for a GP system if that facilitates the inclusion of SND.Keywords
All Related Versions
Funding Information
- Engineering and Physical Sciences Research Council (1789003)
This publication has 36 references indexed in Scilit:
- Probabilistic Graph Programs for Randomised and Evolutionary Algorithms2018
- Evolving Graphs by Graph Programming2018
- Interacting quantum observables: categorical algebra and diagrammaticsNew Journal of Physics, 2011
- Neutrality in evolutionary algorithms… What do we know?Evolving Systems, 2011
- TOWARD A SELECTION THEORY OF MOLECULAR EVOLUTIONEvolution, 2008
- Neutrality and gradualism: encouraging exploration and exploitation simultaneously with Binary Decision Diagrams2006
- Finding needles in haystacks is harder with neutralityGenetic Programming and Evolvable Machines, 2006
- Evolving Binary Decision Diagrams using Implicit Neutrality2005
- Genotype-phenotype-mapping and neutral variation — A case study in Genetic Programming1994
- Jungle evaluationLecture Notes in Computer Science, 1988