Geometric Semantic Genetic Programming
Traditional Genetic Programming (GP) searches the space of functions/programs by using search operators that manipulate their syntactic representation, regardless of their actual semantics/behaviour. Recently, semantically aware search operators have been shown to outperform purely syntactic operators. In this work, using a formal geometric view on search operators and representations, we bring the semantic approach to its extreme consequences and introduce a novel form of GP – Geometric Semantic GP (GSGP) – that searches directly the space of the underlying semantics of the programs. This perspective provides new insights on the relation between program syntax and semantics, search operators and fitness landscape, and allows for principled formal design of semantic search operators for different classes of problems. We derive specific forms of GSGP for a number of classic GP domains and experimentally demonstrate their superiority to conventional operators.
Unable to display preview. Download preview PDF.
- 1.Beadle, L., Johnson, C.G.: Sematically driven crossover in genetic programming. In: Proc. of IEEE WCCI 2008, pp. 111–116 (2008)Google Scholar
- 3.Beadle, L., Johnson, C.G.: Semantically driven mutation in genetic programming. In: Proc. of IEEE CEC 2009, pp. 1336–1342 (2009)Google Scholar
- 5.Krawiec, K., Lichocki, P.: Approximating geometric crossover in semantic space. In: Proc. of GECCO 2009, pp. 987–994 (2009)Google Scholar
- 6.Krawiec, K., Wieloch, B.: Analysis of semantic modularity for genetic programming. Foundations of Computing and Decision Sciences 34(4), 265–285 (2009)Google Scholar
- 7.Luke, S.: The ECJ Owner’s Manual – A User Manual for the ECJ Evolutionary Computation Library (2010)Google Scholar
- 8.Moraglio, A.: Towards a Geometric Unification of Evolutionary Algorithms. PhD thesis, University of Essex (2007)Google Scholar
- 9.Moraglio, A.: Abstract convex evolutionary search. In: Proc. of FOGA 2011, pp. 151–162 (2011)Google Scholar