Computer Science – Neural and Evolutionary Computing
Scientific paper
2005-02-07
Computer Science
Neural and Evolutionary Computing
Submitted to GECCO-2005
Scientific paper
This paper discusses scalability of standard genetic programming (GP) and the probabilistic incremental program evolution (PIPE). To investigate the need for both effective mixing and linkage learning, two test problems are considered: ORDER problem, which is rather easy for any recombination-based GP, and TRAP or the deceptive trap problem, which requires the algorithm to learn interactions among subsets of terminals. The scalability results show that both GP and PIPE scale up polynomially with problem size on the simple ORDER problem, but they both scale up exponentially on the deceptive problem. This indicates that while standard recombination is sufficient when no interactions need to be considered, for some problems linkage learning is necessary. These results are in agreement with the lessons learned in the domain of binary-string genetic algorithms (GAs). Furthermore, the paper investigates the effects of introducing utnnecessary and irrelevant primitives on the performance of GP and PIPE.
Ondas Radovan
Pelikan Martin
Sastry Kumara
No associations
LandOfFree
Scalability of Genetic Programming and Probabilistic Incremental Program Evolution does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Scalability of Genetic Programming and Probabilistic Incremental Program Evolution, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Scalability of Genetic Programming and Probabilistic Incremental Program Evolution will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-129059