OneMax并非适应度改进最容易的函数
OneMax is not the Easiest Function for Fitness Improvements
AI总结:
本文反驳OneMax是(1:s+1)规则下最易景观的推测,证明Dynamic BinVal会使自调节(1,λ)-EA无法多项式时间寻优。
摘要:
我们研究用于控制(1,λ)-EA种群规模的(1:s+1)成功规则。Hevia Fajardo和Sudholt已经表明,如果适应度景观过于简单,这种参数控制机制在s较大时可能遇到问题。他们推测该问题在OneMax基准上最为严重,因为在某种公认的意义上,OneMax被认为是最容易的适应度景观。本文反驳了这一推测,并表明在寻找改进步骤方面,OneMax并不是最容易的适应度景观。作为结果,我们证明存在s和ε,使得采用(1:s+1)规则的自调节(1,λ)-EA在从εn个零位启动时能够高效优化OneMax,但在Dynamic BinVal上无法在多项式时间内找到最优解。因此,我们表明存在这样的景观:用于控制(1,λ)-EA种群规模的(1:s+1)规则在其中的问题比在OneMax上更严重。
英文摘要:
We study the $(1:s+1)$ success rule for controlling the population size of the $(1,λ)$-EA. It was shown by Hevia Fajardo and Sudholt that this parameter control mechanism can run into problems for large $s$ if the fitness landscape is too easy. They conjectured that this problem is worst for the OneMax benchmark, since in some well-established sense OneMax is known to be the easiest fitness landscape. In this paper we disprove this conjecture and show that OneMax is not the easiest fitness landscape with respect to finding improving steps. As a consequence, we show that there exists $s$ and $\varepsilon$ such that the self-adjusting $(1,λ)$-EA with $(1:s+1)$-rule optimizes OneMax efficiently when started with $\varepsilon n$ zero-bits, but does not find the optimum in polynomial time on Dynamic BinVal. Hence, we show that there are landscapes where the problem of the $(1:s+1)$-rule for controlling the population size of the $(1, λ)$-EA is more severe than for OneMax.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。