Abstract
Most theoretical models of evolutionary algorithms are difficult to apply to realistic situations. In this paper, two models of evolutionary program-induction algorithms (EPAs) are proposed which overcome this limitation. We test our approach with two important classes of problems — symbolic regression and Boolean function induction — and a variety of EPAs including: different versions of genetic programming, gene expression programing, stochastic iterated hill climbing in program space and one version of cartesian genetic programming. We compare the proposed models against a practical model of EPAs we previously developed and find that in most cases the new models are simpler and produce better predictions. A great deal can also be learnt about an EPA via a simple inspection of our new models. E.g., it is possible to infer which characteristics make a problem difficult or easy for the EPA.
Keywords
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
Akers Jr., S.B.: On a theory of boolean functions. Journal of the Society for Industrial and Applied Mathematics 7(4), 487–498 (1959)
Borenstein, Y., Poli, R.: Information landscapes. In: Beyer, H.-G., O’Reilly, U.-M. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2005), Washington DC, USA, pp. 1515–1522. ACM, New York (2005)
Ferreira, C.: Gene expression programming: A new adaptive algorithm for solving problems. Complex Systems 13(2), 87–129 (2001)
Franco, L.: Generalization ability of boolean functions implemented in feedforward neural networks. Neurocomputing 70, 351–361 (2006)
Graff, M., Poli, R.: Automatic creation of taxonomies of genetic programming systems. In: Vanneschi, L., Gustafson, S., Moraglio, A., De Falco, I., Ebner, M. (eds.) EuroGP 2009. LNCS, vol. 5481, pp. 145–158. Springer, Heidelberg (2009)
Graff, M., Poli, R.: Practical performance models of algorithms in evolutionary program induction and other domains. Artif. Intell. 174(15), 1254–1276 (2010)
Graff, M., Poli, R.: Practical model of genetic programming’s performance on rational symbolic regression problems. In: O’Neill, M., Vanneschi, L., Gustafson, S., Esparcia Alcázar, A.I., De Falco, I., Della Cioppa, A., Tarantino, E. (eds.) EuroGP 2008. LNCS, vol. 4971, pp. 122–132. Springer, Heidelberg (2008)
Hutter, F., Hamadi, Y., Hoos, H.H., Leyton-Brown, K.: Performance prediction and automated tuning of randomized and parametric algorithms. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 213–228. Springer, Heidelberg (2006)
Jones, T., Forrest, S.: Fitness distance correlation as a measure of problem difficulty for genetic algorithms. In: Eshelman, L.J. (ed.) ICGA, pp. 184–192. Morgan Kaufmann, San Francisco (1995)
Koza, J.R.: Genetic Programming: On the Programming of Computers by Natural Selection. MIT Press, Cambridge (1992)
Langdon, W.B., Poli, R.: Foundations of Genetic Programming. Springer, Heidelberg (2002)
Miller, J.F., Thomson, P.: Cartesian genetic programming. In: Poli, R., Banzhaf, W., Langdon, W.B., Miller, J., Nordin, P., Fogarty, T.C. (eds.) EuroGP 2000. LNCS, vol. 1802, pp. 121–132. Springer, Heidelberg (2000)
Olver, P.J., Shakiban, C.: Applied Linear Algebra. Prentice-Hall, Englewood Cliffs (2006)
O’Neill, M., Ryan, C.: Grammatical evolution. IEEE Transactions on Evolutionary Computation 5(4), 349–358 (2001)
O’Reilly, U.-M., Oppacher, F.: Program search with a hierarchical variable length representation: Genetic programming, simulated annealing and hill climbing. In: Davidor, Y., Männer, R., Schwefel, H.-P. (eds.) PPSN 1994. LNCS, vol. 866, pp. 397–406. Springer, Heidelberg (1994)
Poli, R., Langdon, W.B., McPhee, N.F.: A field guide to genetic programming (2008), Published via http://lulu.com and freely available at http://www.gp-field-guide.org.uk (With contributions by J. R. Koza)
Poli, R., McPhee, N.F.: General schema theory for genetic programming with subtree-swapping crossover: II. Evolutionary Computation 11(2), 169–206 (2003)
Rice, J.R.: The algorithm selection problem. Advances in Computers 15, 65–118 (1976)
Tomassini, M., Vanneschi, L., Collard, P., Clergue, M.: A study of fitness distance correlation as a difficulty measure in genetic programming. Evolutionary Computation 13(2), 213–239 (Summer 2005)
Vanneschi, L., Clergue, M., Collard, P., Tomassini, M., Vérel, S.: Fitness clouds and problem hardness in genetic programming. In: Deb, K., et al. (eds.) GECCO 2004. LNCS, vol. 3103, pp. 690–701. Springer, Heidelberg (2004)
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
Graff, M., Poli, R. (2011). Performance Models for Evolutionary Program Induction Algorithms Based on Problem Difficulty Indicators. 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_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-20407-4_11
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)