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

采用Wang-Landau采样和慢速自适应游动的搜索空间分析

Search space analysis with Wang-Landau sampling and slow adaptive walks

Susan Khor

摘要:

提出了两种用于分析搜索空间的互补技术:(i)检测具有潜在局部最优的搜索点的算法;以及(ii)略微调整的Wang-Landau采样算法,以探索更大的搜索空间。检测算法假设局部最优点是由缓慢的自适应步行者更容易到达和更难离开的点。一个缓慢的适应性步行者移动到最近的更适合的点。因此,使用局部最优得分公式将具有相对于传入步长更大的传出步长的点标记为潜在局部最优点(PLOP)。在这些更一般的术语中定义局部最优允许它们在搜索空间的子集的闭包内被检测,并且允许对不受特定移动集合束缚的搜索空间进行采样。用NK和HIFF问题进行测试,以确认以所提出的方式检测到的PLOP保留局部最优的特性,并且调整后的Wang-Landau样本比通过随机均匀选择点产生的样本更能代表搜索空间。虽然我们的方法显示出了希望,但需要做更多的工作来降低其计算成本,这可能会为分析更大的搜索空间的实际意义铺平道路。

英文摘要:

Two complementary techniques for analyzing search spaces are proposed: (i) an algorithm to detect search points with potential to be local optima; and (ii) a slightly adjusted Wang-Landau sampling algorithm to explore larger search spaces. The detection algorithm assumes that local optima are points which are easier to reach and harder to leave by a slow adaptive walker. A slow adaptive walker moves to a nearest fitter point. Thus, points with larger outgoing step sizes relative to incoming step sizes are marked using the local optima score formulae as potential local optima points (PLOPs). Defining local optima in these more general terms allows their detection within the closure of a subset of a search space, and the sampling of a search space unshackled by a particular move set. Tests are done with NK and HIFF problems to confirm that PLOPs detected in the manner proposed retain characteristics of local optima, and that the adjusted Wang-Landau samples are more representative of the search space than samples produced by choosing points uniformly at random. While our approach shows promise, more needs to be done to reduce its computation cost that it may pave a way toward analyzing larger search spaces of practical meaning.

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

↑