65 citations · 115 across the 19 of their papers we have counts for
7 papers · 1 filter
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…
On the Calibration of Probabilistic Classifier Sets
Thomas Mortier, Viktor Bengs, Eyke Hüllermeier +2
Multi-class classification methods that produce sets of probabilistic classifiers, such as ensemble learning methods, are able to model aleatoric and epistemic uncertainty. Aleator…
Pitfalls of Epistemic Uncertainty Quantification through Loss Minimisation
Viktor Bengs, Eyke Hüllermeier, Willem Waegeman
Uncertainty quantification has received increasing attention in machine learning in the recent past. In particular, a distinction between aleatoric and epistemic uncertainty has be…
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…
Stochastic Contextual Dueling Bandits under Linear Stochastic Transitivity Models
Viktor Bengs, Aadirupa Saha, Eyke Hüllermeier
We consider the regret minimization task in a dueling bandits problem with context information. In every round of the sequential decision problem, the learner makes a context-depen…
Finding Optimal Arms in Non-stochastic Combinatorial Bandits with Semi-bandit Feedback and Finite Budget
Jasmin Brandt, Viktor Bengs, Björn Haddenhorst +1
We consider the combinatorial bandits problem with semi-bandit feedback under finite sampling budget constraints, in which the learner can carry out its action only for a limited n…
A Survey of Methods for Automated Algorithm Configuration
Elias Schede, Jasmin Brandt, Alexander Tornede +4
Algorithm configuration (AC) is concerned with the automated search of the most suitable parameter configuration of a parametrized algorithm. There is currently a wide variety of A…