Hyper-Parameter Tuning for the (1+(λ,λ)) GA

04/09/2019
by   Nguyen Dang, et al.
0

It is known that the (1+(λ,λ)) Genetic Algorithm (GA) with self-adjusting parameter choices achieves a linear expected optimization time on OneMax if its hyper-parameters are suitably chosen. However, it is not very well understood how the hyper-parameter settings influences the overall performance of the (1+(λ,λ)) GA. Analyzing such multi-dimensional dependencies precisely is at the edge of what running time analysis can offer. To make a step forward on this question, we present an in-depth empirical study of the self-adjusting (1+(λ,λ)) GA and its hyper-parameters. We show, among many other results, that a 15% reduction of the average running time is possible by a slightly different setup, which allows non-identical offspring population sizes of mutation and crossover phase, and more flexibility in the choice of mutation rate and crossover bias --a generalization which may be of independent interest. We also show indication that the parametrization of mutation rate and crossover bias derived by theoretical means for the static variant of the (1+(λ,λ)) GA extends to the non-static case.

READ FULL TEXT
research
03/25/2018

A General Dichotomy of Evolutionary Algorithms on Monotone Functions

It is known that the evolutionary algorithm (1+1)-EA with mutation rate ...
research
08/01/2015

The Interactive Effects of Operators and Parameters to GA Performance Under Different Problem Sizes

The complex effect of genetic algorithm's (GA) operators and parameters ...
research
02/07/2019

Self-Adjusting Mutation Rates with Provably Optimal Success Rules

The one-fifth success rule is one of the best-known and most widely acce...
research
04/14/2017

Runtime Analysis of the (1+(λ,λ)) Genetic Algorithm on Random Satisfiable 3-CNF Formulas

The (1+(λ,λ)) genetic algorithm, first proposed at GECCO 2013, showed a ...
research
04/13/2015

Optimal Parameter Choices Through Self-Adjustment: Applying the 1/5-th Rule in Discrete Settings

While evolutionary algorithms are known to be very successful for a broa...
research
06/20/2020

Optimal Mutation Rates for the (1+λ) EA on OneMax

The OneMax problem, alternatively known as the Hamming distance problem,...
research
11/29/2021

High-Speed Light Focusing through Scattering Medium by Cooperatively Accelerated Genetic Algorithm

We develop an accelerated Genetic Algorithm (GA) system constructed by t...

Please sign up or login with your details

Forgot password? Click here to reset