MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Removal Bias: a New Cause of Code Growth in Tree Based Evolutionary Programming (1998) [21 citations — 4 self]

by Terence Soule ,  James A. Foster
In 1998 IEEE International Conference on Evolutionary Computation
Add To MetaCart

Abstract:

This paper presents a new cause of code growth, termed removal bias. We show that growth due to removal bias can be expected to occur whenever operations which remove and replace a variable sized section of code, e.g. crossover or subtree mutation, are used in an evolutionary paradigm. Two forms of non-destructive crossover are used to examine the causes of code growth. Results support the protective value of inviable code and removal bias as two distinct causes of code growth. Both causes of code growth are shown to exist in at least two different problems. Keywords--- Code growth, variable length representations, removal bias, parsimony I. Introduction The rapid growth of fitness neutral code in genetic programming (GP), often referred to as code growth or code bloat, is a well documented phenomenon [1], [2], [3], [4], [5]. Code growth is a serious issue because larger programs require additional memory and CPU time, often taxing available resources and limiting GP usefulness. Add...

Citations

1921 Genetic Programming I : On the Programming of Computers by Means of Natural Selection – Koza - 1992
143 The evolution of evolvability in genetic programming – Altenberg - 1994
116 Complexity compression and evolution – Nordin, Banzhaf - 1995
60 Balancing accuracy and parsimony in genetic programming – Zhang, Mühlenbein - 1995
54 Accurate Replication in Genetic Programming – McPhee, Miller - 1995
51 Fitness causes bloat – Langdon, Poli - 1997
35 Causality in Genetic Programming – Rosca, Ballard - 1995
31 Tackling the boolean even N parity problem with genetic programming and limited-error fitness,” in Genetic Programming 1997 – Gathercole, Ross - 1997
16 Hybridized crossover-based search techniques for program discovery – O’Reilly, Oppacher - 1995
8 Improving the Accuracy and Robustness of Genetic Programming through Expression Simpli cation – Hooper, Flann - 1996
8 Recombinative hill-climbing: A stronger search method for genetic programming – Hooper, Flann, et al. - 1997
4 Evolution of empirical models for metallurgical process systems – Greeff, Aldrich - 1997
2 Genetic programming and redundancy," in Genetic Algorithms within the Framework – Blickle, Thiele - 1994
2 Code growth in genetic programming," in Genetic Programming 1996 – Soule, Foster, et al. - 1996
1 Code size and depth flows in genetic programming," in Genetic Programming 1997 – Soule, Foster - 1997