[HTML][HTML] A prescription of methodological guidelines for comparing bio-inspired optimization algorithms

A LaTorre, D Molina, E Osaba, J Poyatos… - Swarm and Evolutionary …, 2021 - Elsevier
Bio-inspired optimization (including Evolutionary Computation and Swarm Intelligence) is a
growing research topic with many competitive bio-inspired algorithms being proposed every …

Anytime performance assessment in blackbox optimization benchmarking

N Hansen, A Auger, D Brockhoff… - IEEE Transactions on …, 2022 - ieeexplore.ieee.org
We present concepts and recipes for the anytime performance assessment when
benchmarking optimization algorithms in a blackbox scenario. We consider runtime …

Revisiting Bayesian optimization in the light of the COCO benchmark

R Le Riche, V Picheny - Structural and Multidisciplinary Optimization, 2021 - Springer
It is commonly believed that Bayesian optimization (BO) algorithms are highly efficient for
optimizing numerically costly functions. However, BO is not often compared to widely …

Deep-ela: Deep exploratory landscape analysis with self-supervised pretrained transformers for single-and multi-objective continuous optimization problems

MV Seiler, P Kerschke, H Trautmann - Evolutionary Computation, 2025 - direct.mit.edu
In many recent works, the potential of Exploratory Landscape Analysis (ELA) features to
numerically characterize single-objective continuous optimization problems has been …

High dimensional Bayesian optimization assisted by principal component analysis

E Raponi, H Wang, M Bujny, S Boria… - Parallel Problem Solving …, 2020 - Springer
Bayesian Optimization (BO) is a surrogate-assisted global optimization technique that has
been successfully applied in various fields, eg, automated machine learning and design …

Expected improvement versus predicted value in surrogate-based optimization

F Rehbach, M Zaefferer, B Naujoks… - Proceedings of the …, 2020 - dl.acm.org
Surrogate-based optimization relies on so-called infill criteria (acquisition functions) to
decide which point to evaluate next. When Kriging is used as the surrogate model of choice …

Handling bound constraints in CMA-ES: An experimental study

R Biedrzycki - Swarm and Evolutionary Computation, 2020 - Elsevier
Bound constraints are the lower and upper limits defined for each coordinate of the solution.
There are many methods to deal with them, but there is no clear guideline for which of them …

Self-Adapting Particle Swarm Optimization for continuous black box optimization

M Okulewicz, M Zaborski, J Mańdziuk - Applied Soft Computing, 2022 - Elsevier
This paper introduces a new version of a hyper-heuristic framework: Generalized Self-
Adapting Particle Swarm Optimization with samples archive (M-GAPSO). This framework is …

[HTML][HTML] Benchmarking surrogate-based optimisation algorithms on expensive black-box functions

L Bliek, A Guijt, R Karlsson, S Verwer… - Applied Soft Computing, 2023 - Elsevier
Surrogate algorithms such as Bayesian optimisation are especially designed for black-box
optimisation problems with expensive objectives, such as hyperparameter tuning or …

Learning from Offline and Online Experiences: A Hybrid Adaptive Operator Selection Framework

J Pei, J Liu, Y Mei - Proceedings of the Genetic and Evolutionary …, 2024 - dl.acm.org
In many practical applications, usually, similar optimisation problems or scenarios
repeatedly appear. Learning from previous problem-solving experiences can help adjust …