MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Genetic programming bloat without semantics (2000) [4 citations — 0 self]

Download:
pdf | ps
by W. B. Langdon, W. Banzhaf
Parallel Problem Solving from Nature - PPSN VI 6th International Conference, volume 1917 of LNCS
ftp://cs.ucl.ac.uk/genetic/papers/wbl_ppsn2000.ps.gz
Add To MetaCart

Abstract:

Abstract. To investigate the fundamental causes of bloat, six artificial random binary tree search spaces are presented. Fitness is given by program syntax (the genetic programming genotype). GP populations are evolved on both random problems and problems with "building blocks". These are compared to problems with explicit ineffective code (introns, junk code, inviable code). Our results suggest the entropy random walk explanation of bloat remains viable. The hard building block problem might be used in further studies, e.g. of standard subtree crossover. 1

Citations

1782 Genetic Programming: On the Programming of Computers by Means of Natural Selection Cambridge – Koza - 1992
193 Francone, Genetic Programming: An Introduction on the Automatic Evolution of Computer Programs and Its Applications. organ – Banzhaf, Nordin, et al. - 1989
164 Random Number Generators: Good Ones Are Hard to Find – Park, Miller - 1988
96 Genetic programming and emergent intelligence – Angeline - 1994
75 Code growth in genetic programming – Soule, Foster, et al. - 1996
70 The Average Height of Binary Trees and Other Simple Trees – Flajolet, Odlyzko - 1982
67 J.A.: The evolution of size and shape – Langdon, Soule, et al. - 1999
61 Size fair and homologous tree genetic programming crossovers. Genetic Programming and Evolvable Machines 1(1/2 – Langdon - 2000
59 Balancing accuracy and parsimony in genetic programming – Zhang, Mühlenbein - 1995
58 Analysis of complexity drift in genetic programming – Rosca - 1997
56 Accurate replication in genetic programming – McPhee, Miller - 1995
54 A comparative analysis of genetic programming – O’Reilly, Oppacher - 1995
50 Subtree crossover: Building block engine or macromutation – Angeline - 1997
48 Fitness causes bloat – Langdon, Poli - 1997
44 Pygmies and civil servants – Ryan - 1994
30 the Genetic Construction of Computer Programs – Recombination - 1994
29 Data structures and genetic programming – Langdon - 1996
29 Fitness causes bloat: Mutation – Langdon, Poli - 1998
27 Quadratic bloat in genetic programming – Langdon - 2000
25 Evolving computer programs without subtree crossover – Chellapilla - 1997
25 The evolution of size in variable length representations – Langdon - 1998
25 An analysis of the MAX problem in genetic programming – Langdon, Poli - 1997
23 An Investigation of Supervised Learning in Genetic Programming – Gathercole - 1998
21 Emergent phenomena in genetic programming – Altenberg - 1994
17 Evolving compact solutions in genetic programming: A case study – Blickle - 1996
13 de Garis, and Taisuke Sato. Genetic programming using a minimum description length principle – Iba, Hugo - 1994
12 Code growth, explicitly defined introns, and alternative selection schemes – Smith, Harries - 1998
11 Scaling of program tree fitness spaces – Langdon - 1999
10 Genetic programming bloat with dynamic fitness – Langdon, Poli - 1998
8 Collective adaptation: The exchange of coding segments – Haynes - 1998
5 Some considerations on the reason for bloat – Banzhaf, Langdon - 2002
2 A revised comparison of crossover and mutation in GP – Luke, Spector - 1998
1 Goldberg and Una-May O'Reilly. Where does the good stuff go, and why – David - 1998