85 citations · 897 across the 89 of their papers we have counts for
76 papers · 1 filter
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…
Comparing Algorithm Selection Approaches on Black-Box Optimization Problems
Ana Kostovska, Anja Jankovic, Diederick Vermetten +3
Performance complementarity of solvers available to tackle black-box optimization problems gives rise to the important task of algorithm selection (AS). Automated AS approaches can…
Computing Star Discrepancies with Numerical Black-Box Optimization Algorithms
François Clément, Diederick Vermetten, Jacob de Nobel +3
The star discrepancy is a measure for the regularity of a finite set of points taken from . Low discrepancy point sets are highly relevant for Quasi-Monte Car…
Algorithm Instance Footprint: Separating Easily Solvable and Challenging Problem Instances
Ana Nikolikj, Sašo Džeroski, Mario Andrés Muñoz +3
In black-box optimization, it is essential to understand why an algorithm instance works on a set of problem instances while failing on others and provide explanations of its behav…
Using Affine Combinations of BBOB Problems for Performance Assessment
Diederick Vermetten, Furong Ye, Carola Doerr
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…
Tight Runtime Bounds for Static Unary Unbiased Evolutionary Algorithms on Linear Functions
Carola Doerr, Duri Andrea Janett, Johannes Lengler
In a seminal paper in 2013, Witt showed that the (1+1) Evolutionary Algorithm with standard bit mutation needs time to find the optimum of any linear function…