Multi-task code reuse in genetic programming

Authors:
Wojciech Jaskowski;Krzysztof Krawiec;Bartosz Wieloch
Affiliations:
Poznan University of Technology, Poznan, Poland;Poznan University of Technology, Poznan, Poland;Poznan University of Technology, Poznan, Poland
Venue:
Proceedings of the 10th annual conference companion on Genetic and evolutionary computation
Year:
2008

Citing 13
Cited 0

Genetic programming (videotape): the movie

Genetic programming (videotape): the movie
Genetic programming II: automatic discovery of reusable programs

Genetic programming II: automatic discovery of reusable programs
Multitask Learning

Machine Learning - Special issue on inductive transfer
Discovery of subroutines in genetic programming

Advances in genetic programming
A perspective view and survey of meta-learning

Artificial Intelligence Review
Reuse, Parameterized Reuse, and Hierarchical Reuse of Substructures in Evolving Electrical Circuits Using Genetic Programming

ICES '96 Proceedings of the First International Conference on Evolvable Systems: From Biology to Hardware
Lexicographic Parsimony Pressure

GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Evolving Modules in Genetic Programming by Subtree Encapsulation

EuroGP '01 Proceedings of the 4th European Conference on Genetic Programming
Creating high-level components with a generative representation for body-brain evolution

Artificial Life
Reusing Primitive and Acquired Motion Knowledge for Gait Generation of a Six-legged Robot Using Genetic Programming

Journal of Intelligent and Robotic Systems
Knowledge reuse in genetic programming applied to visual learning

Proceedings of the 9th annual conference on Genetic and evolutionary computation
No free lunch theorems for optimization

IEEE Transactions on Evolutionary Computation
Learning with case-injected genetic algorithms

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a method of knowledge reuse between evolutionary processes that solve different optimization tasks. We define the method in the framework of tree-based genetic programming (GP) and implement it as code reuse between GP trees that evolve in parallel in separate populations delegated to particular tasks. The technical means of code reuse is a crossbreeding operator which works very similar to standard tree-swapping crossover. We consider two variants of this operator, which differ in the way they handle the incompatibility of terminals between the considered problems. In the experimental part we demonstrate that such code reuse is usually beneficial and leads to success rate improvements when solving the common boolean benchmarks.