Computational and Exploratory Landscape Analysis of the GKLS Generator

Jakub Kudela, Martin Juricek
4/18/2023
cs.NEcs.AImath.OC

No confident code implementation found for this paper.

Abstract

The GKLS generator is one of the most used testbeds for benchmarking global optimization algorithms. In this paper, we conduct both a computational analysis and the Exploratory Landscape Analysis (ELA) of the GKLS generator. We utilize both canonically used and newly generated classes of GKLS-generated problems and show their use in benchmarking three state-of-the-art methods (from evolutionary and deterministic communities) in dimensions 5 and 10. We show that the GKLS generator produces ``needle in a haystack'' type problems that become extremely difficult to optimize in higher dimensions. Furthermore, we conduct the ELA on the GKLS generator and then compare it to the ELA of two other widely used benchmark sets (BBOB and CEC 2014), and discuss the meaningfulness of the results.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{kudela2023computational,
  title  = {Computational and Exploratory Landscape Analysis of the GKLS Generator},
  author = {Jakub Kudela and Martin Juricek},
  year   = {2023},
  eprint = {2304.08913},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2304.08913v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2304.08913.svg)](https://codeofpaper.com/paper/2304.08913)

Discussion