Implicitly controlling bloat in genetic programming

IEEE Transactions on Evolutionary Computation

Volumn 14, Issue 2, 2010, Pages 173-190

  Whigham, Peter A ^a   Dick, Grant ^a  

^a UNIVERSITY OF OTAGO   (New Zealand)

Author keywords

Bloat; Elitism; Genetic programming; Inbreeding; Spatially structured evolutionary algorithm

Indexed keywords

BENCH-MARK PROBLEMS; BLOAT; ELITISM; LOSS OF PERFORMANCE; POPULATION STRUCTURES; SYSTEM BEHAVIORS; TREE SIZE;

COMPUTER SIMULATION; GENETIC ALGORITHMS; STRUCTURED PROGRAMMING;

GENETIC PROGRAMMING;

EID: 77950300002     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TEVC.2009.2027314     Document Type: Article

References (72)

1. W. Tackett, "Genetic programming for feature discovery and image discrimination," in Proc. 5th Int. Conf. Genet. Algorithms, Evanston, IL: Morgan Kaufmann, 1993, pp. 303-309.
2. P. Angeline, "Genetic programming and emergent intelligence," Advances in Genetic Programming, K. Kinnear, Jr., Ed. Cambridge, MA: MIT Press, 1994, ch. 4, pp. 75-98.
3. W. Langdon, "Evolving data structures using genetic programming," in Proc. 6th Int. Conf. Genetic Algorithms, Pittsburgh, PA: Morgan Kaufmann, 1995, pp. 295-302.
4. T. Soule, J. Foster, and J. Dickinson, "Code growth in genetic programming," in Proc. 1st Annu. Conf. Genetic Programming, Stanford, CA/Cambridge, MA: Stanford University Press/MIT Press, 1996, pp. 215-223.
5. W. B. Langdon and R. Poli, "Fitness causes bloat: Mutation," in Proc. Theory Application Evolutionary Comput. (ET '97), London, U.K.: University College London, 1997, pp. 59-77.
6. W. Banzhaf and W. Langdon, "Some considerations on the reason for bloat," Genet. Programming Evolvable Mach., vol.3, no.1, pp. 81-91, 2002.
7. T. Soule and R. Heckendorn, "An analysis of the causes of code growth in genetic programming," Genet. Programming Evolvable Mach., vol.3, no.3, pp. 283-309, 2002.
8. M. Brameier and W. Banzhaf, "Neutral variations cause bloat in linear GP," in Proc. 6th Eur. Conf. Genet. Programming (EuroGP '03), Berlin/Heidelberg: Springer, 2003, pp. 286-296.
9. W. B. Langdon and R. Poli, "Fitness causes bloat," Soft Computing in Engineering Design and Manufacturing, P. K. Chawdhry, R. Roy, and R. K. Pan, Eds. Berlin: Springer-Verlag, Jul. 1997, pp. 13-22.
10. S. Luke, "Modification point depth and genome growth in genetic programming," Evol. Comput., vol.11, no.1, pp. 67-106, 2003.
11. J. Koza, Genetic Programming: On the Programming of Computers by Natural Selection. Cambridge, MA: MIT Press, 1992.
12. B.-T. Zhang and H. Mühlenbein, "Evolving optimal neural networks using genetic algorithms with Occam's razor," Complex Syst., vol.7, pp. 199-220, 1993.
13. E. D. Jong, R. Watson, and J. Pollack, "Reducing bloat and promoting diversity using multiobjective methods," in Proc. Genet. Evol. Comput. Conf. (GECCO '01), San Francisco, CA: Morgan Kaufmann, 2001, pp. 11-18.
14. M. Terrio and M. I. Heywood, "Directing crossover for reduction of bloat in GP," in Proc. IEEE Can. Conf. Electr. Comput. Eng. (IEEE CCECE 2003), Piscataway, NJ: IEEE Press, May 12-15, 2002, pp. 1111-1115.
15. S. Luke and L. Panait, "A comparison of bloat control methods for genetic programming," Evol. Comput., vol.14, no.3, pp. 309-344, 2006.
16. D. Rochat, M. Tomassini, and L. Vanneschi, "Dynamic size populations in distributed genetic programming," in Proc. 8th Eur. Conf. Genet. Programming, vol.3447. Berlin: Springer, 2005, pp. 50-61.
17. F. Fernandez, G. G. Gil, J. A. Gomez, and J. L. Guisado, "Control of bloat in genetic programming by means of the island model," in Proc. Parallel Problem Solving Nature (PPSN VIII), vol.3242. Birmingham, U.K.: Springer-Verlag, 18-22 Sep. 2004, pp. 263-271.
18. F. Fernandez, G. Galeano, and J. A. Gomez, "Comparing synchronous and asynchronous parallel and distributed GP models," in Proc. 5th Eur. Conf. Genet. Programming (EuroGP '02), vol.2278. Kinsale, Ireland: Springer-Verlag, Apr. 3-5, 2002, pp. 326-335.
19. G. Galeano, F. Fernandez, M. Tomassini, and L. Vanneschi, "Studying the influence of synchronous and asynchronous parallel GP on programs length evolution," in Proc. Evol. Comput. (CEC '02): Proc. 2002 Congr., Washington D.C.: IEEE Computer Society, pp. 1727-1732.
20. P. Whigham and G. Dick, "Fixation of neutral alleles in spatially structured populations via genetic drift: Describing the spatial structures of faster-than-panmictic configurations," in Proc. 17th Annu. Colloq. Spatial Inf. Res. Center (SIRC), Dunedin, New Zealand: Otago University Press, 2005, pp. 81-90.
21. R. Poli, "A simple but theoretically-motivated method to control bloat in genetic programming," in Proc. Genet. Programming (EuroGP '03), vol.2610. Essex: Springer-Verlag, Apr. 14-16, 2003, pp. 204-217.
22. H. Stringer and A. Wu, "Bloat is unnatural: An analysis of changes in variable chromosome length absent selection pressure," Univ. Central Florida, Tech. Rep. CS-TR-04-101, 2004.
23. H. Stringer and A. Wu, "Winnowing wheat from chaff: The chunking GA," in Proc. Genet. Evol. Comput. (GECCO '04) Part II, vol.3103. Seattle, WA: Springer-Verlag, Jun. 26-30, 2004, pp. 198-209.
24. C. Skinner, P. J. Riddle, and C. Triggs, "Mathematics prevents bloat," in Proc. 2005 IEEE Congr. Evol. Comput., vol.1. Edinburgh, U.K.: IEEE Press, Sep. 2-5, 2005, pp. 390-395.
25. W. B. Langdon, "Quadratic bloat in genetic programming," in Proc. Genet. Evol. Comput. Conf. (GECCO '00), Las Vegas, NV: Morgan Kaufmann, Jul. 10-12, 2000, pp. 451-458.
26. B.-T. Zhang and H. Mühlenbein, "Balancing accuracy and parsimony in genetic programming," Evol. Comput., vol.3, no.1, pp. 17-38, 1995.
27. S. Bleuler, M. Brack, L. Thiele, and E. Zitzler, "Multiobjective genetic programming: Reducing bloat using SPEA2," in Proc. 2001 Congr. Evol. Comput. (CEC '01), Piscataway, NJ: IEEE Press, 2001, pp. 536-543.
28. C. Ryan, "Pygmies and civil servants," Advances in Genetic Programming, K. E. Kinnear, Jr., Ed. MIT Press, 1994, ch. 11, pp. 243-263. Available: http://cognet.mit.edu/library/books/viewfiisbn=0262111888
29. M. J. Streeter, "The root causes of code growth in genetic programming," in Proc. Genet. Programming (EuroGP '03), vol.2610. Essex: Springer-Verlag, Apr. 14-16, 2003, pp. 443-454.
30. N. Wagner and Z. Michalewicz, "Genetic programming with efficient population control for financial time series prediction," in Proc. Genet. Evol. Comput. Conf. Late Breaking Papers, 2001, pp. 458-462.
31. P. Wong and M. Zhang, "Algebraic simplification of GP programs during evolution," in Proc. 8th Annu. Conf. Genet. Evol. Comput. (GECCO '06), Seattle, WA: ACM, pp. 927-934.
32. S. Silva and J. Almeida, "Dynamic maximum tree depth," in Proc. Genet. Evol. Comput. (GECCO '03), vol.2724. Chicago, IL: Springer-Verlag, 2003, pp. 1776-1787.
33. S. Silva and E. Costa, "Resource-limited genetic programming: The dynamic approach," in Proc. 2005 Conf. Genet. Evol. Comput. (GECCO '05), New York: ACM, pp. 1673-1680.
34. C. J. Kennedy and C. Giraud-Carrier, "A depth controlling strategy for strongly typed evolutionary programming," in Proc. Genet. Evol. Comput. Conf., vol.1. Orlando, FL: Morgan Kaufmann, nos. 13-17 1999, pp. 879-885.
35. S. Luke and L. Panait, "Fighting bloat with nonparametric parsimony pressure," in Proc. 7th Int. Conf. Parallel Problem Solving Nature (PPSN VII), vol.2439. Granada, Spain: Springer, Sep. 7-11, 2002, pp. 411-421.
36. R. Poli, W. B. Langdon, and N. F. McPhee, A Field Guild to Genetic Programming. Lulu.com, 2008, pp. 102-103.
37. F. Fernandez, L. Vanneschi, and M. Tomassini, "The effect of plagues in genetic programming: A study of variable-size populations," in Proc. Genet. Programming (EuroGP '03), vol.2610. Essex: Springer-Verlag, 2003, pp. 317-326.
38. D. C. Hooper, N. S. Flann, and S. R. Fuller, "Recombinative hill-climbing: A stronger search method for genetic programming," in Proc. 2nd Annu. Conf. Genet. Programming, San Francisco, CA: Morgan Kaufmann, 1997, pp. 174-179.
39. T. Soule and J. Foster, "Removal bias: A new cause of code growth in tree-based evolutionary programming," in Proc. IEEE Int. Conf. Evol. Comput. (CEC '98), Piscataway, NJ: IEEE Press, 1998, pp. 781-786.
40. R. Poli, N. F. McPhee, and L. Vanneschi, "Elitism reduces bloat in genetic programming," in Proc. 10th Annu. Conf. Genet. Evol. Comput. (GECCO '08), Atlanta, GA: ACM, Jul. 12-16, 2008, pp. 1343-1344.
41. S. Luke, "Code growth is not caused by introns," in Proc. 2000 Genet. Evol. Comput. Conf. Late Breaking Papers, Las Vegas, NV, Jul. 8, 2000, pp. 228-235.
42. N. F. McPhee and R. Poli, "A schema theory analysis of the evolution of size in genetic programming with linear representations," in Proc. Genet. Programming (EuroGP '01), Milan, Italy, Springer-Verlag, 2001, pp. 108-125.
43. R. Poli and N. F. McPhee, "Exact schema theorems for GP with one-point and standard crossover operating on linear structures and their application to the study of the evolution of size," in Proc. Genet. Programming (EuroGP '01), Springer-Verlag, 2001, pp. 126-142.
44. R. Poli and N. F. McPhee, "General schema theorem for genetic programming with subtree-swapping crossover. Part II," Evol. Comput., vol.11, no.1, pp. 169-206, 2003.
45. R. Poli and N. F. McPhee, "Covariant parsimony pressure in genetic programming," Department Comput. Electron. Syst., Univ. Essex, Tech. Rep. CES-480, 2008.
46. C. Skinner, P. Riddle, and C. Triggs, "Mathematics prevents bloat," in Proc. 2005 IEEE Congr. Evol. Comput., vol.1. 2005, pp. 390-395.
47. S. Gelly, O. Teytaud, N. Bredeche, and M. Schoenauer, "Universal consistencey and bloat in GP," Revue d'Intelligence Artificielle, vol.20, no.6, pp. 805-827, 2006.
48. W. Tackett, "Recombination, selection and the genetic construction of computer programs," Ph.D. dissertation, Dept. Elect. Eng. Syst., Univ. Southern California, Los Angeles, CA, 1994.
49. P. Nordin and W. Banzhaf, "Complexity compression and evolution," in Proc. 6th Int. Conf. Genet. Algorithms (ICGA '95), Menlo Park, CA: Morgan Kaufmann, 1995, pp. 310-317.
50. W. Langdon, T. Soule, R. Poli, and J. Foster, "The evolution of size and shape," Advances in Genetic Programming 3, Cambridge, MA: MIT Press, 1999, pp. 163-190.
51. T. Soule and J. Foster, "Code size and depth flows in genetic programming," in Proc. 2nd Annu. Conf. Genet. Programming, San Francisco, CA: Morgan Kaufmann, 1997, pp. 313-320.
52. S. Dignum and R. Poli, "Generalization of the limiting distribution of program sizes in tree-based genetic programming and analysis of its effects on bloat," in Proc. 9th Annu. Conf. Genet. Evol. Comput. (GECCO '07), vol.2. London: ACM, Jul. 7-11, 2007, pp. 1588-1595.
53. R. Poli, W. B. Langdon, and S. Dignum, "On the limiting distribution of program sizes in tree-based genetic programming," in Proc. 10th Eur. Conf. Genet. Programming, vol.4445. Valencia, Spain: Springer, Apr. 11-13, 2007, pp. 193-204.
54. J. Rosca, "A probabilistic model of size drift," Genetic Programming Theory and Practice, R. L. Riolo and B. Worzel, Eds. Boston, MA: Kluwer, 2003, ch. 8, pp. 119-136.
55. Y. Davidor, T. Yamada, and R. Nakano, "The ecological framework ii: Improving ga performance at virtually zero cost," in Proc. 5th Int. Conf. Genet. Algorithms (ICGA), San Francisco, CA: Morgan Kaufmann, 1993, pp. 171-176.
56. G. Dick and P. Whigham, "The behavior of genetic drift in a spatially-structured evolutionary algorithm," in Proc. 2005 IEEE Congr. Evol. Comput., Piscataway, NJ: IEEE Press, 2005, pp. 1855-1860.
57. P. A. Whigham and G. Dick, "Evolutionary dynamics for the spatial moran process," Genetic Programming and Evolvable Machines, Secau-cus, NJ: Springer-Verlag, vol.9, no.2, 2008, pp. 157-170.
58. M. Tomassini, Spatially Structured Evolutionary Algorithms. Berlin/Heidelberg: Springer-Verlag, 2005.
59. S. Baluja, "Structure and performance of fine-grain parallelism in genetic search," in Proc. 5th Int. Conf. Genet. Algorithms (ICGA), San Mateo, CA: Morgan Kaufmann, 1993, pp. 155-162.
60. K. A. D. Jong and J. Sarma, "On decentralizing selection algorithms," in Proc. 6th Int. Conf. Genet. Algorithms, San Francisco, CA: Morgan Kaufmann, 1995, pp. 17-23.
61. G. Folino, C. Pizzuti, and G. Spezzano, "A cellular genetic programming approach to classification," in Proc. Genet. Evol. Comput. Conf., vol.2. Orlando, FL: Morgan Kaufmann, 1999, pp. 1015-1020.
62. F. Fernandez, M. Tomassini, and L. Vanneschi, "An empirical study of multipopulation genetic programming," Genet. Program. Evolvable Mach., vol.4, no.1, Mar. 2003, pp. 21-51.
63. M. Kimura and G. Weiss, "The stepping-stone model of population structure and the decrease of genetic correlation with distance," Genetics, vol.49, 1964, pp. 561-576.
64. R. Tanese, "Distributed genetic algorithms," in Proc. 3rd Int. Conf. Genet. Algorithms (ICGA '89), San Francisco, CA: Morgan Kaufmann, Jun. 1989, pp. 434-439.
65. L. Panait and S. Luke, "Alternative bloat control methods," in Proc. Genetic Evolutionary Comput.: GECCO-2004, Part II, vol.3103. Seattle, WA: Springer-Verlag, Jun. 26-30, 2004, pp. 630-641.
66. W. D. Hillis, The Connection Machine. MIT Press, 1986.
67. R. J. Collins and D. R. Jefferson, "Selection in massively parallel genetic algorithms," in Proc. 4th Int. Conf. Genet. Algorithms (ICGA '91), San Diego, CA: Morgan Kaufmann, 1991, pp. 249-256.
68. K. De Jong and J. Sarma, "On decentralizing selection algorithms," in Proc. 6th Int. Conf. Genet. Algorithms (ICGA '95), Pittsburgh, PA: Morgan Kaufmann, 1995, pp. 17-23.
69. Q. Yu, C. Chen, and Z. Pan, "Parallel genetic algorithms on programmable graphics hardware," in Proc. 1st Int. Conf. Advances Natural Comput. (ICNC 2005), Changsha, China, Part III, vol.3612. Berlin: Springer, Aug. 27-29, 2005, pp. 1051-1059.
70. W. B. Langdon and W. Banzhaf, "A SIMD interpreter for genetic programming on GPU graphics cards," in Proc. 11th Eur. Conf. Genet. Programming (EuroGP '08), vol.4971. Naples, FL: Springer, 2008, pp. 73-85.
71. W. Banzhaf, S. Harding, W. B. Langdon, and G. Wilson, "Accelerating genetic programming through graphics processing units," Genetic Programming Theory Practice VI (Genetic and Evolutionary Computation Ser.), R. L. Riolo, T. Soule, and B. Worzel, Eds. Ann Arbor: Springer, 2008, ch. 15, pp. 229-249.
72. D. Robilliard, V. Marion-Poty, and C. Fonlupt, "Population parallel GP on the G80 GPU," in Proc. 11th Eur. Conf. Genet. Programming (EuroGP '08), vol.4971. Naples, FL: Springer, 2008, pp. 98-109.