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

演化演化策略的结构

Evolving the Structure of Evolution Strategies

Sander van Rijn, Hao Wang, Matthijs van Leeuwen, Thomas Bäck

摘要:

近年来,人们提出了各种改进的协方差矩阵自适应演化策略(CMA-ES),通过对原有算法的结构进行改进,提高了算法的经验性能。然而,在实践中,通常不清楚哪种变化最适合手头的特定优化问题。作为解决这个问题的一种方法,附加到CMA-ES变体的算法机制被考虑并提取为功能性\emph{modules},允许它们的组合。这导致了一个配置空间的ES结构,这使得算法结构的探索,并铺平了道路,朝着新的算法生成。具体而言,11个模块被纳入该框架中,每个模块具有两个或三个替代配置,从而产生$4\,608$算法。一个自适应遗传算法(GA)是用来有效地发展有效的ES-结构为给定类的优化问题,优于任何经典的CMA-ES变体从文献中。所提出的方法进行评估,无噪声功能从BBOB套件。此外,这样的观察再次证实了不同的功能组和维度,表明ES配置的可行性,对现实世界的问题类。

英文摘要:

Various variants of the well known Covariance Matrix Adaptation Evolution Strategy (CMA-ES) have been proposed recently, which improve the empirical performance of the original algorithm by structural modifications. However, in practice it is often unclear which variation is best suited to the specific optimization problem at hand. As one approach to tackle this issue, algorithmic mechanisms attached to CMA-ES variants are considered and extracted as functional \emph{modules}, allowing for combinations of them. This leads to a configuration space over ES structures, which enables the exploration of algorithm structures and paves the way toward novel algorithm generation. Specifically, eleven modules are incorporated in this framework with two or three alternative configurations for each module, resulting in $4\,608$ algorithms. A self-adaptive Genetic Algorithm (GA) is used to efficiently evolve effective ES-structures for given classes of optimization problems, outperforming any classical CMA-ES variants from literature. The proposed approach is evaluated on noiseless functions from BBOB suite. Furthermore, such an observation is again confirmed on different function groups and dimensionality, indicating the feasibility of ES configuration on real-world problem classes.

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

↑