无偏黑盒复杂度中的Arity降低
Reducing the Arity in Unbiased Black-Box Complexity
摘要:
我们证明了对于所有的$1<k \leq \log n$,$n$维$\onemax$函数类的$k$元无偏黑箱复杂度是$O(n/k)$ .这表明更高元数运算符的能力比Doerr等人的先前$O(n/\log k)$约束的能力强得多(Faster black-box algorithms through higher arity operators,Proc. of FOGA 2011,pp. 163- 172,ACM,2011)建议。这个结果的关键是编码策略,这可能是独立的利益。我们表明,仅使用$k$ -ary无偏变分运算符,我们可以模拟大小为$O(2^k)$位的不受限制的存储器。
英文摘要:
We show that for all $1<k \leq \log n$ the $k$-ary unbiased black-box complexity of the $n$-dimensional $\onemax$ function class is $O(n/k)$. This indicates that the power of higher arity operators is much stronger than what the previous $O(n/\log k)$ 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 be of independent interest. We show that, using $k$-ary unbiased variation operators only, we may simulate an unrestricted memory of size $O(2^k)$ bits.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。