Tag-based modularity in tree-based genetic programming

Item Type:	Conference or Workshop Item
Title:	Tag-based modularity in tree-based genetic programming
Creators Name:	Spector, L. and Harrington, K. and Helmuth, T.
Abstract:	Several techniques have been developed for allowing genetic programming systems to produce programs that make use of subroutines, macros, and other modular program structures. A recently proposed technique, based on the "tagging" and tag-based retrieval of blocks of code, has been shown to have novel and desirable features, but this was demonstrated only within the context of the PushGP genetic programming system. Following a suggestion in the GECCO-2011 publication on this technique we show here how tag-based modules can be incorporated into a more standard tree-based genetic programming system. We describe the technique in detail along with some possible extensions, outline arguments for its simplicity and potential power, and present results obtained using the technique on problems for which other modularization techniques have been shown to be useful. The results are mixed; substantial benefits are seen on the lawnmower problem but not on the Boolean even-4-parity problem. We discuss the observed results and directions for future research.
Keywords:	Genetic Programming, Modularity, Tags, Automatically Defined Functions, Lawnmower Problem, Parity Problem
Source:	Proceedings of the Conference on Genetic and Evolutionary Computation
Title of Book:	GECCO '12: Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
ISBN:	978-1-4503-1178-6
Publisher:	Association for Computing Machinery
Page Range:	815
Date:	July 2012
Official Publication:	https://doi.org/10.1145/2330163.2330276

Repository Staff Only: item control page