Comparison of the Effectiveness of Decimation and Automatically Defined Functions

Decimation and automatically defined functions are intended to improve the fitness of the generated programs and to increase the rate of convergence to the solution. Each method has an associated computational cost, the cost for automatically defined functions being considerably higher than for decimation. This paper compares the performance improvements in genetic programming provided by automatically defined functions with that of decimation on four common benchmark problems – the Santa Fe ant, the lawnmower, even 3-bit parity and a symbolic regression problem. The results indicate that decimation provides improvement in performance that justifies the additional computation but the added computational effort required for automatically defined functions is not justified by any performance improvements.

[1]  Huebner,et al.  Proceedings of the First Annual Conference of the Wharton School of Finance and Commerce , 2022 .

[2]  Lawrence J. Fogel,et al.  Artificial Intelligence through Simulated Evolution , 1966 .

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

[4]  Douglas B. Lenat,et al.  The Role of Heuristics in Learning by Discovery: Three Case Studies , 1983 .

[5]  John Dickinson,et al.  Using the Genetic Algorithm to Generate LISP Source Code to Solve the Prisoner's Dilemma , 1987, ICGA.

[6]  H. J. Antonisse,et al.  Genetic Operators for High-Level Knowledge Representations , 1987, ICGA.

[7]  John R. Koza,et al.  Hierarchical Genetic Algorithms Operating on Populations of Computer Programs , 1989, IJCAI.

[8]  John R. Koza,et al.  Genetically breeding populations of computer programs to solve problems in artificial intelligence , 1990, [1990] Proceedings of the 2nd International IEEE Conference on Tools for Artificial Intelligence.

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

[10]  Una-May O'Reilly,et al.  Genetic Programming II: Automatic Discovery of Reusable Programs. , 1994, Artificial Life.

[11]  John R. Koza,et al.  Architecture-Altering Operations for Evolving the Architecture of a Multi-Part Program in Genetic Programming , 1994 .

[12]  Patrik D'haeseleer,et al.  Context preserving crossover in genetic programming , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[13]  Lawrence J. Fogel,et al.  Evolutionary Programming: Proceedings of the Third Annual Conference , 1994 .

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

[15]  John R. Koza,et al.  Survey of genetic algorithms and genetic programming , 1995, Proceedings of WESCON'95.

[16]  John R. Koza,et al.  Evolving the Architecture of a Multi-part Program in Genetic Programming Using Architecture-Altering Operations , 1995, Evolutionary Programming.

[17]  John R. Koza,et al.  Two Ways of Discovering the Size and Shape of a Computer Program to Solve a Problem , 1995, ICGA.

[18]  John R. Koza,et al.  Use of automatically defined functions and architecture-altering operations in automated circuit synthesis with genetic programming , 1996 .

[19]  Ernesto Tarantino,et al.  A Comparative Analysis of Evolutionary Algorithms for Function Optimisation , 1996 .

[20]  Lee Spector,et al.  Simultaneous evolution of programs and their control structures , 1996 .

[21]  P. Angeline.  An Investigation into the Sensitivity of Genetic Programming to the Frequency of Leaf Selection Duri , 1996 .

[22]  Wolfgang Banzhaf,et al.  Genetic Programming: An Introduction , 1997 .

[23]  Riccardo Poli,et al.  Why Ants are Hard , 1998 .

[24]  Ricardo Aler,et al.  Immediate Transfer of Global Improvements to All Individuals in a Population Compared to Automatically Defined Functions for the EVEN-5, 6-PARITY Problems , 1998, EuroGP.

[25]  A. Fukunaga,et al.  A Genome Complier for High-Performance Genetic Programming , 1998 .

[26]  William B. Langdon,et al.  Genetic Programming and Data Structures: Genetic Programming + Data Structures = Automatic Programming! , 1998 .

[27]  Hitoshi Iba,et al.  Genetic Programming 1998: Proceedings of the Third Annual Conference , 1999, IEEE Trans. Evol. Comput..

[28]  F. H. Bennett.  Genetic Programming : Biologically Inspired Computation that Exhibits Creativity in Solving Non-Trivial Problems , 1999 .

[29]  Nikolay I. Nikolaev,et al.  Genetic Programming and Data Structures: Genetic Programming+Data Structures=Automatic Programming , 2001, Softw. Focus.

[30]  Aurora Trinidad Ramirez Pozo,et al.  Grammar-Guided Genetic Programming and Automatically Defined Functions , 2002, SBIA.

[31]  Franz Oppacher,et al.  An Analysis of Koza's Computational Effort Statistic for Genetic Programming , 2002, EuroGP.

[32]  John R. Koza,et al.  Automatic synthesis of both the topology and numerical parameters for complex structures using genetic programming , 2002 .

[33]  John R. Koza,et al.  Iterative Refinement Of Computational Circuits Using Genetic Programming , 2002, GECCO.

[34]  John R. Koza,et al.  Genetic Programming IV: Routine Human-Competitive Machine Intelligence , 2003 .

[35]  J. Koza.  Automatic Synthesis of Topologies and Numerical Parameters , 2003 .

[36]  John R. Koza,et al.  Automated Synthesis by Means of Genetic Programming of Human- Competitive Designs Employing Reuse, Hierarchies, Modularities, Development, and Parameterized Topologies , 2003 .

[37]  John R. Koza,et al.  Automated Synthesis by Means of Genetic Programming of Complex Structures Incorporating Reuse, Parameterized Reuse, Hierarchies, and Development , 2003 .

[38]  Xiang Li,et al.  Pyramid search: finding solutions for deceptive problems quickly in genetic programming , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[39]  Elena Marchiori,et al.  Evolutionary Algorithms with On-the-Fly Population Size Adjustment , 2004, PPSN.

[40]  U. Aickelin,et al.  Parallel Problem Solving from Nature - PPSN VIII , 2004, Lecture Notes in Computer Science.

[41]  Santiago García Carbajal,et al.  Evolutive Introns: A Non-Costly Method of Using Introns in GP , 2001, Genetic Programming and Evolvable Machines.

[42]  Chang Wook Ahn,et al.  On the practical genetic algorithms , 2005, GECCO '05.

[43]  S. Cooper.  Chapter 6. , 1887, Interviews with Rudolph A Marcus on Electron Transfer Reactions.