Geometric Semantic Genetic Programming (GSGP) is a state-of-the-art machine learning method based on evolutionary computation. GSGP performs search operations directly at the level of program semantics, which can be done more efficiently then operating at the syntax level like most GP systems. Efficient implementations of GSGP in C++ exploit this fact, but not to its full potential. This paper presents GSGP-CUDA, the first CUDA implementation of GSGP and the most efficient, which exploits the intrinsic parallelism of GSGP using GPUs. Results show speedups greater than 1,000X relative to the state-of-the-art sequential implementation.
翻译:GSGP直接在程序语义学一级进行搜索作业,这项工作可以更有效地进行,然后在语法一级像大多数GP系统一样运作。 GSGP在C+++中的有效实施利用了这一事实,但并没有充分发挥其潜力。本文介绍了GSGP-CUDA,这是CUDA首次实施GGPA,也是最有效的方法,它利用了GGPPG使用GPUs的内在平行性。结果显示,相对于最先进的连续实施而言,加速速度超过1,000x。