Accelerating convergence in cartesian genetic programming by using a new genetic operator

Genetic programming algorithms seek to find interpretable and good solutions for problems which are difficult to solve analytically. For example, we plan to use this paradigm to develop a car accident severity prediction model for new occupant safety functions. This complex problem will suffer from the major disadvantage of genetic programming, which is its high demand for computational effort to find good solutions. A main reason for this demand is a low rate of convergence. In this paper, we introduce a new genetic operator called forking to accelerate the rate of convergence. Our idea is to interpret individuals dynamically as centers of local Gaussian distributions and allow a sampling process in these distributions when populations get too homogeneous. We demonstrate this operator by extending the Cartesian Genetic Programming algorithm and show that on our examples convergence is accelerated by over 50% on average. We finish this paper with giving hints about parameterization of the forking operator for other problems.

[1]  J. Miller.  An empirical study of the efficiency of learning boolean functions using a Cartesian Genetic Programming approach , 1999 .

[2]  Ingo Rechenberg,et al.  Evolutionsstrategie : Optimierung technischer Systeme nach Prinzipien der biologischen Evolution , 1973 .

[3]  Peter Nordin,et al.  The Effect of Extensive Use of the Mutation Operator on Generalization in Genetic Programming Using Sparse Data Sets , 1996, PPSN.

[4]  Zhenguo Tu,et al.  Corrections to “A Robust Stochastic Genetic Algorithm (StGA) for Global Numerical Optimization” , 2008, IEEE Transactions on Evolutionary Computation.

[5]  Julian Francis Miller,et al.  Cartesian genetic programming , 2000, GECCO '10.

[6]  William B. Langdon,et al.  A Many Threaded CUDA Interpreter for Genetic Programming , 2010, EuroGP.

[7]  Julian Francis Miller,et al.  Redundancy and computational efficiency in Cartesian genetic programming , 2006, IEEE Transactions on Evolutionary Computation.

[8]  John R. Koza,et al.  Genetic programming: a paradigm for genetically breeding populations of computer programs to solve problems , 1990 .

[9]  Julian Francis Miller,et al.  A new crossover technique for Cartesian genetic programming , 2007, GECCO '07.

[10]  Gregory Hornby,et al.  ALPS: the age-layered population structure for reducing the problem of premature convergence , 2006, GECCO.

[11]  Karel Slaný,et al.  Comparison of CGP and Age-Layered CGP Performance in Image Operator Evolution , 2009, EuroGP.

[12]  Hod Lipson,et al.  Distilling Free-Form Natural Laws from Experimental Data , 2009, Science.

[13]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[14]  Kenneth O. Stanley,et al.  Efficiently evolving programs through the search for novelty , 2010, GECCO '10.

[15]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[16]  Yong Lu,et al.  A robust stochastic genetic algorithm (StGA) for global numerical optimization , 2004, IEEE Transactions on Evolutionary Computation.

[17]  James Demmel,et al.  IEEE Standard for Floating-Point Arithmetic , 2008 .