On the Analysis of Simple Genetic Programming for Evolving Boolean Functions
This work presents a first step towards a systematic time and space complexity analysis of genetic programming (GP) for evolving functions with desired input/output behaviour. Two simple GP algorithms, called (1+1) GP and (1+1) GP*, equipped with minimal function (F) and terminal (L) sets are considered for evolving two standard classes of Boolean functions. It is rigorously proved that both algorithms are efficient for the easy problem of evolving conjunctions of Boolean variables with the minimal sets. However, if an extra function (i.e. NOT) is added to F, then the algorithms require at least exponential time to evolve the conjunction of n variables. On the other hand, it is proved that both algorithms fail at evolving the difficult parity function in polynomial time with probability at least exponentially close to 1. Concerning generalisation, it is shown how the quality of the evolved conjunctions depends on the size of the training set s while the evolved exclusive disjunctions generalize equally badly independent of s.
KeywordsGenetic programming Theory Runtime analysis
The authors would like to thank Alberto Moraglio for constructive discussions which initialised this work. Further preliminary discussions occurred at Dagstuhl Seminar N.15211. This work was supported by EPSRC under Grant n. EP/M004252/1.
- 7.Luke, S.: Genetic programming produced competitive soccer softbot teams for RoboCup97. In: Proceedings of the Third Annual Conference on Genetic Programming 1998, pp. 214–222. Morgan Kaufmann (1998)Google Scholar
- 9.Moraglio, A., Mambrini, A., Manzoni, L.: Runtime analysis of mutation-based geometric semantic genetic programming on boolean functions. In: Proceedings of FOGA XII, pp. 119–132. ACM (2013)Google Scholar
- 10.Neumann, F., O’Reilly, U.M., Wagner, M.: Computational complexity analysis of genetic programming - initial results and future directions. In: Riolo, R., Vladislavleva, E., Moore, J.H. (eds.) Genetic Programming Theory and Practice IX. Genetic and Evolutionary Computation, pp. 113–128. Springer, New York (2011)CrossRefGoogle Scholar
- 15.Poli, R., Langdon, W.B., McPhee, N.F.: A field guide to genetic programming (2008). http://lulu.com
- 17.Spector, L., Barnum, H., Bernstein, H.J., Swamy, N.: Quantum computing applications of genetic programming. In: Spector, L., Langdon, W.B., O’Reilly, U.M., Angeline, P.J. (eds.) Advances in Genetic Programming 3, pp. 135–160. MIT Press, Cambridge (1999)Google Scholar