The linear hidden subset problem for the (1+1) EA with scheduled and adaptive mutation rates

08/16/2018
by   Hafsteinn Einarsson, et al.
0

We study unbiased (1+1) evolutionary algorithms on linear functions with an unknown number n of bits with non-zero weight. Static algorithms achieve an optimal runtime of O(n ( n)^2+ϵ), however, it remained unclear whether more dynamic parameter policies could yield better runtime guarantees. We consider two setups: one where the mutation rate follows a fixed schedule, and one where it may be adapted depending on the history of the run. For the first setup, we give a schedule that achieves a runtime of (1± o(1))β n n, where β≈ 3.552, which is an asymptotic improvement over the runtime of the static setup. Moreover, we show that no schedule admits a better runtime guarantee and that the optimal schedule is essentially unique. For the second setup, we show that the runtime can be further improved to (1± o(1)) e n n, which matches the performance of algorithms that know n in advance. Finally, we study the related model of initial segment uncertainty with static position-dependent mutation rates, and derive asymptotically optimal lower bounds. This answers a question by Doerr, Doerr, and Kötzing.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/16/2023

Fourier Analysis Meets Runtime Analysis: Precise Runtimes on Plateaus

We propose a new method based on discrete Fourier analysis to analyze th...
research
04/01/2020

Self-adaptation in non-Elitist Evolutionary Algorithms on Discrete Problems with Unknown Structure

A key challenge to make effective use of evolutionary algorithms is to c...
research
04/14/2020

Fast Mutation in Crossover-based Algorithms

The heavy-tailed mutation operator proposed in Doerr et al. (GECCO 2017)...
research
08/11/2022

Runtime Analysis of the (1+1) EA on Weighted Sums of Transformed Linear Functions

Linear functions play a key role in the runtime analysis of evolutionary...
research
06/17/2016

Self-adaptation of Mutation Rates in Non-elitist Populations

The runtime of evolutionary algorithms (EAs) depends critically on their...
research
02/23/2023

Tight Runtime Bounds for Static Unary Unbiased Evolutionary Algorithms on Linear Functions

In a seminal paper in 2013, Witt showed that the (1+1) Evolutionary Algo...
research
01/13/2018

Better Runtime Guarantees Via Stochastic Domination

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

Please sign up or login with your details

Forgot password? Click here to reset