Abstract
Most theoretical work that studies the benefit of recombination focuses on the ability of crossover to speed up optimization time on specific search problems. In this paper, we take a slightly different perspective and investigate recombination in the context of evolving solutions that exhibit mutational robustness, i.e., they display insensitivity to small perturbations. Various models in population genetics have demonstrated that increasing the effective recombination rate promotes the evolution of robustness. We show this result also holds in the context of evolutionary computation by rigorously proving crossover promotes the evolution of robust solutions in the standard (\(\mu \) + 1) GA. Surprisingly, our results show that this effect is still present even when robust solutions are at a selective disadvantage due to lower fitness values.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Arora, S., Barak, B.: Computational Complexity: A Modern Approach, 1st edn. Cambridge University Press, New York (2009)
Doerr, B., Happ, E., Klein, C.: Crossover can provably be useful in evolutionary computation. Theor. Comput. Sci. 425, 17–33 (2012)
Gardner, A., Kalinka, A.T.: Recombination and the evolution of mutational robustness. J. Theor. Biol. 241(4), 707–715 (2006)
Janson, S.: Tail bounds for sums of geometric and exponential variables. (2014). http://www2.math.uu.se/svante/papers/sjN14.pdf
Kötzing, T., Sudholt, D., Theile, M.: How crossover helps in pseudo-Boolean optimization. In: GECCO, pp. 989–996 (2011)
Lehre, P.K., Witt, C.: General drift analysis with tail bounds. arXiv:1307.2559 [cs.NE] (2013)
Lehre, P.K., Yao, X.: Crossover can be constructive when computing unique input-output sequences. Soft Comput. 15(9), 1675–1687 (2011)
Oliveto, P.S., Witt, C.: Simplified drift analysis for proving lower bounds in evolutionary computation. Algorithmica 59(3), 369–386 (2011)
Oliveto, P.S., Witt, C.: Erratum: simplified drift analysis for proving lower bounds in evolutionary computation. arXiv:1211.7184 [cs.NE] (2012)
Sudholt, D.: Crossover is provably essential for the Ising model on trees. In: GECCO, pp. 1161–1167 (2005)
Sudholt, D.: Crossover speeds up building-block assembly. In: GECCO, pp. 689–696 (2012)
Witt, C.: Runtime analysis of the (\(\mu \) + 1) EA on simple Pseudo-Boolean functions. Evol. Comput. 14, 65–86 (2006)
Yao, X.: Evolving artificial neural networks. Proc. IEEE 87(9), 1423–1447 (1999)
Acknowledgements
The research leading to these results has received funding from the European Union Seventh Framework Programme (FP7/2007-2013) under grant agreement no. 618091 (SAGE) and the German Research Foundation (DFG) under grant agreement no. FR 2988 (TOSU).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
Friedrich, T., Kötzing, T., Sutton, A.M. (2016). On the Robustness of Evolving Populations. In: Handl, J., Hart, E., Lewis, P., López-Ibáñez, M., Ochoa, G., Paechter, B. (eds) Parallel Problem Solving from Nature – PPSN XIV. PPSN 2016. Lecture Notes in Computer Science(), vol 9921. Springer, Cham. https://doi.org/10.1007/978-3-319-45823-6_72
Download citation
DOI: https://doi.org/10.1007/978-3-319-45823-6_72
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-45822-9
Online ISBN: 978-3-319-45823-6
eBook Packages: Computer ScienceComputer Science (R0)