@inproceedings{c4c0e621d0564e518259db786477f142,

title = "Unbiased black-box complexity of parallel search",

abstract = "We propose a new black-box complexity model for search algorithms evaluating λ search points in parallel. The parallel unbiased black-box complexity gives lower bounds on the number of function evaluations every parallel unbiased black-box algorithm needs to optimise a given problem. It captures the inertia caused by offspring populations in evolutionary algorithms and the total computational effort in parallel metaheuristics. Our model applies to all unary variation operators such as mutation or local search. We present lower bounds for the Leading-Ones function and general lower bound for all functions with a unique optimum that depend on the problem size and the degree of parallelism, λ. The latter is tight for OneMax; we prove that a (1+λ) EA with adaptive mutation rates is an optimal parallel unbiased black-box algorithm.",

keywords = "Linear Speedup, Search Point, Island Model, Parallel Time, Clonal Selection Algorithm",

author = "Golnaz Badkobeh and Lehre, {Per Kristian} and Dirk Sudholt",

year = "2014",

month = sep,

day = "24",

doi = "10.1007/978-3-319-10762-2_88",

language = "English",

isbn = "978-3-319-10761-5",

series = "Lecture Notes in Computer Science ",

publisher = "Springer",

pages = "892--901",

editor = "Bartz-Beielstein, {Thomas } and Branke, {J{\"u}rgen } and Filipic, {Bogdan } and Smith, {Jim }",

booktitle = "Parallel Problem Solving from Nature – PPSN XIII",

edition = "1",

note = "13th International Conference on Parallel Problem Solving from Nature – PPSN XIII ; Conference date: 13-09-2014 Through 17-09-2014",

}