- author = "Alden H. Wright and Cheyenne L. Laue",
- title = "Evolvability and Complexity Properties of the Digital Circuit Genotype-Phenotype Map",
- booktitle = "Proceedings of the 2021 Genetic and Evolutionary Computation Conference",
- year = "2021",
- editor = "Francisco Chicano and Alberto Tonda and Krzysztof Krawiec and Marde Helbig and Christopher W. Cleghorn and Dennis G. Wilson and Georgios Yannakakis and Luis Paquete and Gabriela Ochoa and Jaume Bacardit and Christian Gagne and Sanaz Mostaghim and Laetitia Jourdan and Oliver Schuetze and Petr Posik and Carlos Segura and Renato Tinos and Carlos Cotta and Malcolm Heywood and Mengjie Zhang and Leonardo Trujillo and Risto Miikkulainen and Bing Xue and Aneta Neumann and Richard Allmendinger and Fuyuki Ishikawa and Inmaculada Medina-Bulo and Frank Neumann and Andrew M. Sutton",
- pages = "840--848",
- address = "internet",
- series = "GECCO '21",
- month = jul # " 10-14",
- organisation = "SIGEVO",
- publisher = "Association for Computing Machinery",
- publisher_address = "New York, NY, USA",
- keywords = "genetic algorithms, genetic programming, Cartesian genetic programming, Arficial Intelligence, Search methodologies, Boolean functions, Discrete space search, Randomized search, Genotype-phenotype mapping, robustness, evolvability, complexity, neutrality, redundancy, epochal algorithm, G-P map",
- isbn13 = "9781450383509",
-
DOI = "
doi:10.1145/3449639.3459393",
-
video_url = "
https://www.youtube.com/watch?v=9kNdkkBiVNc",
- size = "9 pages",
- abstract = "Recent research on genotype-phenotype (G-P) maps in natural evolution has contributed significantly to our understanding of neutrality, redundancy, robustness, and evolvability. we investigate the properties of the digital logic gate G-P map and show that this map shares many of the common properties of natural G-P maps, with the exception of a positive relationship between evolvability and robustness. Our results show that in some cases robustness and evolvability may be negatively related as a result of the method used to approximate evolvability. We give two definitions of circuit complexity and empirically show that these two definitions are closely related. This study leads to a better understanding of the relationships between redundancy, robustness, and evolvability in genotype-phenotype maps. We further investigate these results in the context of complexity and show the relationships between phenotypic complexity and phenotypic redundancy, robustness and evolvability",
-
notes = "p840 'robustness of a genotype (circuit) is the
fraction of mutations that are neutral'
p841 'The evolvability of a genotype is defined as the number of unique phenotypes obtained by all possible (node type or node connection) mutations of the genotype.'
logarithmic scaling.
Video 3:15 for our parameter settings phenotype networks are almost always connected. Neutral evolution. 9:36 _negative_ relationship between phenotype evolution evolvability and robustness (opposite to claim in biology). 10:06 Evolvability versus complexity. Circuit phenotypic complexity is Kolmogorov complexity (bits). 12:00 Arrow of complexity: increasing _maximum_ (not average) complexity is a property of evolution.
University of Montana, Missoula, MT, USA
GECCO-2021 A Recombination of the 30th International Conference on Genetic Algorithms (ICGA) and the 26th Annual Genetic Programming Conference (GP)",
