2 citations · 3 across the 8 of their papers we have counts for
5 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…
Algorithm Selection on a Meta Level
Alexander Tornede, Lukas Gehring, Tanja Tornede +2
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 inst…
Towards Meta-Algorithm Selection
Alexander Tornede, Marcel Wever, Eyke Hüllermeier
Instance-specific algorithm selection (AS) deals with the automatic selection of an algorithm from a fixed set of candidates most suitable for a specific instance of an algorithmic…
A Flexible Class of Dependence-aware Multi-Label Loss Functions
Eyke Hüllermeier, Marcel Wever, Eneldo Loza Mencia +2
Multi-label classification is the task of assigning a subset of labels to a given query instance. For evaluating such predictions, the set of predicted labels needs to be compared…
Machine Learning with the Sugeno Integral: The Case of Binary Classification
Sadegh Abbaszadeh, Eyke Hüllermeier
In this paper, we elaborate on the use of the Sugeno integral in the context of machine learning. More specifically, we propose a method for binary classification, in which the Sug…