109 citations · 277 across the 52 of their papers we have counts for
58 papers
The Modular CMA-ES: A Framework for Modern Evolution Strategies
Jacob de Nobel, Diederick Vermetten, Anna V. Kononova +2
Since their introduction, modern evolution strategies, such as the Covariance Matrix Adaptation Evolution Strategy (CMA-ES), have become established as powerful methods for continu…
Integer Natural Evolution Strategies
Jacob de Nobel, Diederick Vermetten, Hao Wang +3
While contemporary Evolution Strategies handle integer optimization problems effectively, their adaptation mechanism is grounded in -based Gaussian models, which are not na…
On the Influence of the Feature Computation Budget on Per-Instance Algorithm Selection for Black-Box Optimization
Koen van der Blom, Diederick Vermetten
Per-instance algorithm selection (PIAS) takes advantage of complementarity between a set of algorithms by deciding which algorithm to run on a given instance. This decision is base…
Similarity-based Portfolio Construction for Black-box Optimization
Catalin-Viorel Dinu, Diederick Vermetten, Carola Doerr
In black-box optimization, a central question is which algorithm to use to solve a given, previously unseen, problem. Selecting a single algorithm, however, entails inherent risks:…
Exploration of Pareto-preserving Search Space Transformations in Multi-objective Test Functions
Diederick Vermetten, Jeroen Rook
Benchmark problems are an important tool for gaining understanding of optimization algorithms. Since algorithms often aim to perform well on benchmarks, biases in benchmark design…
How Sequential Algorithm Portfolios can benefit Black Box Optimization
Catalin-Viorel Dinu, Diederick Vermetten, Carola Doerr
In typical black-box optimization applications, the available computational budget is often allocated to a single algorithm, typically chosen based on user preference with limited…
Benchmarking that Matters: Rethinking Benchmarking for Practical Impact
Anna V. Kononova, Niki van Stein, Olaf Mersmann +14
Benchmarking has driven scientific progress in Evolutionary Computation, yet current practices fall short of real-world needs. Widely used synthetic suites such as BBOB and CEC iso…
A Standardized Benchmark Set of Clustering Problem Instances for Comparing Black-Box Optimizers
Diederick Vermetten, Catalin-Viorel Dinu, Marcus Gallagher
One key challenge in optimization is the selection of a suitable set of benchmark problems. A common goal is to find functions which are representative of a class of real-world opt…
Abnormal Mutations: Evolution Strategies Don't Require Gaussianity
Jacob de Nobel, Diederick Vermetten, Hao Wang +3
The mutation process in evolution strategies has been interlinked with the normal distribution since its inception. Many lines of reasoning have been given for this strong dependen…
Transfer Learning of Surrogate Models: Integrating Domain Warping and Affine Transformations
Shuaiqun Pan, Diederick Vermetten, Manuel López-Ibáñez +2
Surrogate models provide efficient alternatives to computationally demanding real world processes but often require large datasets for effective training. A promising solution to t…
Transfer Learning of Surrogate Models via Domain Affine Transformation Across Synthetic and Real-World Benchmarks
Shuaiqun Pan, Diederick Vermetten, Manuel López-Ibáñez +2
Surrogate models are frequently employed as efficient substitutes for the costly execution of real-world processes. However, constructing a high-quality surrogate model often deman…
Stalling in Space: Attractor Analysis for any Algorithm
Sarah L. Thomson, Quentin Renau, Diederick Vermetten +3
Network-based representations of fitness landscapes have grown in popularity in the past decade; this is probably because of growing interest in explainability for optimisation alg…
MO-IOHinspector: Anytime Benchmarking of Multi-Objective Algorithms using IOHprofiler
Diederick Vermetten, Jeroen Rook, Oliver L. Preuß +5
Benchmarking is one of the key ways in which we can gain insight into the strengths and weaknesses of optimization algorithms. In sampling-based optimization, considering the anyti…
In-the-loop Hyper-Parameter Optimization for LLM-Based Automated Design of Heuristics
Niki van Stein, Diederick Vermetten, Thomas Bäck
Large Language Models (LLMs) have shown great potential in automatically generating and optimizing (meta)heuristics, making them valuable tools in heuristic optimization tasks. How…
Sampling in CMA-ES: Low Numbers of Low Discrepancy Points
Jacob de Nobel, Diederick Vermetten, Thomas H. W. Bäck +1
The Covariance Matrix Adaptation Evolution Strategy (CMA-ES) is one of the most successful examples of a derandomized evolution strategy. However, it still relies on randomly sampl…
Quantifying Individual and Joint Module Impact in Modular Optimization Frameworks
Ana Nikolikj, Ana Kostovska, Diederick Vermetten +2
This study explores the influence of modules on the performance of modular optimization frameworks for continuous single-objective black-box optimization. There is an extensive var…
Avoiding Redundant Restarts in Multimodal Global Optimization
Jacob de Nobel, Diederick Vermetten, Anna V. Kononova +2
Naïve restarts of global optimization solvers when operating on multimodal search landscapes may resemble the Coupon's Collector Problem, with a potential to waste significant func…
Empirical Analysis of the Dynamic Binary Value Problem with IOHprofiler
Diederick Vermetten, Johannes Lengler, Dimitri Rusin +2
Optimization problems in dynamic environments have recently been the source of several theoretical studies. One of these problems is the monotonic Dynamic Binary Value problem, whi…
Impact of Training Instance Selection on Automated Algorithm Selection Models for Numerical Black-box Optimization
Konstantin Dietrich, Diederick Vermetten, Carola Doerr +1
The recently proposed MA-BBOB function generator provides a way to create numerical black-box benchmark problems based on the well-established BBOB suite. Initial studies on this g…
Using the Empirical Attainment Function for Analyzing Single-objective Black-box Optimization Algorithms
Manuel López-Ibáñez, Diederick Vermetten, Johann Dreo +1
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 targe…
Explainable Benchmarking for Iterative Optimization Heuristics
Niki van Stein, Diederick Vermetten, Anna V. Kononova +1
Benchmarking heuristic algorithms is vital to understand under which conditions and on what kind of problems certain algorithms perform well. In most current research into heuristi…
Large-scale Benchmarking of Metaphor-based Optimization Heuristics
Diederick Vermetten, Carola Doerr, Hao Wang +2
The number of proposed iterative optimization heuristics is growing steadily, and with this growth, there have been many points of discussion within the wider community. One partic…
Impact of spatial transformations on landscape features of CEC2022 basic benchmark problems
Haoran Yin, Diederick Vermetten, Furong Ye +2
When benchmarking optimization heuristics, we need to take care to avoid an algorithm exploiting biases in the construction of the used problems. One way in which this might be don…
MA-BBOB: A Problem Generator for Black-Box Optimization Using Affine Combinations and Shifts
Diederick Vermetten, Furong Ye, Thomas Bäck +1
Choosing a set of benchmark problems is often a key component of any empirical evaluation of iterative optimization heuristics. In continuous, single-objective optimization, severa…