Diversity in genetic programming: an analysis of measures and correlation with fitness

Examines measures of diversity in genetic programming. The goal is to understand the importance of such measures and their relationship with fitness. Diversity methods and measures from the literature are surveyed and a selected set of measures are applied to common standard problem instances in an experimental study. Results show the varying definitions and behaviors of diversity and the varying correlation between diversity and fitness during different stages of the evolutionary process. Populations in the genetic programming algorithm are shown to become structurally similar while maintaining a high amount of behavioral differences. Conclusions describe what measures are likely to be important for understanding and improving the search process and why diversity might have different meaning for different problem domains.

[1]  W. Martin,et al.  Population Structures C 6 . 3 Island ( migration ) models : evolutionary algorithms based on punctuated equilibria , 1997 .

[2]  Graham Kendall,et al.  A Survey And Analysis Of Diversity Measures In Genetic Programming , 2002, GECCO.

[3]  Jason M. Daida,et al.  Analysis of single-node (building) blocks in genetic programming , 1999 .

[4]  Larry J. Eshelman,et al.  Crossover's Niche , 1993, ICGA.

[5]  Robert I. McKay,et al.  Fitness Sharing in Genetic Programming , 2000, GECCO.

[6]  Walter Alden Tackett,et al.  Recombination, selection, and the genetic construction of computer programs , 1994 .

[7]  Anikó Ekárt,et al.  A Metric for Genetic Programs and Fitness Sharing , 2000, EuroGP.

[8]  Justinian P. Rosca,et al.  Genetic Programming Exploratory Power and the Discovery of Functions , 1995, Evolutionary Programming.

[9]  Rasmus K. Ursem,et al.  Diversity-Guided Evolutionary Algorithms , 2002, PPSN.

[10]  Riccardo Poli,et al.  Foundations of Genetic Programming , 1999, Springer Berlin Heidelberg.

[11]  Xin Yao,et al.  Why more choices cause less cooperation in iterated prisoner's dilemma , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[12]  Una-May O’Reilly.  Using a distance metric on genetic programs to understand genetic operators , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[13]  Patrick Siarry,et al.  Island Model Cooperating with Speciation for Multimodal Optimization , 2000, PPSN.

[14]  Robert G. Reynolds,et al.  Genetic Programming Exploratory Power and the Discovery of Functions , 1995 .

[15]  Terence Soule,et al.  An Analysis of the Causes of Code Growth in Genetic Programming , 2002, Genetic Programming and Evolvable Machines.

[16]  Hussein A. Abbass,et al.  Anticorrelation: A Diversity Promoting Mechanisms in Ensemble Learning , 2001 .

[17]  Takuji Nishimura,et al.  Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator , 1998, TOMC.

[18]  Janet Wiles,et al.  Diversity maintenance on neutral landscapes: an argument for recombination , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[19]  William B. Langdon.  Data structures and genetic programming , 1995 .

[20]  R. Collins.  Studies in artificial evolution , 1992 .

[21]  John R. Koza,et al.  Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.

[22]  James Jaccard,et al.  Statistics for the Behavioral Sciences , 1983 .

[23]  Patrik D'haeseleer,et al.  Effects of locality in individual and population evolution , 1994 .

[24]  Kalyanmoy Deb,et al.  An Investigation of Niche and Species Formation in Genetic Function Optimization , 1989, ICGA.

[25]  David E. Goldberg,et al.  Genetic Algorithms with Sharing for Multimodalfunction Optimization , 1987, ICGA.

[26]  Edwin D. de Jong,et al.  Reducing bloat and promoting diversity using multi-objective methods , 2001 .

[27]  Wolfgang Banzhaf,et al.  Explicit Control of Diversity and Effective Variation Distance in Linear Genetic Programming , 2002, EuroGP.

[28]  K. Chellapilla,et al.  Investigating the influence of depth and degree of genotypic change on fitness in genetic programming , 1999 .

[29]  Riccardo Poli,et al.  On the Search Properties of Different Crossover Operators in Genetic Programming , 2001 .

[30]  James P. Cohoon,et al.  C6.3 Island (migration) models: evolutionary algorithms based on punctuated equilibria , 1997 .

[31]  Maarten Keijzer,et al.  Efficiently representing populations in genetic programming , 1996 .

[32]  C. Fernandes,et al.  A study on non-random mating and varying population size in genetic algorithms using a royal road function , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[33]  P. Ross,et al.  An adverse interaction between crossover and restricted tree depth in genetic programming , 1996 .

[34]  S. Luke.  When short runs beat long runs , 2001 .

[35]  Peter J. Angeline,et al.  Efficiently Representing Populations in Genetic Programming , 1996 .

[36]  K. Dejong,et al.  An analysis of the behavior of a class of genetic adaptive systems , 1975 .

[37]  Lee Spector,et al.  A Revised Comparison of Crossover and Mutation in Genetic Programming , 1998 .

[38]  Shan-Hwei Nienhuys-Cheng,et al.  Distance Between Herbrand Interpretations: A Measure for Approximations to a Target Concept , 1997, ILP.

[39]  Alan S. Perelson,et al.  Searching for Diverse, Cooperative Populations with Genetic Algorithms , 1993, Evolutionary Computation.

[40]  Terence Soule,et al.  Effects of Code Growth and Parsimony Pressure on Populations in Genetic Programming , 1998, Evolutionary Computation.

[41]  Graham Kendall,et al.  Advanced Population Diversity Measures in Genetic Programming , 2002, PPSN.

[42]  E. Keller,et al.  Explicit maintenance of genetic diversity on genospacesRobert , 1994 .

[43]  Jason M. Daida,et al.  What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming , 1999, Genetic Programming and Evolvable Machines.

[44]  Xin Yao,et al.  Does extra genetic diversity maintain escalation in a co-evolutionary arms race , 2000 .

[45]  Tommaso F. Bersano-Begey,et al.  Controlling Exploration , Diversity and Escaping Local Optima in GP : Adapting Weights of Training Sets to Model Resource Consumption , 1997 .

[46]  N. Hopper,et al.  Analysis of genetic diversity through population history , 1999 .

[47]  Jano I. van Hemert,et al.  Adaptive Genetic Programming Applied to New and Existing Simple Regression Problems , 2001, EuroGP.

[48]  Anikó Ekárt,et al.  Maintaining the Diversity of Genetic Programs , 2002, EuroGP.

[49]  S. Siegel,et al.  Nonparametric Statistics for the Behavioral Sciences , 2022, The SAGE Encyclopedia of Research Design.

[50]  Xin Yao,et al.  Evolutionary ensembles with negative correlation learning , 2000, IEEE Trans. Evol. Comput..

[51]  Jano van Hemert,et al.  SAW-ing EAs: adapting the fitness function for solving constrained problems , 1999 .

[52]  Conor Ryan,et al.  Pygmies and civil servants , 1994 .

[53]  J A Foster,et al.  Effects of code growth and parsimony pressure on populations in genetic programming. , 1998, Evolutionary computation.

[54]  Hussein A. Abbass.  Anti-correlation Measures in Genetic Programming , 2001 .