The Root Causes of Code Growth in Genetic Programming

Created by W.Langdon from gp-bibliography.bib Revision:1.4420

  author =       "Matthew J. Streeter",
  title =        "The Root Causes of Code Growth in Genetic
  booktitle =    "Genetic Programming, Proceedings of EuroGP'2003",
  year =         "2003",
  editor =       "Conor Ryan and Terence Soule and Maarten Keijzer and 
                 Edward Tsang and Riccardo Poli and Ernesto Costa",
  volume =       "2610",
  series =       "LNCS",
  pages =        "443--454",
  address =      "Essex",
  publisher_address = "Berlin",
  month =        "14-16 " # apr,
  organisation = "EvoNet",
  publisher =    "Springer-Verlag",
  keywords =     "genetic algorithms, genetic programming: Poster",
  ISBN =         "3-540-00971-X",
  URL =          "",
  URL =          "",
  DOI =          "doi:10.1007/3-540-36599-0_42",
  abstract =     "This paper discusses the underlying pressures
                 responsible for code growth in genetic programming, and
                 shows how an understanding of these pressures can be
                 used to use to eliminate code growth while
                 simultaneously improving performance. We begin with a
                 discussion of two distinct components of code growth
                 and the extent to which each component is relevant in
                 practice. We then define the concept of resilience in
                 GP trees, and show that the buildup of resilience is
                 essential for code growth. We present simple
                 modifications to the selection procedures used by GP
                 that eliminate bloat without hurting performance.
                 Finally, we show that eliminating bloat can improve the
                 performance of genetic programming by a factor that
                 increases as the problem is scaled in difficulty.",
  notes =        "EuroGP'2003 held in conjunction with EvoWorkshops

Genetic Programming entries for Matthew J Streeter