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

一种加速随机局部搜索的改进的一般Bet-and-Run策略

An Improved Generic Bet-and-Run Strategy for Speeding Up Stochastic Local Search

Hefei University(合肥学院);The University of Adelaide(阿德莱德大学)

Thomas Weise, Zijun Wu, Markus Wagner

摘要:

改进优化算法的常用策略是当认为算法陷入搜索空间的较低部分时重新启动算法。最近的成功的投注和运行方法重新启动本地搜索求解器的基础上,我们引入了一个改进的通用投注和运行策略。目标是使用给定的黑盒优化算法在给定的时间预算t内获得最佳可能的结果。如果没有关于问题特征和算法行为的先验知识,那么就出现了如何最有效地使用时间预算的问题。我们建议首先在初始化预算t1<t期间开始算法的k>=1个独立运行,暂停这些运行,然后应用决策器D从它们中选择1<=m<=k个运行(这样做消耗t2>=0个时间单位),然后在剩余的t3=t-t1-t2个时间单位内继续这些运行。在以前的“赌后跑”策略中,决策者D=currentBest会简单地选择在可忽略的时间内具有迄今为止最好结果的运行。我们建议使用更先进的方法来区分“好”和“坏”的样本运行,其目标是增加所选运行与后验最佳运行的相关性。我们测试了几种不同的方法,包括神经网络训练或多项式拟合的算法的当前轨迹,以预测哪一个运行可能会产生最好的结果,如果授予剩余的预算。我们通过大量的实验表明,这种方法可以产生比以前的方法更好的结果,但也发现,currentBest方法是一个非常可靠和强大的基线方法。

英文摘要:

A commonly used strategy for improving optimization algorithms is to restart the algorithm when it is believed to be trapped in an inferior part of the search space. Building on the recent success of Bet-and-Run approaches for restarted local search solvers, we introduce an improved generic Bet-and-Run strategy. The goal is to obtain the best possible results within a given time budget t using a given black-box optimization algorithm. If no prior knowledge about problem features and algorithm behavior is available, the question about how to use the time budget most efficiently arises. We propose to first start k>=1 independent runs of the algorithm during an initialization budget t1<t, pausing these runs, then apply a decision maker D to choose 1<=m<=k runs from them (consuming t2>=0 time units in doing so), and then continuing these runs for the remaining t3=t-t1-t2 time units. In previous Bet-and-Run strategies, the decision maker D=currentBest would simply select the run with the best- so-far results at negligible time. We propose using more advanced methods to discriminate between "good" and "bad" sample runs, with the goal of increasing the correlation of the chosen run with the a-posteriori best one. We test several different approaches, including neural networks trained or polynomials fitted on the current trace of the algorithm to predict which run may yield the best results if granted the remaining budget. We show with extensive experiments that this approach can yield better results than the previous methods, but also find that the currentBest method is a very reliable and robust baseline approach.

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

↑