arXiv · 2504.17578
Advancing CMA-ES with Learning-Based Cooperative Coevolution for Scalable Optimization
Abstract
Recent research in Cooperative Coevolution~(CC) have achieved promising progress in solving large-scale global optimization problems. However, existing CC paradigms have a primary limitation in that they require deep expertise for selecting or designing effective variable decomposition strategies. Inspired by advancements in Meta-Black-Box Optimization, this paper introduces LCC, a pioneering learning-based cooperative coevolution framework that dynamically schedules decomposition strategies during optimization processes. The decomposition strategy selector is parameterized through a neural network, which processes a meticulously crafted set of optimization status features to determine the optimal strategy for each optimization step. The network is trained via the Proximal Policy Optimization method in a reinforcement learning manner across a collection of representative problems, aiming to maximize the expected optimization performance. Extensive experimental results demonstrate that LCC not only offers certain advantages over state-of-the-art baselines in terms of optimization effectiveness and resource consumption, but it also exhibits promising transferability towards unseen problems.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Hongshu Guo, Wenjie Qiu, Zeyuan Ma, Xinglin Zhang, Jun Zhang, Yue-Jiao Gong. 2025-04-24. Advancing CMA-ES with Learning-Based Cooperative Coevolution for Scalable Optimization. https://arxiv.org/abs/2504.17578
Cite the original work for its findings. Save a collection to share your selection of sources.