Theory of Parameter Control for Discrete Black-Box Optimization: Provable Performance Gains Through Dynamic Parameter Choices

04/16/2018
by   Benjamin Doerr, et al.
0

Parameter control aims at realizing performance gains through a dynamic choice of the parameters which determine the behavior of the underlying optimization algorithm. In the context of evolutionary algorithms this research line has for a long time been dominated by empirical approaches. With the significant advances in running time analysis achieved in the last ten years, the parameter control question has become accessible to theoretical investigations. A number of running time results for a broad range of different parameter control mechanisms have been obtained in recent years. This book chapter surveys these works, and puts them into context, by proposing an updated classification scheme for parameter control.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/06/2018

Complexity Theory for Discrete Black-Box Optimization Heuristics

A predominant topic in the theory of evolutionary algorithms and, more g...
research
06/26/2015

Java Implementation of a Parameter-less Evolutionary Portfolio

The Java implementation of a portfolio of parameter-less evolutionary al...
research
06/30/2020

A Survey on Recent Progress in the Theory of Evolutionary Algorithms for Discrete Optimization

The theory of evolutionary computation for discrete search spaces has ma...
research
02/07/2022

Theory-inspired Parameter Control Benchmarks for Dynamic Algorithm Configuration

It has long been observed that the performance of evolutionary algorithm...
research
06/17/2019

Running Time Analysis of the (1+1)-EA for Robust Linear Optimization

Evolutionary algorithms (EAs) have found many successful real-world appl...
research
02/23/2023

Using Automated Algorithm Configuration for Parameter Control

Dynamic Algorithm Configuration (DAC) tackles the question of how to aut...

Please sign up or login with your details

Forgot password? Click here to reset