Massively Parallel Genetic Optimization through Asynchronous Propagation of Populations

01/20/2023
by   Oskar Taubert, et al.
0

We present Propulate, an evolutionary optimization algorithm and software package for global optimization and in particular hyperparameter search. For efficient use of HPC resources, Propulate omits the synchronization after each generation as done in conventional genetic algorithms. Instead, it steers the search with the complete population present at time of breeding new individuals. We provide an MPI-based implementation of our algorithm, which features variants of selection, mutation, crossover, and migration and is easy to extend with custom functionality. We compare Propulate to the established optimization tool Optuna. We find that Propulate is up to three orders of magnitude faster without sacrificing solution accuracy, demonstrating the efficiency and efficacy of our lazy synchronization approach. Code and documentation are available at https://github.com/Helmholtz-AI-Energy/propulate

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/26/2015

A Java Implementation of Parameter-less Evolutionary Algorithms

The Parameter-less Genetic Algorithm was first presented by Harik and Lo...
research
06/26/2015

A Java Implementation of the SGA, UMDA, ECGA, and HBOA

The Simple Genetic Algorithm, the Univariate Marginal Distribution Algor...
research
01/21/2014

Genetic Algorithms and its use with back-propagation network

Genetic algorithms are considered as one of the most efficient search te...
research
03/08/2013

Gene-Machine, a new search heuristic algorithm

This paper introduces Gene-Machine, an efficient and new search heuristi...
research
07/25/2019

Optuna: A Next-generation Hyperparameter Optimization Framework

The purpose of this study is to introduce new design-criteria for next-g...
research
05/22/2016

Evolutionary Demographic Algorithms

Most of the problems in genetic algorithms are very complex and demand a...
research
01/19/2014

Revolutionary Algorithms

The optimization of dynamic problems is both widespread and difficult. W...

Please sign up or login with your details

Forgot password? Click here to reset