LeadingOnes随机局部搜索邻域大小的简单超算法优化
Simple Hyper-heuristics Control the Neighbourhood Size of Randomised Local Search Optimally for LeadingOnes
摘要:
选择HH是随机搜索方法,其在优化过程期间从一组低级搜索中选择并执行搜索。机器学习机制通常用于决定在每个决策步骤中应应用哪个低级启发式。在本文中,我们分析复杂的学习机制是否总是必要的HH执行良好。为此,我们认为最简单的HHS从文献和严格分析其性能的LeadingOnes功能。我们的分析表明,标准的简单随机,置换,贪婪和随机梯度HH没有显示出学习的迹象。虽然以前的HH并不试图从低级启发式的过去表现中学习,但随机梯度HH背后的想法是只要成功就继续利用当前选择的启发式。因此,它嵌入了具有最短记忆的强化学习机制。然而,当扰动组合优化问题的合理解时,有希望的启发式在下一步中成功的概率相对较低。我们概括了简单的随机梯度HH,因此可以在固定的时间段τ内测量成功,而不是单次迭代。对于LO,我们证明了广义随机梯度HH可以在运行过程中学习适应RLS的邻域大小以达到最优。我们证明了它具有最好的性能,可实现与低级别的算法。我们还证明了HH的性能提高作为低级别的本地搜索算法选择的数量增加。最后,我们表明,GRG的优势,RLS和EA使用标准位变异增加,如果考虑到随时性能。实验分析证实了这些结果不同的问题大小。
英文摘要:
Selection HHs are randomised search methodologies which choose and execute heuristics during the optimisation process from a set of low-level heuristics. A machine learning mechanism is generally used to decide which low-level heuristic should be applied in each decision step. In this paper we analyse whether sophisticated learning mechanisms are always necessary for HHs to perform well. To this end we consider the most simple HHs from the literature and rigorously analyse their performance for the LeadingOnes function. Our analysis shows that the standard Simple Random, Permutation, Greedy and Random Gradient HHs show no signs of learning. While the former HHs do not attempt to learn from the past performance of low-level heuristics, the idea behind the Random Gradient HH is to continue to exploit the currently selected heuristic as long as it is successful. Hence, it is embedded with a reinforcement learning mechanism with the shortest possible memory. However, the probability that a promising heuristic is successful in the next step is relatively low when perturbing a reasonable solution to a combinatorial optimisation problem. We generalise the simple Random Gradient HH so success can be measured over a fixed period of time tau, instead of a single iteration. For LO we prove that the Generalised Random Gradient HH can learn to adapt the neighbourhood size of RLS to optimality during the run. We prove it has the best possible performance achievable with the low-level heuristics. We also prove that the performance of the HH improves as the number of low-level local search heuristics to choose from increases. Finally, we show that the advantages of GRG over RLS and EAs using standard bit mutation increase if the anytime performance is considered. Experimental analyses confirm these results for different problem sizes.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。