Refined CMA-ES for CEC 2026 Bound-Constrained Single-Objective Optimization
Adam Stelmaszczyk, Rafał Biedrzycki, Jarosław Arabas
Abstract
We present a simplified and parameter-adjusted variant of CMA-ES designed for the CEC 2026 Bound-Constrained Single-Objective Optimization competition. Unlike typical algorithmic developments that increase complexity by adding mechanisms, Refined CMA-ES systematically removes components that do not improve performance, such as the flat-land escape, while retaining standard features that provide measurable benefits. Adjusting key parameters (population size and initial step-size) yields substantial gains, outperforming the baseline CMA-ES and several state-of-the-art competitors. The paper highlights the practical relevance of individual CMA-ES components under the CEC 2026 ranking, which equally weights solution accuracy and convergence speed, demonstrating that simplification combined with improved parameter settings can lead to superior performance.
Create a lesson
Related papers
HyVox: Rethinking Low-Power Voice Intelligence towards Neuromorphic-von Neumann Edge Computing
Snehasis Addy, Eduardo Calle Ortiz, Prashant Shenoy et al.
Exposure-Length Trade-off Optimization for Obstacle-Aware Intrusion Paths in Heterogeneous Wireless Sensor Networks
Nguyen Thi My Binh, Ho Viet Duc Luong, Nguyen Tuan Nghia et al.
Is Newborn Wiring Special? Separating Wiring from Weight Placement in Connectome Reservoirs
Riccardo Bertamini, Corrado Calamita, Ramiro Pascual et al.
Input-dependent Neuromodulation Enhances Mixed-Signal Neuromorphic Hardware
Aashman Mehta, AbdelQader AlKilany, Dan F. M. Goodman et al.
Memory and Recall of Color Images Using Neural Networks-1 - The Cue-Ball Model based on the Associative Memory Mechanism -
Hiroshi Inazawa
Local Budget Benefits, Population Commitment, and Solver Performance: A DGO Case Study with Controlled DE Transfer
Shiqi Li