乘性上漂移
Multiplicative Up-Drift
摘要:
漂移分析旨在将进化算法(或更一般地,随机过程)的预期进展转化为对其运行时间(命中时间)的概率保证。到目前为止,漂移参数已经成功地用于进化算法的严格分析,然而,仅用于进展恒定或在接近目标时变得较弱的情况。出于这样的问题,如如何快速适应个人接管人口,我们分析随机过程表现出$(1+δ)$ -乘法增长的期望。我们证明了漂移定理翻译这个预期的进展到命中时间。这个漂移定理给出了Lehre(2011)首次提出的基于水平的定理的简单而有见地的证明。这个定理的我们的版本第一次对$1/δ$具有最好的可能的近线性依赖性(以前的结果至少具有近二次依赖性),并且它只需要在$δ$中接近线性的种群大小(这在以前的结果中是超二次的)。这些改进立即为许多应用程序带来了更强的运行时间保证。我们还讨论了大$δ$的情况下,并显示更强的结果,这种设置。
英文摘要:
Drift analysis aims at translating the expected progress of an evolutionary algorithm (or more generally, a random process) into a probabilistic guarantee on its run time (hitting time). So far, drift arguments have been successfully employed in the rigorous analysis of evolutionary algorithms, however, only for the situation that the progress is constant or becomes weaker when approaching the target. Motivated by questions like how fast fit individuals take over a population, we analyze random processes exhibiting a $(1+δ)$-multiplicative growth in expectation. We prove a drift theorem translating this expected progress into a hitting time. This drift theorem gives a simple and insightful proof of the level-based theorem first proposed by Lehre (2011). Our version of this theorem has, for the first time, the best-possible near-linear dependence on $1/δ$ (the previous results had an at least near-quadratic dependence), and it only requires a population size near-linear in $δ$ (this was super-quadratic in previous results). These improvements immediately lead to stronger run time guarantees for a number of applications. We also discuss the case of large $δ$ and show stronger results for this setting.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。