Optimal Parameter Choices via Precise Black-Box Analysis

@inproceedings{Doerr2016OptimalPC,
  title={Optimal Parameter Choices via Precise Black-Box Analysis},
  author={Benjamin Doerr and Carola Doerr and Jing Yang},
  booktitle={GECCO},
  year={2016}
}
In classical runtime analysis it has been observed that certain working principles of an evolutionary algorithm cannot be understood by only looking at the asymptotic order of the runtime, but that more precise estimates are needed. In this work we demonstrate that the same observation applies to black-box complexity analysis. We prove that the unary unbiased black-box complexity of the classic OneMax function class is n ln(n) -- cn ± o(n) for a constant c between 0.2539 and 0.2665. Our… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 1 time over the past 90 days. VIEW TWEETS

Similar Papers

Loading similar papers…