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

高度多模态适应度景观中的停滞检测

Stagnation Detection in Highly Multimodal Fitness Landscapes

Amirhossein Rajabi, Carsten Witt

摘要:

停滞检测已经被提出作为随机搜索算法的一种机制,以通过自动增加邻域的大小来找到所谓的间隙大小,即,距离下一次改进的距离。它的有用性大多被认为是在简单的多模态景观,很少有局部最优,可以一个接一个地跨越。在具有类似间隙大小的最优值的更复杂位置的多模态景观中,停滞检测受到以下事实的影响:邻域大小频繁地重置为$1$,而不使用过去有希望的间隙大小。在本文中,我们研究了一种新的机制,称为半径内存,可以添加到停滞检测,以控制搜索半径更仔细地给予优先值,在过去是成功的。我们实现了这个想法在一个算法称为SD-RLS $^{\text{m}}$和显示相比,以前的变种停滞检测,它产生的线性函数的速度在统一的约束和最小生成树问题。此外,它的运行时间在单峰函数和Jump基准的推广上不会显着恶化。最后,我们提出的实验结果进行研究SD-RLS $^{\text{m}}$,并与其他算法进行比较。

英文摘要:

Stagnation detection has been proposed as a mechanism for randomized search heuristics to escape from local optima by automatically increasing the size of the neighborhood to find the so-called gap size, i.e., the distance to the next improvement. Its usefulness has mostly been considered in simple multimodal landscapes with few local optima that could be crossed one after another. In multimodal landscapes with a more complex location of optima of similar gap size, stagnation detection suffers from the fact that the neighborhood size is frequently reset to $1$ without using gap sizes that were promising in the past. In this paper, we investigate a new mechanism called radius memory which can be added to stagnation detection to control the search radius more carefully by giving preference to values that were successful in the past. We implement this idea in an algorithm called SD-RLS$^{\text{m}}$ and show compared to previous variants of stagnation detection that it yields speed-ups for linear functions under uniform constraints and the minimum spanning tree problem. Moreover, its running time does not significantly deteriorate on unimodal functions and a generalization of the Jump benchmark. Finally, we present experimental results carried out to study SD-RLS$^{\text{m}}$ and compare it with other algorithms.

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

↑