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

不可分大规模黑盒优化的协同协进化:收敛性分析与分布式加速

Cooperative Coevolution for Non-Separable Large-Scale Black-Box Optimization: Convergence Analyses and Distributed Accelerations

Qiqi Duan, Chang Shao, Guochen Zhou, Haobin Yang, Qi Zhao, Yuhui Shi

AI总结:

本文分析了协同协进化在不可分大规模黑盒优化中的表现,提出连续博弈模型和分层分解策略,并结合多级学习框架与CMA-ES实现分布式加速,实验验证了其搜索性能与可扩展性。

摘要:

鉴于不可分优化问题在现实世界中无处不在,本文分析并扩展了著名的协同协进化(CC)的大规模版本,这是一个分而治之的黑盒优化框架,并将其应用于不可分函数。首先,我们揭示了在实践中某些不可分大规模问题上何时适合或不适合使用基于分解方法的经验性原因,这一点在许多先前的CC论文中并未明确指出。然后,我们通过简化将CC形式化为一个连续博弈模型,但未失去其本质属性。与先前的CC演化博弈论不同,我们的新模型提供了一个更简单但有用的视角来分析其收敛性,因为只需要纯纳什均衡概念,并且可以显式考虑更一般的适应度景观。基于收敛性分析,我们提出了一种分层分解策略以获得更好的泛化能力,因为对于任何分解,都存在陷入次优纳什均衡的风险。最后,我们利用强大的分布式计算在最近的多级学习框架下对其进行加速,该框架将来自分解的微调能力与CMA-ES的不变性属性相结合。在一组高维测试函数上的实验验证了其在拥有400个CPU核心的集群计算平台上的搜索性能和可扩展性(关于CPU核心)。

英文摘要:

Given the ubiquity of non-separable optimization problems in real worlds, in this paper we analyze and extend the large-scale version of the well-known cooperative coevolution (CC), a divide-and-conquer black-box optimization framework, on non-separable functions. First, we reveal empirical reasons of when decomposition-based methods are preferred or not in practice on some non-separable large-scale problems, which have not been clearly pointed out in many previous CC papers. Then, we formalize CC to a continuous-game model via simplification, but without losing its essential property. Different from previous evolutionary game theory for CC, our new model provides a much simpler but useful viewpoint to analyze its convergence, since only the pure Nash equilibrium concept is needed and more general fitness landscapes can be explicitly considered. Based on convergence analyses, we propose a hierarchical decomposition strategy for better generalization, as for any decomposition, there is a risk of getting trapped into a suboptimal Nash equilibrium. Finally, we use powerful distributed computing to accelerate it under the recent multi-level learning framework, which combines the fine-tuning ability from decomposition with the invariance property of CMA-ES. Experiments on a set of high-dimensional test functions validate both its search performance and scalability (w.r.t. CPU cores) on a clustering computing platform with 400 CPU cores.

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

↑