Pith. sign in

REVIEW 1 cited by

Advancing CMA-ES with Learning-Based Cooperative Coevolution for Scalable Optimization

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2504.17578 v1 pith:FUY4762B submitted 2025-04-24 cs.LG cs.NE

Advancing CMA-ES with Learning-Based Cooperative Coevolution for Scalable Optimization

classification cs.LG cs.NE
keywords optimizationcoevolutioncooperativedecompositionproblemslearning-basednetworkprocesses
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original 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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Neural Operator-enabled Topology-informed Evolutionary Strategy for PDE-Constrained Optimization

    cs.LG 2026-07 conditional novelty 5.0

    NOTES couples a DeepONet topology decoder with CMA-ES in a PCA-derived latent space, achieving >95% deflection efficiency on nanophotonic metagratings and compliance of 246 on MBB beams, outperforming direct CMA-ES an...