DeepAI AI Chat
Log In Sign Up

Machine Learning for Online Algorithm Selection under Censored Feedback

09/13/2021
by   Alexander Tornede, et al.
0

In online algorithm selection (OAS), instances of an algorithmic problem class are presented to an agent one after another, and the agent has to quickly select a presumably best algorithm from a fixed set of candidate algorithms. For decision problems such as satisfiability (SAT), quality typically refers to the algorithm's runtime. As the latter is known to exhibit a heavy-tail distribution, an algorithm is normally stopped when exceeding a predefined upper time limit. As a consequence, machine learning methods used to optimize an algorithm selection strategy in a data-driven manner need to deal with right-censored samples, a problem that has received little attention in the literature so far. In this work, we revisit multi-armed bandit algorithms for OAS and discuss their capability of dealing with the problem. Moreover, we adapt them towards runtime-oriented losses, allowing for partially censored data while keeping a space- and time-complexity independent of the time horizon. In an extensive experimental evaluation on an adapted version of the ASlib benchmark, we demonstrate that theoretically well-founded methods based on Thompson sampling perform specifically strong and improve in comparison to existing methods.

READ FULL TEXT

page 1

page 2

page 3

page 4

07/20/2021

Algorithm Selection on a Meta Level

The problem of selecting an algorithm that appears most suitable for a s...
09/23/2020

EXP4-DFDC: A Non-Stochastic Multi-Armed Bandit for Cache Replacement

In this work we study a variant of the well-known multi-armed bandit (MA...
07/06/2020

Run2Survive: A Decision-theoretic Approach to Algorithm Selection based on Survival Analysis

Algorithm selection (AS) deals with the automatic selection of an algori...
11/03/2020

Multi-armed Bandits with Cost Subsidy

In this paper, we consider a novel variant of the multi-armed bandit (MA...
11/20/2018

Playing with and against Hedge

Hedge has been proposed as an adaptive scheme, which guides an agent's d...

Code Repositories

online_as

This repository holds the code for our paper "Machine Learning for Online Algorithm Selection under Censored Feedback" by Alexander Tornede, Viktor Bengs and Eyke Hüllermeier.


view repo