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.
Cooperative coevolutionary Modified Differential Evolution with Distance-based Selection for Large-Scale Optimization Problems in noisy environments through an automatic Random Grouping
Multi-population Ensemble Genetic Programming via Cooperative Coevolution and Multi-view Learning for Classification
Faculty of Engineering & Information Technology, University of Technology Sydney(工程与信息科技学院,技术悉尼大学);Department of Civil and Architectural Engineering, Sultan Qaboos University(土木与建筑工程系,苏丹·卡布斯大学);University Research and Innovation Center (EKIK), Obuda University(研究与创新中心(EKIK),奥布达大学)
Accelerating the Genetic Algorithm for Large-scale Traveling Salesman Problems by Cooperative Coevolutionary Pointer Network with Reinforcement Learning
Grad. School of Info. Science;Technology Hokkaido University Sapporo, Japan \ .;Technology Hokkaido University Sapporo, Japan;Information Initiative Center Hokkaido University Sapporo, Japan
A Composite Decomposition Method for Large-Scale Global Optimization
East China University of Science and Technology(华东理工大学);Southern University of Science and Technology(南方科技大学);Westlake University(西湖大学);Oklahoma State University(俄克拉荷马州立大学)