A Survey of Methods for Automated Algorithm Configuration

Algorithm configuration (AC) is concerned with the automated search of the most suitable parameter configuration of a parametrized algorithm. There is currently a wide variety of AC problem variants and methods proposed in the literature. Existing reviews do not take into account all derivatives of...

Full description

Saved in:

Bibliographic Details
Published in:	arXiv.org
Main Authors:	Schede, Elias, Brandt, Jasmin, Tornede, Alexander, Wever, Marcel, Bengs, Viktor, Hüllermeier, Eyke, Tierney, Kevin
Format:	Paper
Language:	English
Published:	Ithaca Cornell University Library, arXiv.org 13.10.2022
Subjects:	Algorithms Automation Configuration management Literature reviews Taxonomy
ISSN:	2331-8422
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	Algorithm configuration (AC) is concerned with the automated search of the most suitable parameter configuration of a parametrized algorithm. There is currently a wide variety of AC problem variants and methods proposed in the literature. Existing reviews do not take into account all derivatives of the AC problem, nor do they offer a complete classification scheme. To this end, we introduce taxonomies to describe the AC problem and features of configuration methods, respectively. We review existing AC literature within the lens of our taxonomies, outline relevant design choices of configuration approaches, contrast methods and problem variants against each other, and describe the state of AC in industry. Finally, our review provides researchers and practitioners with a look at future research directions in the field of AC.
Bibliography:	SourceType-Working Papers-1 ObjectType-Working Paper/Pre-Print-1 content type line 50
ISSN:	2331-8422
DOI:	10.48550/arxiv.2202.01651