GPU Based Differential Evolution: New Insights and Comparative Study
Dylan Janssen, Wayne Pullan, Alan Wee-Chung Liew

TL;DR
This paper reviews GPU-accelerated Differential Evolution algorithms, analyzes architectural choices, and introduces a new benchmark for evaluating their performance in numerical optimization tasks.
Contribution
It provides a comprehensive review of GPU-based DE architectures and introduces a novel benchmark for their performance comparison.
Findings
GPU acceleration significantly reduces optimization run-time.
Architectural choices impact the efficiency of GPU-based DE.
The new benchmark enables standardized evaluation of GPU DE algorithms.
Abstract
Differential Evolution (DE) is a highly successful population based global optimisation algorithm, commonly used for solving numerical optimisation problems. However, as the complexity of the objective function increases, the wall-clock run-time of the algorithm suffers as many fitness function evaluations must take place to effectively explore the search space. Due to the inherently parallel nature of the DE algorithm, graphics processing units (GPU) have been used to effectively accelerate both the fitness evaluation and DE algorithm. This work reviews the main architectural choices made in the literature for GPU based DE algorithms and introduces a new GPU based numerical optimisation benchmark to evaluate and compare GPU based DE algorithms.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Applications · Solidification and crystal growth phenomena
