On the Performance Evaluation of Anytime Algorithms in Noisy Optimization

A standardized, elaborate and well-argued performance metric for benchmarking anytime algorithms on noisy optimization problems is missing in the current benchmarking frameworks. This research aims at developing such a metric as an artifact by following the Design Science Research methodology. Existing noise handling practices and benchmarking guidelines are reviewed. Benchmarking experiments, including a test suite containing 13 artificial test functions, were conducted with two state-of-the-art algorithms to assess the performance metric. Based on the experimental results and the existing literature, this study concludes that, rather than relying on a single quantitative value, algorithm performance should be assessed through a comprehensive performance report comprising the numerical loss value, the number of function evaluations, wall-clock runtime, and a performance profile illustrating the trajectory of loss values over time. This approach aims to maximize the reliability, expressiveness, and informational value of performance assessments.

Authors

Institutions

Publication Details

Journal
Mathematics
Published
2026-10-29
DOI
https://doi.org/10.3390/math14213958
Primary Topic
Metaheuristic Optimization Algorithms Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On the Performance Evaluation of Anytime Algorithms in Noisy Optimization

Ramona Boeh, Thomas Hanne
1 links
Mathematics
Metaheuristic Optimization Algorithms Research
article

On the Performance Evaluation of Anytime Algorithms in Noisy Optimization

Ramona Boeh, Thomas Hanne
article en

Abstract

A standardized, elaborate and well-argued performance metric for benchmarking anytime algorithms on noisy optimization problems is missing in the current benchmarking frameworks. This research aims at developing such a metric as an artifact by following the Design Science Research methodology. Existing noise handling practices and benchmarking guidelines are reviewed. Benchmarking experiments, including a test suite containing 13 artificial test functions, were conducted with two state-of-the-art algorithms to assess the performance metric. Based on the experimental results and the existing literature, this study concludes that, rather than relying on a single quantitative value, algorithm performance should be assessed through a comprehensive performance report comprising the numerical loss value, the number of function evaluations, wall-clock runtime, and a performance profile illustrating the trajectory of loss values over time. This approach aims to maximize the reliability, expressiveness, and informational value of performance assessments.

MathematicsVol. 14(21)
FHNW University of Applied Sciences and Arts Northwestern Switzerland (CH)
Openalex Percentile: Top 14%
Metaheuristic Optimization Algorithms Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon