Using Affine Combinations of BBOB Problems for Performance Assessment - Sorbonne Université Access content directly
Conference Papers Year : 2023

Using Affine Combinations of BBOB Problems for Performance Assessment


Benchmarking plays a major role in the development and analysis of optimization algorithms. As such, the way in which the used benchmark problems are defined significantly affects the insights that can be gained from any given benchmark study. One way to easily extend the range of available benchmark functions is through affine combinations between pairs of functions. From the perspective of landscape analysis, these function combinations smoothly transition between the two base functions. In this work, we show how these affine function combinations can be used to analyze the behavior of optimization algorithms. In particular, we highlight that by varying the weighting between the combined problems, we can gain insights into the effects of added global structure on the performance of optimization algorithms. By analyzing performance trajectories on more function combinations, we also show that aspects such as the scaling of objective functions and placement of the optimum can greatly impact how these results are interpreted.
Fichier principal
Vignette du fichier
Affine_BBOB_with_Nevergrad_Algorithms-HAL.pdf (2.75 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-04180579 , version 1 (12-08-2023)



Diederick Vermetten, Furong Ye, Carola Doerr. Using Affine Combinations of BBOB Problems for Performance Assessment. GECCO '23: Genetic and Evolutionary Computation Conference, Jul 2023, Lisbon, Portugal. pp.873-881, ⟨10.1145/3583131.3590412⟩. ⟨hal-04180579⟩
7 View
4 Download



Gmail Facebook X LinkedIn More