Reducing the arity in unbiased black-box complexity

@inproceedings{Doerr2012ReducingTA,
  title={Reducing the arity in unbiased black-box complexity},
  author={Benjamin Doerr and Carola Doerr},
  booktitle={GECCO '12},
  year={2012}
}
  • Benjamin Doerr, Carola Doerr
  • Published in GECCO '12 2012
  • Computer Science
  • We show that for all 1 < <i>k</i> d log <i>n</i> the <i>k</i>-ary unbiased black-box complexity of the <i>n</i>-dimensional OneMax function class is <i>O</i>(<i>n/k</i>). This indicates that the power of higher arity operators is much stronger than what the previous <i>O</i>(<i>n</i>/log <i>k</i>) bound by Doerr et al. (Faster black-box algorithms through higher arity operators, Proc. of FOGA 2011, pp. 163--172, ACM, 2011) suggests. The key to this result is an encoding strategy, which might… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Topics from this paper.