cs.NENov 3, 2026

Refined CMA-ES for CEC 2026 Bound-Constrained Single-Objective Optimization

Authors: Adam Stelmaszczyk, Rafał Biedrzycki, Jarosław Arabas

Organizations: Institute of Computer Science, Warsaw University of Technology, Warsaw, Poland

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.

Figures & tables

Explore similar work

CardsList
  1. RCMAES: A Robust CMA-ES Variant for CEC2026 Competition

    Apr 29, 2026Khoirul Faiq Muzakka, Sören Möller, Martin FinsterbuschEvolutionary OptimizationBlack-Box Optimization

  2. RDEx-CSOP: Feasibility-Aware Reconstructed Differential Evolution with Adaptive epsilon-Constraint Ranking

    Mar 28, 2026Sichen Tao, Yifei Yang, Ruihan Zhao +3Constrained OptimizationDifferential Evolution

  3. MSC-CMA-ES: Structure-Aware Restarts for CMA-ES via Cyclic Nearest-Better Basin Discovery

    Jun 14, 2026Dimitar Nedanovski, Svetoslav Nenov, Dimitar PilevEvolutionary OptimizationCovariance Matrix Adaptation Evolution Strategy