Tracing the Interactions of Modular CMA-ES Configurations Across Problem Landscapes

• URL: http://arxiv.org/abs/2507.02331v1
• Date: Thu, 03 Jul 2025 05:48:58 GMT
• Title: Tracing the Interactions of Modular CMA-ES Configurations Across Problem Landscapes
• Abstract summary: Performance footprints are calculated for six modular variants of the CMA-ES algorithm (modCMA), evaluated on 24 benchmark problems.<n>Our analysis uncovers shared behavioral patterns across configurations due to common interactions with problem properties, as well as distinct behaviors on the same problem driven by differing problem features.
• Score: 2.732041684677653
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: This paper leverages the recently introduced concept of algorithm footprints to investigate the interplay between algorithm configurations and problem characteristics. Performance footprints are calculated for six modular variants of the CMA-ES algorithm (modCMA), evaluated on 24 benchmark problems from the BBOB suite, across two-dimensional settings: 5-dimensional and 30-dimensional. These footprints provide insights into why different configurations of the same algorithm exhibit varying performance and identify the problem features influencing these outcomes. Our analysis uncovers shared behavioral patterns across configurations due to common interactions with problem properties, as well as distinct behaviors on the same problem driven by differing problem features. The results demonstrate the effectiveness of algorithm footprints in enhancing interpretability and guiding configuration choices.

Related papers

• The impact of objective interactions on the performance of massive objective optimization algorithms [0.5219568203653523]
  We evaluate several state-of-the-art evolutionary algorithms including NSGA-II, NSGA-III, MOEA/D and lexicase selection.<n>Experiments reveal that problem characteristics significantly affect algorithm performance.<n>We also show that lexicase selection, an algorithm originally designed for genetic programming, compares favorably with state-of-the-art many-objective optimization algorithms.
  arXiv  Detail & Related papers  (2026-07-15T02:06:30Z)
• Backscatter Device-aided Integrated Sensing and Communication: A Pareto Optimization Framework [59.30060797118097]
  Integrated sensing and communication (ISAC) systems potentially encounter significant performance degradation in densely obstructed urban non-line-of-sight scenarios.<n>This paper proposes a backscatter approximation (BD)-assisted ISAC system, which leverages passive BDs naturally distributed in environments of enhancement.
  arXiv  Detail & Related papers  (2025-07-12T17:11:06Z)
• Geometric Learning in Black-Box Optimization: A GNN Framework for Algorithm Performance Prediction [3.673004818820981]
  This work explores the use of graph data structures and graph neural networks to predict the performance of optimization algorithms.<n>We focus on two modular frameworks, modCMA-ES and modDE, which decompose two widely used derivative-free optimization algorithms.<n>We evaluate 324 modCMA-ES and 576 modDE variants on 24 BBOB problems across six runtime budgets and two problem dimensions.
  arXiv  Detail & Related papers  (2025-06-19T08:56:05Z)
• Subfunction Structure Matters: A New Perspective on Local Optima Networks [0.0]
  Local optima networks (LONs) capture fitness information landscape.<n>We consider how LON analysis can be improved by incorporating subfunction-based information.
  arXiv  Detail & Related papers  (2025-04-17T07:31:11Z)
• Benchmarking Randomized Optimization Algorithms on Binary, Permutation, and Combinatorial Problem Landscapes [8.337399973715396]
  We evaluate the performance of four randomized optimization algorithms: Randomized Hill Climbing (RHC), Simulated Annealing (SA), Genetic Algorithms (GA), and MIMIC.<n>We compare these algorithms using a set of benchmark fitness functions that highlight the specific challenges and requirements of each problem category.<n>Our study analyzes each algorithm's effectiveness based on key performance metrics, including solution quality, convergence speed, computational cost, and robustness.
  arXiv  Detail & Related papers  (2025-01-21T23:13:01Z)
• A Deep Dive into Effects of Structural Bias on CMA-ES Performance along Affine Trajectories [0.0]
  This study explores the impact of structural bias in the modular Comodvariance Matrix Adaptation Evolution Strategy (modCMA) Through an investigation involving 435,456 configurations of modCMA, we identified key modules that significantly influence structural bias of various classes. Our results demonstrate an interplay between module-induced structural bias and algorithm performance across different landscape characteristics.
  arXiv  Detail & Related papers  (2024-04-26T11:07:09Z)
• Robustness and Exploration of Variational and Machine Learning Approaches to Inverse Problems: An Overview [47.34359815600974]
  This paper provides an overview of current approaches for solving inverse problems in imaging using variational methods and machine learning. A special focus lies on point estimators and their robustness against adversarial perturbations.
  arXiv  Detail & Related papers  (2024-02-19T11:48:11Z)
• AbCD: A Component-wise Adjustable Framework for Dynamic Optimization Problems [49.1574468325115]
  Dynamic Optimization Problems (DOPs) are characterized by changes in the fitness landscape that can occur at any time and are common in real world applications. We develop a component-oriented framework for DOPs called Adjustable Components for Dynamic Problems (AbCD) Our results highlight existing problems in the DOP field that need to be addressed in the future development of algorithms and components.
  arXiv  Detail & Related papers  (2023-10-09T08:11:31Z)
• Stability Analysis of Unfolded WMMSE for Power Allocation [80.71751088398209]
  Power allocation is one of the fundamental problems in wireless networks. It is essential that the output power allocation of these algorithms is stable with respect to input perturbations. In this paper, we focus on UWMMSE, a modern algorithm leveraging graph neural networks.
  arXiv  Detail & Related papers  (2021-10-14T15:44:19Z)
• An Overview and Experimental Study of Learning-based Optimization Algorithms for Vehicle Routing Problem [49.04543375851723]
  Vehicle routing problem (VRP) is a typical discrete optimization problem. Many studies consider learning-based optimization algorithms to solve VRP. This paper reviews recent advances in this field and divides relevant approaches into end-to-end approaches and step-by-step approaches.
  arXiv  Detail & Related papers  (2021-07-15T02:13:03Z)
• A review of approaches to modeling applied vehicle routing problems [77.34726150561087]
  We review the approaches for modeling vehicle routing problems. We formulate several criteria for evaluating modeling methods. We discuss several future research avenues in the field of modeling VRP domains.
  arXiv  Detail & Related papers  (2021-05-23T14:50:14Z)
• Semantic Change Detection with Asymmetric Siamese Networks [71.28665116793138]
  Given two aerial images, semantic change detection aims to locate the land-cover variations and identify their change types with pixel-wise boundaries. This problem is vital in many earth vision related tasks, such as precise urban planning and natural resource management. We present an asymmetric siamese network (ASN) to locate and identify semantic changes through feature pairs obtained from modules of widely different structures.
  arXiv  Detail & Related papers  (2020-10-12T13:26:30Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.