%0 Conference Paper %1 langdon:2000:quad %A Langdon, W. B. %B Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2000) %C Las Vegas, Nevada, USA %D 2000 %E Whitley, Darrell %E Goldberg, David %E Cantu-Paz, Erick %E Spector, Lee %E Parmee, Ian %E Beyer, Hans-Georg %I Morgan Kaufmann %K algorithms, binary bloat, code, depth evolution genetic growth, ineffective introns, length linear of programming, search shape, spaces subquadratic tree %P 451--458 %T Quadratic Bloat in Genetic Programming %U http://citeseer.ist.psu.edu/316810.html %X In earlier work we predicted program size would grow in the limit at a quadratic rate and up to fifty generations we measured bloat O(generations**(1.2-1.5)). On two simple benchmarks we test the prediction of bloat O(generations**2.0) up to generation 600. In continuous problems the limit of quadratic growth is reached but convergence in the discrete case limits growth in size. Measurements indicate subtree crossover ceases to be disruptive with large programs (1,000,000) and the population effectively converges (even though variety is near unity). Depending upon implementation, we predict run time O(number of generations**(2.0-3.0)) and memory O(number of generations**(1.0-2.0)). %@ 1-55860-708-0

@inproceedings{langdon:2000:quad, abstract = {In earlier work we predicted program size would grow in the limit at a quadratic rate and up to fifty generations we measured bloat O(generations**(1.2-1.5)). On two simple benchmarks we test the prediction of bloat O(generations**2.0) up to generation 600. In continuous problems the limit of quadratic growth is reached but convergence in the discrete case limits growth in size. Measurements indicate subtree crossover ceases to be disruptive with large programs (1,000,000) and the population effectively converges (even though variety is near unity). Depending upon implementation, we predict run time O(number of generations**(2.0-3.0)) and memory O(number of generations**(1.0-2.0)).}, added-at = {2008-06-19T17:35:00.000+0200}, address = {Las Vegas, Nevada, USA}, author = {Langdon, W. B.}, biburl = {https://www.bibsonomy.org/bibtex/2a7050a617aaccd357f8dc6afc46761a4/brazovayeye}, booktitle = {Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2000)}, editor = {Whitley, Darrell and Goldberg, David and Cantu-Paz, Erick and Spector, Lee and Parmee, Ian and Beyer, Hans-Georg}, interhash = {04aa1c40e107919c12ca81945afe7487}, intrahash = {a7050a617aaccd357f8dc6afc46761a4}, isbn = {1-55860-708-0}, keywords = {algorithms, binary bloat, code, depth evolution genetic growth, ineffective introns, length linear of programming, search shape, spaces subquadratic tree}, month = {10-12 July}, notes = {A joint meeting of the ninth International Conference on Genetic Algorithms (ICGA-2000) and the fifth Annual Genetic Programming Conference (GP-2000) Part of \cite{whitley:2000:GECCO}}, pages = {451--458}, publisher = {Morgan Kaufmann}, publisher_address = {San Francisco, CA 94104, USA}, size = {8 pages}, timestamp = {2008-06-19T17:44:58.000+0200}, title = {Quadratic Bloat in Genetic Programming}, url = {http://citeseer.ist.psu.edu/316810.html}, year = 2000 }