Toward Measuring the Scaling of Genetic Programming

by   Mike Stimpson, et al.

Several genetic programming systems are created, each solving a different problem. In these systems, the median number of generations G needed to evolve a working program is measured. The behavior of G is observed as the difficulty of the problem is increased. In these systems, the density D of working programs in the universe of all possible programs is measured. The relationship G 1/sqrt(D) is observed to approximately hold for two program-like systems. For parallel systems (systems that look like several independent programs evolving in parallel), the relationship G 1/(n ln n) is observed to approximately hold. Finally, systems that are anti-parallel are considered.


page 1

page 2

page 3

page 4


Evolving a New Feature for a Working Program

A genetic programming system is created. A first fitness function f1 is ...

MTGP: Combining Metamorphic Testing and Genetic Programming

Genetic programming is an evolutionary approach known for its performanc...

Tag-based Genetic Regulation for Genetic Programming

We introduce and experimentally demonstrate tag-based genetic regulation...

Genetic Programming with Local Scoring

We present new techniques for synthesizing programs through sequences of...

Genetic Algorithms for Mentor-Assisted Evaluation Function Optimization

In this paper we demonstrate how genetic algorithms can be used to rever...

Expert-Driven Genetic Algorithms for Simulating Evaluation Functions

In this paper we demonstrate how genetic algorithms can be used to rever...

Evolving Open Complexity

Information theoretic analysis of large evolved programs produced by run...

Please sign up or login with your details

Forgot password? Click here to reset