Analyzing black-box optimization algorithms - why and how?

Read full text Summarise with VIRAT
Authors: Carola Doerr
Cited by: 0

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

Many real-world optimization challenges are significantly harder than the scenarios that can be rigorously analyzed by mathematical means. In addition, practitioners often lack time and resources to develop problem-specific solution strategies, they therefore need to rely on general-purpose optimization heuristics such as local search variants, evolutionary and genetic algorithms, Bayesian optimization techniques, and similar. Unfortunately, practitioners often choose and apply these algorithms without much guidance from the scientific community.With this presentation, we will discuss how (theoretical and empirical) research can be used to develop more principled usage of these randomized optimization heuristics.

Fields of Study & Subjects

Metaheuristic Optimization Algorithms Research Stochastic Gradient Optimization Techniques Advanced Bandit Algorithms Research

Publication details

Publication date
1 January 2026
Language
EN