HARRIS: Hybrid Ranking and Regression Forests for Algorithm Selection
Lukas Fehring, Jonas Hanselle, Alexander Tornede

TL;DR
HARRIS is a novel algorithm selection method that combines ranking and regression forests to improve the accuracy of selecting the best algorithm for a given problem instance.
Contribution
It introduces a hybrid forest model that integrates ranking and regression objectives, addressing weaknesses of traditional approaches.
Findings
HARRIS outperforms standard methods in some scenarios.
Combining ranking and regression improves algorithm selection.
Preliminary experiments show promising results on ASLib.
Abstract
It is well known that different algorithms perform differently well on an instance of an algorithmic problem, motivating algorithm selection (AS): Given an instance of an algorithmic problem, which is the most suitable algorithm to solve it? As such, the AS problem has received considerable attention resulting in various approaches - many of which either solve a regression or ranking problem under the hood. Although both of these formulations yield very natural ways to tackle AS, they have considerable weaknesses. On the one hand, correctly predicting the performance of an algorithm on an instance is a sufficient, but not a necessary condition to produce a correct ranking over algorithms and in particular ranking the best algorithm first. On the other hand, classical ranking approaches often do not account for concrete performance values available in the training data, but only leverage…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMachine Learning and Algorithms · Machine Learning and Data Classification · Multi-Criteria Decision Making
