Embedded Grammars for Grammatical Evolution on GPGPU
This paper presents an implementation of Grammatical Evolution on a GPU architecture. Our proposal, Embedded Grammars, implements the grammar directly in the code. Although more rigid, it allows to compute the decodification in parallel with the evaluation of the individuals. We tested three different grammars with a set of eight symbolic regression problems. The symbolic regression problems consists on obtaining a mathematical expression in the form \(y=f(x)\), in our case, from a set of 288 pairs x, y. The analysis of the results shows that Embedded Grammars are better not only in terms of execution time, but also in quality when compared with an implementation on a CPU. Speed-up results are also better than those presented in the literature.
KeywordsGrammatical evolution Model identification Symbolic regression Graphic processing unit
This work was supported by the Spanish Government Minister of Science and Innovation under grants TIN2014-54806-R, TIN2015-65277-R and CAPAP-H5 network (TIN2014-53522) and TIN2015-65460-C2. J.I. Hidalgo also acknowledges the support of the Spanish Ministry of Education mobility grant PRX16/00216.
- 6.Pospichal, P., Murphy, E., O’Neill, M., Schwarz, J., Jaros, J.: Acceleration of grammatical evolution using graphics processing units: computational intelligence on consumer games and graphics hardware. In: Proceedings of the 13th Annual Conference Companion on Genetic and Evolutionary Computation, GECCO 2011, pp. 431–438. ACM, NY (2011)Google Scholar
- 8.Ryan, C., O’Neill, M., Collins, J.J.: Grammatical evolution: solving trigonometric identities. In: Proceedings of Mendel 1998: 4th International Conference on Genetic Algorithms, Optimization Problems, Fuzzy Logic, Neural Networks and Rough Sets, pp. 111–119 (1998)Google Scholar
- 12.CUDA Nvidia. Programming guide (2008)Google Scholar