Logo Logo
Help
Contact
Switch Language to German

Tornede, Alexander ORCID logoORCID: https://orcid.org/0000-0002-2415-2186; Gehring, Lukas; Tornede, Tanja ORCID logoORCID: https://orcid.org/0000-0001-9954-462X; Wever, Marcel ORCID logoORCID: https://orcid.org/0000-0001-9782-6818 and Hüllermeier, Eyke ORCID logoORCID: https://orcid.org/0000-0002-9944-4108 (2023): Algorithm selection on a meta level. In: Machine Learning, Vol. 112, No. 4: pp. 1253-1286

Full text not available from 'Open Access LMU'.

Abstract

The problem of selecting an algorithm that appears most suitable for a specific instance of an algorithmic problem class, such as the Boolean satisfiability problem, is called instance-specific algorithm selection. Over the past decade, the problem has received considerable attention, resulting in a number of different methods for algorithm selection. Although most of these methods are based on machine learning, surprisingly little work has been done on meta learning, that is, on taking advantage of the complementarity of existing algorithm selection methods in order to combine them into a single superior algorithm selector. In this paper, we introduce the problem of meta algorithm selection, which essentially asks for the best way to combine a given set of algorithm selectors. We present a general methodological framework for meta algorithm selection as well as several concrete learning methods as instantiations of this framework, essentially combining ideas of meta learning and ensemble learning. In an extensive experimental evaluation, we demonstrate that ensembles of algorithm selectors can significantly outperform single algorithm selectors and have the potential to form the new state of the art in algorithm selection.

Actions (login required)

View Item View Item