Algorithm selection on a meta level

DOI10.1007/S10994-022-06161-4MaRDI QIDQ6106469zbMATH OpenOpenAlexFDO

Authors Alexander Tornede, Lukas Gehring, Tanja Tornede, Marcel Wever, Eyke Hüllermeier

Publication date 27 June 2023

Published in Machine Learning (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2107.09414

zbMATH Keywords

algorithm selectionbaggingboostingensemble learningmeta learningstacking

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

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.

Cites work

• 10.1162/153244303322753616
• ASlib: a benchmark library for algorithm selection
• Bagging predictors
• Collective-agreement-based pruning of ensembles
• Hybrid regression-classification models for algorithm selection
• Learning from imprecise and fuzzy observations: data disambiguation through generalized loss minimization
• Multi-class AdaBoost
• Ordering by weighted number of wins gives a good ranking for weighted tournaments
• SUNNY: a lazy portfolio approach for constraint solving
• The algorithm selection competitions 2015 and 2017

Cited in

(4)

• Multi-level Algorithm Selection for ASP
• A PAC Approach to Application-Specific Algorithm Selection
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• When do stepwise algorithms meet subset selection criteria?

This page was built for publication: Algorithm selection on a meta level

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6106469)