3 papers
cs.LG2022
AC-Band: A Combinatorial Bandit-Based Approach to Algorithm Configuration
Jasmin Brandt, Elias Schede, Viktor Bengs +3
We study the algorithm configuration (AC) problem, in which one seeks to find an optimal parameter configuration of a given target algorithm in an automated way. Recently, there ha…
cs.LG2022
Non-Stationary Dueling Bandits
Patrick Kolpaczki, Viktor Bengs, Eyke Hüllermeier
We study the non-stationary dueling bandits problem with arms, where the time horizon consists of stationary segments, each of which is associated with its own preferen…
cs.LG2021
Machine Learning for Online Algorithm Selection under Censored Feedback
Alexander Tornede, Viktor Bengs, Eyke Hüllermeier
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 al…