DeepAI AI Chat
Log In Sign Up

Optimal Parameter Choices via Precise Black-Box Analysis

by   Benjamin Doerr, et al.

It has been observed that some working principles of evolutionary algorithms, in particular, the influence of the parameters, cannot be understood from results on the asymptotic order of the runtime, but only from more precise results. In this work, we complement the emerging topic of precise runtime analysis with a first precise complexity theoretic result. Our vision is that the interplay between algorithm analysis and complexity theory becomes a fruitful tool also for analyses more precise than asymptotic orders of magnitude. As particular result, we prove that the unary unbiased black-box complexity of the OneMax benchmark function class is n (n) - cn ± o(n) for a constant c which is between 0.2539 and 0.2665. This runtime can be achieved with a simple (1+1)-type algorithm using a fitness-dependent mutation strength. When translated into the fixed-budget perspective, our algorithm finds solutions which are roughly 13% closer to the optimum than those of the best previously known algorithms. To prove our results, we formulate several new versions of the variable drift theorems which might be of independent interest.


page 1

page 2

page 3

page 4


Runtime Analysis for Self-adaptive Mutation Rates

We propose and analyze a self-adaptive version of the (1,λ) evolutionary...

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

One important goal of black-box complexity theory is the development of ...

Choosing the Right Algorithm With Hints From Complexity Theory

Choosing a suitable algorithm from the myriads of different search heuri...

Towards a More Practice-Aware Runtime Analysis of Evolutionary Algorithms

Theory of evolutionary computation (EC) aims at providing mathematically...

Unbiased Black-Box Complexities of Jump Functions

We analyze the unbiased black-box complexity of jump functions with smal...

Better Runtime Guarantees Via Stochastic Domination

Apart from few exceptions, the mathematical runtime analysis of evolutio...