Layered learning in boolean GP problems

  • Authors:
  • David Jackson;Adrian P. Gibbons

  • Affiliations:
  • Dept. of Computer Science, University of Liverpool, Liverpool, United Kingdom;Dept. of Computer Science, University of Liverpool, Liverpool, United Kingdom

  • Venue:
  • EuroGP'07 Proceedings of the 10th European conference on Genetic programming
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Layered learning is a decomposition and reuse technique that has proved to be effective in the evolutionary solution of difficult problems. Although previous work has integrated it with genetic programming (GP), much of the application of that research has been in relation to multi-agent systems. In extending this work, we have applied it to more conventional GP problems, specifically those involving Boolean logic. We have identified two approaches which, unlike previous methods, do not require prior understanding of a problem's functional decomposition into sub-goals. Experimentation indicates that although one of the two approaches offers little advantage, the other leads to solution-finding performance significantly surpassing that of both conventional GP systems and those which incorporate automatically defined functions.