Local Search is Underused in Genetic Programming

Leonardo Trujillo, Emigdio Z-Flores, Perla S. Juárez-Smith, Pierrick Legrand, Sara Silva, Mauro Castelli, Leonardo Vanneschi, Oliver Schütze, Luis Muñoz

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

There are two important limitations of standard tree-based genetic programming (GP). First, GP tends to evolve unnecessarily large programs, what is referred to as bloat. Second, GP uses inefficient search operators that focus on modifying program syntax. The first problem has been studied extensively, with many works proposing bloat control methods. Regarding the second problem, one approach is to use alternative search operators, for instance geometric semantic operators, to improve convergence. In this work, our goal is to experimentally show that both problems can be effectively addressed by incorporating a local search optimizer as an additional search operator. Using real-world problems, we show that this rather simple strategy can improve the convergence and performance of tree-based GP, while also reducing program size. Given these results, a question arises: Why are local search strategies so uncommon in GP? A small survey of popular GP libraries suggests to us that local search is underused in GP systems. We conclude by outlining plausible answers for this question and highlighting future work.
Original languageEnglish
Title of host publicationGenetic Programming Theory and Practice XIV
EditorsRick Riolo, Bill Worzel, Brian Goldman, Bill Tozier
PublisherSpringer
Chapter8
Pages119-137
ISBN (Electronic)978-3-319-97088-2
ISBN (Print)978-3-319-97087-5
DOIs
Publication statusPublished - 25 Oct 2018

Publication series

NameGenetic and Evolutionary Computation
ISSN (Print)1932-0167

Keywords

  • Genetic programming (GP)
  • Evolvability
  • Local search (optimization)
  • Symbolic regression
  • Numerical optimization
  • Bloat
  • NeuroEvolution of augmenting topologies

Fingerprint Dive into the research topics of 'Local Search is Underused in Genetic Programming'. Together they form a unique fingerprint.

  • Cite this

    Trujillo, L., Z-Flores, E., Juárez-Smith, P. S., Legrand, P., Silva, S., Castelli, M., ... Muñoz, L. (2018). Local Search is Underused in Genetic Programming. In R. Riolo, B. Worzel, B. Goldman, & B. Tozier (Eds.), Genetic Programming Theory and Practice XIV (pp. 119-137). [8] (Genetic and Evolutionary Computation). Springer. https://doi.org/10.1007/978-3-319-97088-2_8