Abstract
Evolutionary systems are characterized by two seemingly contradictory properties: robustness and evolvability. Robustness is generally defined as an organism’s ability to withstand genetic perturbation while maintaining its phenotype. Evolvability, as an organism’s ability to produce useful variation. In genetic programming, the relationship between the two, mediated by selection and variation-producing operators (recombination and mutation), makes it difficult to understand the behavior and evolutionary dynamics of the search process. In this paper, we show that a local gradient-based constants optimization step can improve the overall population evolvability by inducing a beneficial structure-preserving bias on selection, which in the long term helps the process maintain diversity and produce better solutions.
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
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Iba, H., Sato, T., de Garis, H.: Recombination guidance for numerical genetic programming. In: 1995 IEEE Conference on Evolutionary Computation, November 29-December 1, vol. 1, pp. 97–102. IEEE Press, Perth (1995)
Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)
Kommenda, M., Affenzeller, M., Kronberger, G., Winkler, S.: Nonlinear Least Squares Optimization of Constants in Symbolic Regression (2013)
Majeed, H., Ryan, C.: Using context-aware crossover to improve the performance of gp. In: GECCO 2006: Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation, pp. 847–854. ACM Press (2006)
McKay, B., Willis, M., Barton, G.: Using a tree structured genetic algorithm to perform symbolic regression. In: First International Conference on Genetic Algorithms in Engineering Systems: Innovations and Applications, GALESIA (Conf. Publ. No. 414), pp. 487–492 (September 1995)
Rutherford, S.L.: From genotype to phenotype: buffering mechanisms and the storage of genetic information. BioEssays 22(12), 1095–1105 (2000)
Topchy, A., Punch, W.F.: Faster genetic programming based on local gradient search of numeric leaf values. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2001), pp. 155–162. Morgan Kaufmann (2001)
de Visser, J.A.G.M., Hermisson, J., Wagner, G.P., Meyers, L.A., Bagheri-Chaichian, H., Blanchard, J.L., Chao, L., Cheverud, J.M., Elena, S.F., Fontana, W., Gibson, G., Hansen, T.F., Krakauer, D., Lewontin, R.C., Ofria, C., Rice, S.H., von Dassow, G., Wagner, A., Whitlock, M.C.: Perspective: Evolution and detection of genetic robustness. Evolution 57(9), 1959–1972 (2003)
Wagner, S.: Heuristic Optimization Software Systems - Modeling of Heuristic Optimization Algorithms in the HeuristicLab Software Environment. Ph.D. thesis, Institute for Formal Models and Verification, Johannes Kepler University, Linz, Austria (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Burlacu, B., Affenzeller, M., Kommenda, M. (2013). On the Evolutionary Behavior of Genetic Programming with Constants Optimization. In: Moreno-Díaz, R., Pichler, F., Quesada-Arencibia, A. (eds) Computer Aided Systems Theory - EUROCAST 2013. EUROCAST 2013. Lecture Notes in Computer Science, vol 8111. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-53856-8_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-53856-8_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-53855-1
Online ISBN: 978-3-642-53856-8
eBook Packages: Computer ScienceComputer Science (R0)