协方差矩阵自适应演化策略的在线搜索历史辅助重启策略
On-line Search History-assisted Restart Strategy for Covariance Matrix Adaptation Evolution Strategy
摘要:
重启策略有助于协方差矩阵自适应演化策略(CMA-ES)提高寻优过程中找到全局最优解的概率,但单次运行的CMA-ES容易陷入局部最优解。在本文中,连续的非重访遗传算法(cNrGA)被用来帮助CMA-ES实现从不同的子区域的搜索空间的多次重新启动。提出了一种基于在线搜索历史辅助重启策略的CMA-ES(HR-CMA-ES)。cNrGA的整个在线搜索历史存储在二进制空间划分(BSP)树中,这对于执行局部搜索是有效的。频繁采样的子区域由BSP树中的深位置反映。当叶节点位于比阈值更深时,对应的子区域被认为是感兴趣区域(ROI)。在HR-CMA-ES中,cNrGA负责全局探索并为CMA-ES建议ROI,以在ROI内或周围执行利用。CMA-ES在每个建议的ROI中独立重启。cNrGA的非重访机制避免了第二次建议相同的ROI。在CEC 2013和2017基准套件上的实验结果表明,HR-CMA-ES的性能优于CMA-ES和cNrGA。一个积极的协同作用,观察两个算法的模因合作。
英文摘要:
Restart strategy helps the covariance matrix adaptation evolution strategy (CMA-ES) to increase the probability of finding the global optimum in optimization, while a single run CMA-ES is easy to be trapped in local optima. In this paper, the continuous non-revisiting genetic algorithm (cNrGA) is used to help CMA-ES to achieve multiple restarts from different sub-regions of the search space. The CMA-ES with on-line search history-assisted restart strategy (HR-CMA-ES) is proposed. The entire on-line search history of cNrGA is stored in a binary space partitioning (BSP) tree, which is effective for performing local search. The frequently sampled sub-region is reflected by a deep position in the BSP tree. When leaf nodes are located deeper than a threshold, the corresponding sub-region is considered a region of interest (ROI). In HR-CMA-ES, cNrGA is responsible for global exploration and suggesting ROI for CMA-ES to perform an exploitation within or around the ROI. CMA-ES restarts independently in each suggested ROI. The non-revisiting mechanism of cNrGA avoids to suggest the same ROI for a second time. Experimental results on the CEC 2013 and 2017 benchmark suites show that HR-CMA-ES performs better than both CMA-ES and cNrGA. A positive synergy is observed by the memetic cooperation of the two algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。