arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2211.13801cs.NE
收藏

基于cGA的崎岖景观优化理论研究

Theoretical Study of Optimizing Rugged Landscapes with the cGA

Tobias Friedrich, Timo Kötzing, Frank Neumann, Aishwarya Radhakrishnan

摘要:

分布估计算法(EDA)提供了一种基于分布的优化方法,该方法在算法运行期间调整其概率分布。我们有助于EDA的理论理解,并指出,他们的分布方法,使他们更适合处理崎岖的健身景观比经典的局部搜索算法。具体来说,我们通过向每个适应值添加噪声来使OneMax函数变得坚固。然而,cGA可以找到具有n(1 - ε)个1的解,即使对于高方差的噪声也是如此。与此相反,RLS和(1+1)EA,具有很高的概率,仅找到具有n(1/2+o(1))个1的解决方案,即使对于具有小方差的噪声。

英文摘要:

Estimation of distribution algorithms (EDAs) provide a distribution - based approach for optimization which adapts its probability distribution during the run of the algorithm. We contribute to the theoretical understanding of EDAs and point out that their distribution approach makes them more suitable to deal with rugged fitness landscapes than classical local search algorithms. Concretely, we make the OneMax function rugged by adding noise to each fitness value. The cGA can nevertheless find solutions with n(1 - ε) many 1s, even for high variance of noise. In contrast to this, RLS and the (1+1) EA, with high probability, only find solutions with n(1/2+o(1)) many 1s, even for noise with small variance.

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

↑