Probabilistic Model Building and Competent Genetic Programming

This paper describes probabilistic model building genetic programming (PM-BGP) developed based on the extended compact genetic algorithm (eCGA). Unlike traditional genetic programming, which use fixed recombination operators, the proposed PMBGA adapts linkages. The proposed algorithms, called the extended compact genetic programming (eCGP) adaptively identifies and exchanges non-overlapping building blocks by constructing and sampling probabilistic models of promising solutions. The results show that eCGP scales-up polynomially with the problem size (the number of functionals and terminals) on both GP-easy problem and boundedly difficult GP-hard problem.

[1]  D. E. Goldberg,et al.  Simple Genetic Algorithms and the Minimal, Deceptive Problem , 1987 .

[2]  Lawrence Davis,et al.  Genetic Algorithms and Simulated Annealing , 1987 .

[3]  Kalyanmoy Deb,et al.  Messy Genetic Algorithms: Motivation, Analysis, and First Results , 1989, Complex Syst..

[4]  Kalyanmoy Deb,et al.  Genetic Algorithms, Noise, and the Sizing of Populations , 1992, Complex Syst..

[5]  Kalyanmoy Deb,et al.  Analyzing Deception in Trap Functions , 1992, FOGA.

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

[7]  Kalyanmoy Deb,et al.  RapidAccurate Optimization of Difficult Problems Using Fast Messy Genetic Algorithms , 1993, ICGA.

[8]  Dirk Thierens,et al.  Mixing in Genetic Algorithms , 1993, ICGA.

[9]  Shumeet Baluja,et al.  A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning , 1994 .

[10]  J. K. Kinnear,et al.  Advances in Genetic Programming , 1994 .

[11]  David E. Goldberg,et al.  Learning Linkage , 1996, FOGA.

[12]  Hillol Kargupta,et al.  The Gene Expression Messy Genetic Algorithm , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[13]  Corso Elvezia.  Probabilistic Incremental Program Evolution , 1997 .

[14]  Rafal Salustowicz,et al.  Probabilistic Incremental Program Evolution , 1997, Evolutionary Computation.

[15]  G. Harik.  Learning gene linkage to efficiently solve problems of bounded difficulty using genetic algorithms , 1997 .

[16]  David E. Goldberg,et al.  The Race, the Hurdle, and the Sweet Spot , 1998 .

[17]  Rajkumar Roy,et al.  Advances in Soft Computing: Engineering Design and Manufacturing , 1998 .

[18]  D. Goldberg.  How Fitness Structure Affects Subsolution Acquisition in Genetic Programming , 1998 .

[19]  David E. Goldberg,et al.  Where Does the Good Stuff Go, and Why? How Contextual Semantics Influences Program Structure in Simple Genetic Programming , 1998, EuroGP.

[20]  Dirk Thierens,et al.  Linkage Information Processing In Distribution Estimation Algorithms , 1999, GECCO.

[21]  David E. Goldberg,et al.  Linkage Identification by Non-monotonicity Detection for Overlapping Functions , 1999, Evolutionary Computation.

[22]  David E. Goldberg,et al.  The compact genetic algorithm , 1999, IEEE Trans. Evol. Comput..

[23]  Peter J. Bentley,et al.  Evolutionary Design By Computers , 1999 .

[24]  M. Pelikán,et al.  The Bivariate Marginal Distribution Algorithm , 1999 .

[25]  Dirk Thierens,et al.  Scalability Problems of Simple Genetic Algorithms , 1999, Evolutionary Computation.

[26]  G. Harik.  Linkage Learning via Probabilistic Modeling in the ECGA , 1999 .

[27]  David E. Goldberg,et al.  Linkage Problem, Distribution Estimation, and Bayesian Networks , 2000, Evolutionary Computation.

[28]  David E. Goldberg,et al.  Bayesian optimization algorithm, decision graphs, and Occam's razor , 2001 .

[29]  D. Goldberg,et al.  Escaping hierarchical traps with competent genetic algorithms , 2001 .

[30]  David E. Goldberg,et al.  Scalability of the Bayesian optimization algorithm , 2002, Int. J. Approx. Reason..

[31]  David E. Goldberg,et al.  Introducing Start Expression Genes to the Linkage Learning Genetic Algorithm , 2002, PPSN.

[32]  David E. Goldberg,et al.  Bayesian Optimization Algorithm: From Single Level to Hierarchy , 2002 .

[33]  David E. Goldberg,et al.  The Design of Innovation: Lessons from and for Competent Genetic Algorithms , 2002 .

[34]  David E. Goldberg,et al.  A Survey of Optimization by Building and Using Probabilistic Models , 2002, Comput. Optim. Appl..

[35]  David E. Goldberg,et al.  Scalability of Selectorecombinative Genetic Algorithms for Problems with Tight Linkage , 2003, GECCO.

[36]  David E. Goldberg,et al.  BUILDING-BLOCK SUPPLY IN GENETIC PROGRAMMING , 2003 .

[37]  Kalyanmoy Deb,et al.  Sufficient conditions for deceptive and easy binary functions , 1994, Annals of Mathematics and Artificial Intelligence.