arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1108.4386cs.NE
收藏

线性函数(1+1)EA优化时间的紧界

Tight Bounds on the Optimization Time of the (1+1) EA on Linear Functions

Carsten Witt

摘要:

对函数类的随机搜索算法的分析对于理解潜在的随机过程和开发合适的证明技术是至关重要的。近年来,关于线性函数类上简单(1+1)进化算法的期望优化时间的界取得了显著的进展。我们提高了最好的已知的界限,在这种设置从$(1.39+o(1))en\ln n$到$en\ln n+O(n)$的期望和高概率,这是紧到低阶项。此外,推导出任意突变概率$p$的上界和下界,这意味着期望多项式优化时间与$p=O((\ln n)/n)$一样长,并且如果$p=c/n$为常数$c$,则该上界和下界是紧的。因此,标准变异概率$p=1/n$是最佳的所有线性函数,和(1+1)EA被发现是一个最佳的变异为基础的算法。证明是基于自适应漂移函数和最近的乘性漂移定理。

英文摘要:

The analysis of randomized search heuristics on classes of functions is fundamental for the understanding of the underlying stochastic process and the development of suitable proof techniques. Recently, remarkable progress has been made in bounding the expected optimization time of the simple (1+1) EA on the class of linear functions. We improve the best known bound in this setting from $(1.39+o(1))en\ln n$ to $en\ln n+O(n)$ in expectation and with high probability, which is tight up to lower-order terms. Moreover, upper and lower bounds for arbitrary mutations probabilities $p$ are derived, which imply expected polynomial optimization time as long as $p=O((\ln n)/n)$ and which are tight if $p=c/n$ for a constant $c$. As a consequence, the standard mutation probability $p=1/n$ is optimal for all linear functions, and the (1+1) EA is found to be an optimal mutation-based algorithm. The proofs are based on adaptive drift functions and the recent multiplicative drift theorem.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑