When designing a benchmark problem set, it is important to create a set of benchmark problems that are a good generalization of the set of all possible problems. One possible way of easing this difficult task is by using artificially generated problems. In this paper, one such single-objective continuous problem generation approach is analyzed and compared with the COCO benchmark problem set, a well know problem set for benchmarking numerical optimization algorithms. Using Exploratory Landscape Analysis and Singular Value Decomposition, we show that such representations allow us to further explore the relations between the problems by applying visualization and correlation analysis techniques, with the goal of decreasing the bias in benchmark problem assessment.
@article{arxiv.2104.13060,
title = {A Complementarity Analysis of the COCO Benchmark Problems and Artificially Generated Problems},
author = {Urban Škvorc and Tome Eftimov and Peter Korošec},
journal= {arXiv preprint arXiv:2104.13060},
year = {2021}
}
Comments
To appear in the Proceedings of Genetic and Evolutionary Computation Conference Companion (GECCO 2021), ACM