The phenomenon of growth in program size in genetic
programming populations has been widely reported. In a
variety of experiments and static analysis we test the
standard protective code explanation and find it to be
incomplete. We suggest bloat is primarily due to
distribution of fitness in the space of possible
programs and because of this, in the absence of bias,
it is in general inherent in any search technique using
a variable length representation.
We investigate the fitness landscape produced by
program tree-based genetic operators when acting upon
points in the search space. We show bloat in common
operators is primarily due to the exponential shape of
the underlying search space. Nevertheless we
demonstrate new operators with considerably reduced
bloating characteristics. We also describe mechanisms
whereby bloat arises and relate these back to the shape
of the search space. Finally we show our simple random
walk entropy increasing model is able to predict the
shape of evolved programs.
%0 Book Section
%1 langdon:1999:aigp3
%A Langdon, William B.
%A Soule, Terry
%A Poli, Riccardo
%A Foster, James A.
%B Advances in Genetic Programming 3
%C Cambridge, MA, USA
%D 1999
%E Spector, Lee
%E Langdon, William B.
%E O'Reilly, Una-May
%E Angeline, Peter J.
%I MIT Press
%K algorithms, bloat genetic programming,
%P 163--190
%T The Evolution of Size and Shape
%U http://www.cs.bham.ac.uk/~wbl/aigp3/ch08.ps.gz
%X The phenomenon of growth in program size in genetic
programming populations has been widely reported. In a
variety of experiments and static analysis we test the
standard protective code explanation and find it to be
incomplete. We suggest bloat is primarily due to
distribution of fitness in the space of possible
programs and because of this, in the absence of bias,
it is in general inherent in any search technique using
a variable length representation.
We investigate the fitness landscape produced by
program tree-based genetic operators when acting upon
points in the search space. We show bloat in common
operators is primarily due to the exponential shape of
the underlying search space. Nevertheless we
demonstrate new operators with considerably reduced
bloating characteristics. We also describe mechanisms
whereby bloat arises and relate these back to the shape
of the search space. Finally we show our simple random
walk entropy increasing model is able to predict the
shape of evolved programs.
%& 8
%@ 0-262-19423-6
@incollection{langdon:1999:aigp3,
abstract = {The phenomenon of growth in program size in genetic
programming populations has been widely reported. In a
variety of experiments and static analysis we test the
standard protective code explanation and find it to be
incomplete. We suggest bloat is primarily due to
distribution of fitness in the space of possible
programs and because of this, in the absence of bias,
it is in general inherent in any search technique using
a variable length representation.
We investigate the fitness landscape produced by
program tree-based genetic operators when acting upon
points in the search space. We show bloat in common
operators is primarily due to the exponential shape of
the underlying search space. Nevertheless we
demonstrate new operators with considerably reduced
bloating characteristics. We also describe mechanisms
whereby bloat arises and relate these back to the shape
of the search space. Finally we show our simple random
walk entropy increasing model is able to predict the
shape of evolved programs.},
added-at = {2008-06-19T17:35:00.000+0200},
address = {Cambridge, MA, USA},
author = {Langdon, William B. and Soule, Terry and Poli, Riccardo and Foster, James A.},
biburl = {https://www.bibsonomy.org/bibtex/2b76b4098d9faa093128b6610a31cd42b/brazovayeye},
booktitle = {Advances in Genetic Programming 3},
chapter = 8,
editor = {Spector, Lee and Langdon, William B. and O'Reilly, Una-May and Angeline, Peter J.},
interhash = {2d59fac12f6acbf9565db73b67a3d814},
intrahash = {b76b4098d9faa093128b6610a31cd42b},
isbn = {0-262-19423-6},
keywords = {algorithms, bloat genetic programming,},
month = {June},
notes = {AiGP3},
pages = {163--190},
publisher = {MIT Press},
size = {28 pages},
timestamp = {2008-06-19T17:44:52.000+0200},
title = {The Evolution of Size and Shape},
url = {http://www.cs.bham.ac.uk/~wbl/aigp3/ch08.ps.gz},
year = 1999
}