No Wasting Time with Anytime Algorithms

How to Benchmark in Noisy Optimization

Boeh, Ramona, 2023

Type of Thesis Master Thesis
Client
Supervisor Hanne, Thomas
Views: 13 - Downloads: 1
A standardized, elaborated and well-argued performance metric for benchmarking anytime algorithms on noisy optimization problems is missing in the current benchmarking frameworks. This Thesis aims at developing the very as an artefact 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 are conducted with two state-of-the-art algorithms to assess the performance metric.
Based on the generated data and existing literature it is concluded that combining the loss value and the runtime as performance metric maximizes reliability, expressiveness and information content considering the relevance.
Studyprogram: Business Information Systems (Master)
Keywords anytime algorithms, noisy optimization, Evolutionary Algorithms, benchmarking, Evolutionary Computation, Black Box Optimization
Confidentiality: öffentlich
Type of Thesis
Master Thesis
Authors
Boeh, Ramona
Supervisor
Hanne, Thomas
Publication Year
2023
Thesis Language
English
Confidentiality
Public
Studyprogram
Business Information Systems (Master)
Location
Olten
Keywords
anytime algorithms, noisy optimization, Evolutionary Algorithms, benchmarking, Evolutionary Computation, Black Box Optimization