优化单调函数可能很困难
Optimizing Monotone Functions Can Be Difficult
摘要:
扩展以前的分析函数类,如线性函数,我们分析如何简单的(1+1)进化算法优化伪布尔函数是严格单调的。与人们所期望的相反,并非所有这些函数都容易优化。突变概率$p(n) = c/n$中常数$c$的选择可以产生决定性的差异。我们表明,如果$c < 1$,那么(1+1)进化算法找到最佳的每一个这样的功能在$Θ(n \log n)$迭代。对于$c=1$,我们仍然可以证明$O(n^{3/2})$的一个上界。然而,对于$c > 33$,我们提出了一个严格的单调函数,使(1+1)进化算法的压倒性概率不找到最佳的$2^{Ω(n)}$迭代。这是我们第一次观察到突变概率的常数因子变化比常数因子更能改变运行时间。
英文摘要:
Extending previous analyses on function classes like linear functions, we analyze how the simple (1+1) evolutionary algorithm optimizes pseudo-Boolean functions that are strictly monotone. Contrary to what one would expect, not all of these functions are easy to optimize. The choice of the constant $c$ in the mutation probability $p(n) = c/n$ can make a decisive difference. We show that if $c < 1$, then the (1+1) evolutionary algorithm finds the optimum of every such function in $Θ(n \log n)$ iterations. For $c=1$, we can still prove an upper bound of $O(n^{3/2})$. However, for $c > 33$, we present a strictly monotone function such that the (1+1) evolutionary algorithm with overwhelming probability does not find the optimum within $2^{Ω(n)}$ iterations. This is the first time that we observe that a constant factor change of the mutation probability changes the run-time by more than constant factors.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。