Complexity Theory for Discrete Black-Box Optimization Heuristics

01/06/2018
by   Carola Doerr, et al.
0

A predominant topic in the theory of evolutionary algorithms and, more generally, theory of randomized black-box optimization techniques is running time analysis. Running time analysis aims at understanding the performance of a given heuristic on a given problem by bounding the number of function evaluations that are needed by the heuristic to identify a solution of a desired quality. As in general algorithms theory, this running time perspective is most useful when it is complemented by a meaningful complexity theory that studies the limits of algorithmic solutions. In the context of discrete black-box optimization, several black-box complexity models have been developed to analyze the best possible performance that a black-box optimization algorithm can achieve on a given problem. The models differ in the classes of algorithms to which these lower bounds apply. This way, black-box complexity contributes to a better understanding of how certain algorithmic choices (such as the amount of memory used by a heuristic, its selective pressure, or properties of the strategies that it uses to create new solution candidates) influences performance. In this chapter we review the different black-box complexity models that have been proposed in the literature, survey the bounds that have been obtained for these models, and discuss how the interplay of running time analysis and black-box complexity can inspire new algorithmic solutions to well-researched problems in evolutionary computation. We also discuss in this chapter several interesting open questions for future work.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/08/2016

The (1+1) Elitist Black-Box Complexity of LeadingOnes

One important goal of black-box complexity theory is the development of ...
research
04/16/2018

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

Parameter control aims at realizing performance gains through a dynamic ...
research
11/30/2021

Black box tests for algorithmic stability

Algorithmic stability is a concept from learning theory that expresses t...
research
07/11/2017

Gray-box optimization and factorized distribution algorithms: where two worlds collide

The concept of gray-box optimization, in juxtaposition to black-box opti...
research
04/15/2020

Automatic Generation of Algorithms for Black-Box Robust Optimisation Problems

We develop algorithms capable of tackling robust black-box optimisation ...
research
04/29/2020

Versatile Black-Box Optimization

Choosing automatically the right algorithm using problem descriptors is ...
research
04/22/2021

Closing Bell: Boxing black box simulations in the resource theory of contextuality

This chapter contains an exposition of the sheaf-theoretic framework for...

Please sign up or login with your details

Forgot password? Click here to reset