paper-with-me

Papers

IOHanalyzer: Detailed Performance Analyses for Iterative Optimization Heuristics

2020-07-08 · Hao Wang, Diederick Vermetten, Furong Ye, Carola Doerr, Thomas Bäck

Benchmarking and performance analysis play an important role in understanding the behaviour of iterative optimization heuristics (IOHs) such as local search algorithms, genetic and evolutionary algorithms, Bayesian optimization algorithms, etc. This task, however, involves manual setup, execution, and analysis of the experiment on an individual basis, which is laborious and can be mitigated by a generic and well-designed platform. For this purpose, we propose IOHanalyzer, a new user-friendly tool for the analysis, comparison, and visualization of performance data of IOHs. Implemented in R and C++, IOHanalyzer is fully open source. It is available on CRAN and GitHub. IOHanalyzer provides detailed statistics about fixed-target running times and about fixed-budget performance of the benchmarked algorithms with a real-valued codomain, single-objective optimization tasks. Performance aggregation over several benchmark problems is possible, for example in the form of empirical cumulative distribution functions. Key advantages of IOHanalyzer over other performance analysis packages are its highly interactive design, which allows users to specify the performance measures, ranges, and granularity that are most useful for their experiments, and the possibility to analyze not only performance traces, but also the evolution of dynamic state parameters. IOHanalyzer can directly process performance data from the main benchmarking platforms, including the COCO platform, Nevergrad, the SOS platform, and IOHexperimenter. An R programming interface is provided for users preferring to have a finer control over the implemented functionalities.

📄 PDF Abstract BibTeX arXiv:2007.03953

Code (3)

IOHprofiler/IOHAnalyzer 공식 구현
IOHprofiler/Analyzer
IOHprofiler/Post-Processing

Tasks

Bayesian OptimizationBenchmarkingEvolutionary Algorithms

Similar Papers 제목 키워드 기반

IOHexperimenter: Benchmarking Platform for Iterative Optimization Heuristics

2021-11-07 · Jacob de Nobel, Furong Ye, Diederick Vermetten, Hao Wang 외

We present IOHexperimenter, the experimentation module of the IOHprofiler project, which aims at providing an easy-to-use and highly customizable toolbox for benchmarking iterative optimization heuristics such as local s…

Bayesian OptimizationBenchmarking

Using the Empirical Attainment Function for Analyzing Single-objective Black-box Optimization Algorithms

2024-04-02 · Manuel López-Ibáñez, Diederick Vermetten, Johann Dreo, Carola Doerr

A widely accepted way to assess the performance of iterative black-box optimizers is to analyze their empirical cumulative distribution function (ECDF) of pre-defined quality targets achieved not later than a given runti…

MA-BBOB: Many-Affine Combinations of BBOB Functions for Evaluating AutoML Approaches in Noiseless Numerical Black-Box Optimization Contexts

2023-06-18 · Diederick Vermetten, Furong Ye, Thomas Bäck, Carola Doerr

Extending a recent suggestion to generate new instances for numerical black-box optimization benchmarking by interpolating pairs of the well-established BBOB functions from the COmparing COntinuous Optimizers (COCO) plat…

AutoMLBenchmarking

PromptAgent: Strategic Planning with Language Models Enables Expert-level Prompt Optimization

2023-10-25 · Xinyuan Wang, Chenxi Li, Zhen Wang, Fan Bai 외

Highly effective, task-specific prompts are often heavily engineered by experts to integrate detailed instructions and domain insights based on a deep understanding of both instincts of large language models (LLMs) and t…

Navigate

Fixed-Target Runtime Analysis

2020-04-20 · Maxim Buzdalov, Benjamin Doerr, Carola Doerr, Dmitry Vinokurov

Runtime analysis aims at contributing to our understanding of evolutionary algorithms through mathematical analyses of their runtimes. In the context of discrete optimization problems, runtime analysis classically studie…

Evolutionary Algorithms