Abstract
Whether neutrality has positive or negative effects on evolutionary search is a contentious topic, with reported experimental results supporting both sides of the debate. Most existing studies use performance statistics, e.g., success rate or search efficiency, to investigate if neutrality, either embedded or artificially added, can benefit an evolutionary algorithm. Here, we argue that understanding the influence of neutrality on evolutionary optimization requires an understanding of the interplay between robustness and evolvability at the genotypic and phenotypic scales. As a concrete example, we consider a simple linear genetic programming system that is amenable to exhaustive enumeration, and allows for the full characterization of these properties. We adopt statistical measurements from RNA systems to quantify robustness and evolvability at both genotypic and phenotypic levels. Using an ensemble of random walks, we demonstrate that the benefit of neutrality crucially depends upon its phenotypic distribution.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Banzhaf, W.: Genotype-phenotype mapping and neutral variation - a case study in genetic programming. In: Davidor, Y., Männer, R., Schwefel, H.-P. (eds.) PPSN 1994. LNCS, vol. 866, pp. 322–332. Springer, Heidelberg (1994)
Smith, T., Husbands, P., O’Shea, M.: Neutral networks and evolvability with complex genotype-phenotype mapping. In: Kelemen, J., Sosík, P. (eds.) ECAL 2001. LNCS (LNAI), vol. 2159, pp. 272–282. Springer, Heidelberg (2001)
Smith, T., Husbands, P., O’Shea, M.: Neutral networks in an evolutionary robotics search space. In: Proceedings of the IEEE Congress on Evolutionary Computation, pp. 136–145 (2001)
Collins, M.: Finding needles in haystacks is harder with neutrality. Genetic Programming and Evolvable Machines 7, 131–144 (2006)
Yu, T., Miller, J.F.: Through the interaction of neutral and adaptive mutations, evolutionary search finds a way. Artificial Life 12, 525–551 (2006)
Soule, T.: Resilient individuals improve evolutionary search. Artificial Life 12, 17–34 (2006)
Harvey, I., Thompson, A.: Through the labyrinth evolution finds a way: A silicon ridge. In: Proceedings of the First International Conference on Evolvable Systems: From Biology to Hardware, pp. 406–422 (1996)
Ebner, M., Shackleton, M., Shipman, R.: How neutral networks influence evolvability. Complexity 7(2), 19–33 (2002)
Galván-López, E., Poli, R.: An empirical investigation of how and why neutrality affects evolutionary search. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 1149–1156 (2006)
Wagner, A.: Neutralism and selectionism: a network-based reconciliation. Nature Reviews Genetics 9, 965–974 (2008)
Wagner, A.: Robustness and evolvability: a paradox resolved. Proceedings of the Royal Society London B 275, 91–100 (2008)
Bloom, J.D., Labthavikul, S.T., Otey, C.R., Arnold, F.H.: Protein stability promotes evolvability. Proceedings of the National Academy of the Sciences 103(15), 5869–5874 (2006)
Ferrada, E., Wagner, A.: Protein robustness promotes evolutionary innovations on large evolutionary time-scales. Proceedings of the Royal Society London B 275, 1595–1602 (2008)
Isalan, M., Lemerle, C., Michalodimitrakis, K., Horn, C., Beltrao, P., Raineri, E., Garriga-Canut, M., Serrano, L.: Evolvability and hierarchy in rewired bacterial gene networks. Nature 452, 840–846 (2008)
Draghi, J.A., Parsons, T.L., Wagner, G.P., Plotkin, J.B.: Mutational robustness can facilitate adaptation. Nature 463, 353–355 (2010)
Huynen, M.A., Stadler, P.F., Fontana, W.: Smoothness within ruggedness: The role of neutrality in adaptation. Proceedings of the National Academy of the Sciences 93, 397–401 (1996)
Newman, M., Engelhardt, R.: Effects of selective neutrality on the evolution of molecular species. Proceedings of the Royal Society London B 265, 1333–1338 (1998)
Whitacre, J., Bender, A.: Degeneracy: a design principle for achieving robustness and evolvability. Journal of Theoretical Biology 263, 143–153 (2010)
Banzhaf, W., Leier, A.: Genetic Programming Theory and Practice III. In: Genetic Programming Theory and Practice III, pp. 207–221. Springer, Heidelberg (2006)
Cowperthwaite, M.C., Economo, E.P., Harcombe, W.R., Miller, E.L., Meyers, L.A.: The ascent of the abundant: how mutational networks constrain evolution. PLoS Computational Biology 4(7), e10000110 (2008)
Newman, M.: Mixing patterns in networks. Physical Review E 67, 026126 (2003)
Noh, J.D., Rieger, H.: Random walks on complex networks. Physical Review Letters 92(11), 118701 (2004)
van Nimwegen, E., Crutchfield, J., Huynen, M.: Neutral evolution of mutational robustness. Proceedings of the National Academy of the Sciences 96, 9716–9720 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hu, T., Payne, J.L., Banzhaf, W., Moore, J.H. (2011). Robustness, Evolvability, and Accessibility in Linear Genetic Programming. In: Silva, S., Foster, J.A., Nicolau, M., Machado, P., Giacobini, M. (eds) Genetic Programming. EuroGP 2011. Lecture Notes in Computer Science, vol 6621. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20407-4_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-20407-4_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20406-7
Online ISBN: 978-3-642-20407-4
eBook Packages: Computer ScienceComputer Science (R0)