Abstract
For many years now it has been known that Cartesian Genetic Programming (CGP) does not exhibit program bloat. Two possible explanations have been proposed in the literature: neutral genetic drift and length bias. This paper empirically disproves both of these and thus, reopens the question as to why CGP does not suffer from bloat. It has also been shown for CGP that using a very large number of nodes considerably increases the effectiveness of the search. This paper also proposes a new explanation as to why this may be the case.
Cite
CITATION STYLE
Turner, A. J., & Miller, J. F. (2014). Cartesian genetic programming: Why no bloat? In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8599, pp. 222–233). Springer Verlag. https://doi.org/10.1007/978-3-662-44303-3_19
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
