A probabilistic linear genetic programming with stochastic context-free grammar for solving symbolic regression problems

Traditional Linear Genetic Programming algorithms are based only on the selection mechanism to guide the search. Genetic operators combine or mutate random portions of the individuals, without knowing if the result will lead to a fitter individual. Probabilistic Model Building Genetic Programming was proposed to overcome this issue through a probability model that captures the structure of the fit individuals and use it to sample new individuals. This work proposes the use of LGP with a Stochastic Context-Free Grammar, that has a probability distribution that is updated according to selected individuals. We proposed a method for adapting the grammar into the linear representation of LGP. Tests performed with the proposed probabilistic method, and with two hybrid approaches, on several symbolic regression benchmark problems show that the results are statistically better than the obtained by the traditional LGP.

[1]  Martin Pelikan,et al.  An introduction and survey of estimation of distribution algorithms , 2011, Swarm Evol. Comput..

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

[3]  Riccardo Poli,et al.  A Linear Estimation-of-Distribution GP System , 2008, EuroGP.

[4]  Thomas Bäck,et al.  Evolutionary algorithms in theory and practice - evolution strategies, evolutionary programming, genetic algorithms , 1996 .

[5]  Michael F. Korns.  Accuracy in Symbolic Regression , 2011 .

[6]  Michael O'Neill,et al.  Genetic Programming and Evolvable Machines Manuscript No. Semantically-based Crossover in Genetic Programming: Application to Real-valued Symbolic Regression , 2022 .

[7]  Hussein A. Abbass,et al.  Program Evolution with Explicit Learning: a New Framework for Program Automatic Synthesis , 2003 .

[8]  Peter A. N. Bosman,et al.  Grammar Transformations in an EDA for Genetic Programming , 2004 .

[9]  Ivan Tanev,et al.  Incorporating Learning Probabilistic Context-Sensitive Grammar in Genetic Programming for Efficient Evolution and Adaptation of Snakebot , 2005, EuroGP.

[10]  Nguyen Xuan Hoai,et al.  Probabilistic model building in genetic programming: a critical review , 2013, Genetic Programming and Evolvable Machines.

[11]  Wolfgang Banzhaf,et al.  Effective Linear Genetic Programming , 2001 .

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

[13]  Malcolm I. Heywood,et al.  Probabilistic Adaptive Mapping Developmental Genetic Programming (PAM DGP): A New Developmental Approach , 2006, PPSN.

[14]  Maarten Keijzer,et al.  Improving Symbolic Regression with Interval Arithmetic and Linear Scaling , 2003, EuroGP.

[15]  H. Iba,et al.  Estimation of distribution programming based on Bayesian network , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[16]  D. Goldberg,et al.  Probabilistic Model Building and Competent Genetic Programming , 2003 .

[17]  Hitoshi Iba,et al.  Program Evolution by Integrating EDP and GP , 2004, GECCO.

[18]  Victor Ciesielski,et al.  Linear genetic programming , 2008, Genetic Programming and Evolvable Machines.

[19]  Hussein A. Abbass,et al.  Grammar model-based program evolution , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[20]  Dan Boneh,et al.  On genetic algorithms , 1995, COLT '95.

[21]  Kwong-Sak Leung,et al.  Grammar-Based Genetic Programming with Bayesian network , 2014, 2014 IEEE Congress on Evolutionary Computation (CEC).

[22]  Goldberg,et al.  Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.

[23]  Kwong-Sak Leung,et al.  Grammar-based genetic programming with dependence learning and bayesian network classifier , 2014, GECCO.

[24]  Hussein A. Abbass,et al.  Program evolution with explicit learning , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

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

[26]  Ivan Tanev,et al.  Implications of Incorporating Learning Probabilistic Context-sensitive Grammar in Genetic Programming on Evolvability of Adaptive Locomotion Gaits of Snakebot , 2004 .