动态环境中的 $(1 + 1)$-EA
The $(1 + 1)$-EA in Dynamic Environments
AI总结:
研究动态线性环境中 $(1+1)$-EA 的优化时间,证明突变率存在阈值,低于阈值期望时间为 $\mathcal{O}(n\log n)$,高于阈值则为 $2^{\Omega(n)}$,并量化了动态二进制值问题中的停滞距离。
摘要:
我们研究动态线性环境中的 $(1 + 1)$-EA,其中每一代的选择都是针对一个新鲜采样的具有正权重的线性函数进行的。我们考虑动态二进制值问题,其中每一代使用 $1,2,4,\dots,2^{n-1}$ 的均匀随机排列,以及均匀权重变体,其中权重独立地从 $\mathrm{Unif}(0,1)$ 中抽取。这两个问题最近都被集成到 IOHprofiler 平台中并进行了实证研究。对于这两个模型,我们证明了突变率 $\chi/n$ 中突变参数 $\chi$ 的一个尖锐阈值。在阈值以下,期望优化时间为 $\mathcal{O}(n\log n)$,而在阈值以上,运行时间变为 $2^{\Omega(n)}$。对于指数机制下的动态二进制值问题,我们还量化了优化过程停滞时与最优解的距离。我们证明存在第二个阈值:一个可以高效达到的距离,但达到任何更小的距离都需要指数时间。这量化并证明了先前的实证发现。
英文摘要:
We study the $(1 + 1)$-EA in dynamic linear environments, where in every generation selection is performed with respect to a freshly sampled linear function with positive weights. We consider the Dynamic Binary Value problem, where each generation uses a uniformly random permutation of $1,2,4,\dots,2^{n-1}$, and a Uniform weight variant, where the weights are drawn independently from $\mathrm{Unif}(0,1)$. Both of them have recently been integrated into the IOHprofiler platform and empirically studied. For both models we prove a sharp threshold in the mutation parameter $χ$ for mutation rate $χ/n$. Below the threshold, the expected optimisation time is $\mathcal{O}(n\log n)$, whereas above it the runtime becomes $2^{Ω(n)}$. For the Dynamic Binary Value problem in the exponential regime, we also quantify at what distance from the optimum the optimisation process stagnates. We show that there is a second threshold: a distance that is efficiently reached, but reaching any smaller distance takes exponential time. This quantifies and proves previous empirical findings.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。