Abstract
Genetic programming (GP) is an evolutionary computation paradigm for the automatic induction of syntactic expressions. In general, GP performs an evolutionary search within the space of possible program syntaxes, for the expression that best solves a given problem. The most common application domain for GP is symbolic regression, where the goal is to find the syntactic expression that best fits a given set of training data. However, canonical GP only employs a syntactic search, thus it is intrinsically unable to efficiently adjust the (implicit) parameters of a particular expression. This work studies a Lamarckian memetic GP, that incorporates a local search (LS) strategy to refine GP individuals expressed as syntax trees. In particular, a simple parametrization for GP trees is proposed, and different heuristic methods are tested to determine which individuals should be subject to a LS, tested over several benchmark and real-world problems. The experimental results provide necessary insights in this insufficiently studied aspect of GP, suggesting promising directions for future work aimed at developing new memetic GP systems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chen, X., Ong, Y.-S., Lim, M.-H., Tan, K.C.: A multi-facet survey on memetic computation. Trans. Evol. Comp. 15(5), 591–607 (2011)
Coello, C.A.C., Lamont, G.B., Veldhuizen, D.A.V.: Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation). Springer-Verlag New York, Inc., Secaucus (2006)
Coleman, T.F., Li, Y.: On the convergence of reflective Newton methods for large-scale nonlinear minimization subject to bounds (1992)
Coleman, T.F., Li, Y.: An interior trust region approach for nonlinear minimization subject to bounds. Technical report, Ithaca, NY, USA (1993)
De Jong, K.: Evolutionary Computation: A Unified Approach. Bradford Book. Mit Press (2006)
Dunn, E., Olague, G., Lutton, E.: Parisian camera placement for vision metrology. Pattern Recogn. Lett. 27(11), 1209–1219 (2006)
Eiben, A.E., Smith, J.E.: Introduction to Evolutionary Computing. Springer (2003)
Emmerich, M., Grötzner, M., Schütz, M.: Design of graph-based evolutionary algorithms: A case study for chemical process networks. Evol. Comput. 9(3), 329–354 (2001)
Eskridge, B., Hougen, D.: Imitating success: A memetic crossover operator for genetic programming. In: Proceedings of the 2004 IEEE Congress on Evolutionary Computation, June 20-23, pp. 809–815. IEEE Press, Portland (2004)
Gill, P.E., Murray, W., Wright, M.H.: Practical optimization. Academic Press Inc. (Harcourt Brace Jovanovich Publishers), London (1981)
Graff, M., Pea, R., Medina, A.: Wind speed forecasting using genetic programming. In: IEEE Congress on Evolutionary Computation, pp. 408–415. IEEE (2013)
Hornby, G.S., Lohn, J.D., Linden, D.S.: Computer-automated evolution of an x-band antenna for nasa’s space technology 5 mission. Evol. Comput. 19(1), 1–23 (2011)
Keijzer, M.: Improving symbolic regression with interval arithmetic and linear scaling. In: Ryan, C., Soule, T., Keijzer, M., Tsang, E.P.K., Poli, R., Costa, E. (eds.) EuroGP 2003. LNCS, vol. 2610, pp. 70–82. Springer, Heidelberg (2003)
Korns, M.F.: Accuracy in symbolic regression. In: Riolo, R., Vladislavleva, E., Moore, J.H. (eds.) Genetic Programming Theory and Practice IX, May 12-14. Genetic and Evolutionary Computation, ch. 8, pp. 129–151. Springer, Ann Arbor (2011)
Koza, J.: Human-competitive results produced by genetic programming. Genetic Programming and Evolvable Machines 11(3), 251–284 (2010)
Koza, J.R.: Genetic programming: on the programming of computers by means of natural selection. MIT Press, Cambridge (1992)
Lawson, C.L., Hanson, R.J.: Solving Least Squares Problems. Society for Industrial and Applied Mathematics (1995)
Lohmann, R.: Application of Evolution Strategy in Parallel Populations. In: Schwefel, H.-P., Männer, R. (eds.) PPSN 1990. LNCS, vol. 496, pp. 198–208. Springer, Heidelberg (1991)
Luke, S.: Essentials of Metaheuristics, 2nd edn. Lulu (2013), http://cs.gmu.edu/~sean/book/metaheuristics/
McConaghy, T.: FFX: Fast, scalable, deterministic symbolic regression technology. In: Riolo, R., Vladislavleva, E., Moore, J.H. (eds.) Genetic Programming Theory and Practice IX. Genetic and Evolutionary Computation, ch. 13, pp. 235–260. Springer, Ann Arbor (2011)
McDermott, J., White, D.R., Luke, S., Manzoni, L., Castelli, M., Vanneschi, L., Jaskowski, W., Krawiec, K., Harper, R., De Jong, K., O’Reilly, U.-M.: Genetic programming needs better benchmarks. In: Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation Conference, GECCO 2012, pp. 791–798. ACM, New York (2012)
Moré, J.J., Sorensen, D.C.: Computing a trust region step. SIAM J. Scientific and Statistical Computing 4, 553–572 (1983)
Olague, G., Trujillo, L.: Evolutionary-computer-assisted design of image operators that detect interest points using genetic programming. Image Vision Comput 29(7), 484–498 (2011)
Pagie, L., Hogeweg, P.: Evolutionary consequences of coevolving targets. Evolutionary Computation 5, 401–418 (1998)
Poli, R., Langdon, W.B., McPhee, N.F.: A Field Guide to Genetic Programming. Lulu Enterprises, UK Ltd. (2008)
Shultz, G., Schnabel, R., Byrd, R., Colorado Univ. at Boulder Dept of Computer Science: A Family of Trust Region Based Algorithms for Unconstrained Minimization with Strong Global Convergence Properties. Defense Technical Information Center (1982)
Silva, S., Almeida, J.: Gplab–a genetic programming toolbox for matlab. In: Gregersen, L. (ed.) Proceedings of the Nordic MATLAB Conference, pp. 273–278 (2003)
Silva, S., Costa, E.: Dynamic limits for bloat control in genetic programming and a review of past and current bloat theories. Genetic Programming and Evolvable Machines 10(2), 141–179 (2009)
Smart, W., Zhang, M.: Continuously evolving programs in genetic programming using gradient descent. In: Mckay, R.I., Cho, S.-B. (eds.) Proceedings of The Second Asian-Pacific Workshop on Genetic Programming, p. 16. Cairns, Australia (2004)
Sorensen, D.: Newton’s Method with a Model Trust Region Modification. Defense Technical Information Center (1982)
Spector, L.: Automatic Quantum Computer Programming: A Genetic Programming Approach (Genetic Programming). Springer-Verlag New York, Inc., Secaucus (2006)
Steihaug, T.: The Conjugate Gradient Method and Trust Regions in Large Scale Optimization. SIAM Journal on Numerical Analysis 20(3), 626–637 (1983)
Topchy, A., Punch, W.F.: Faster genetic programming based on local gradient search of numeric leaf values. In: Spector, L., Goodman, E.D., Wu, A., Langdon, W.B., Voigt, H.-M., Gen, M., Sen, S., Dorigo, M., Pezeshk, S., Garzon, M.H., Burke, E. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2001), July 7-11, pp. 155–162. Morgan Kaufmann (2001)
Trujillo, L., Naredo, E., Martínez, Y.: Preliminary study of bloat in genetic programming with behavior-based search. In: Emmerich, M., et al. (eds.) EVOLVE - A Bridge between Probability, Set Oriented Numerics,and Evolutionary Computation IV. AISC, vol. 227, pp. 293–305. Springer, Heidelberg (2013)
Uy, N.Q., Hoai, N.X., O’Neill, M., Mckay, R.I., Galván-López, E.: Semantically-based crossover in genetic programming: application to real-valued symbolic regression. Genetic Programming and Evolvable Machines 12(2), 91–119 (2011)
Vladislavleva, E.J., Smits, G.F., Den Hertog, D.: Order of nonlinearity as a complexity measure for models generated by symbolic regression via pareto genetic programming. Trans. Evol. Comp. 13(2), 333–349 (2009)
Wagner, S., Kronberger, G.: Algorithm and experiment design with heuristic lab: An open source optimization environment for research and education. In: Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation Conference Companion, GECCO Companion 2012, pp. 1287–1316. ACM, New York (2012)
Wang, P., Tang, K., Tsang, E.P.K., Yao, X.: A memetic genetic programming with decision tree-based local search for classification problems. In: IEEE Congress on Evolutionary Computation, pp. 917–924. IEEE (2011)
White, D.R., McDermott, J., Castelli, M., Manzoni, L., Goldman, B., Kronberger, G., Ja’skowski, W., O’Reilly, U.-M., Luke, S.: Better gp benchmarks: community survey results and proposals. Genetic Programming and Evolvable Machines 14(1), 3–29 (2013)
Worm, T., Chiu, K.: Prioritized grammar enumeration: Symbolic regression by dynamic programming. In: Proceeding of the Fifteenth Annual Conference on Genetic and Evolutionary Computation Conference, GECCO 2013, pp. 1021–1028. ACM, New York (2013)
Yuan, J.Y.: Numerical methods for generalized least squares problems. Journal of Computational and Applied Mathematics 66(1-2), 571–584 (1996)
Zhang, M., Smart, W.: Genetic programming with gradient descent search for multiclass object classification. In: Keijzer, M., O’Reilly, U.-M., Lucas, S., Costa, E., Soule, T. (eds.) EuroGP 2004. LNCS, vol. 3003, pp. 399–408. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Z-Flores, E., Trujillo, L., Schütze, O., Legrand, P. (2014). Evaluating the Effects of Local Search in Genetic Programming. In: Tantar, AA., et al. EVOLVE - A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation V. Advances in Intelligent Systems and Computing, vol 288. Springer, Cham. https://doi.org/10.1007/978-3-319-07494-8_15
Download citation
DOI: https://doi.org/10.1007/978-3-319-07494-8_15
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07493-1
Online ISBN: 978-3-319-07494-8
eBook Packages: EngineeringEngineering (R0)