Viktor Bengs | DeepAI

DeepAI AI Chat

Featured Co-authors

Eyke Hüllermeier
79 publications
Marcel Wever
18 publications
Willem Waegeman
17 publications
Alexander Tornede
12 publications
Hajo Holzmann
11 publications
Kevin Tierney
10 publications
Jasmin Brandt
4 publications
Thomas Mortier
3 publications
Dimitrios Iliadis
3 publications
Patrick Kolpaczki
3 publications
Adil El Mesaoudi-Paul
2 publications

∙ 02/01/2023

Approximating the Shapley Value without Marginal Contributions

The Shapley value is arguably the most popular approach for assigning a ...

0 Patrick Kolpaczki, et al. ∙

∙ 02/01/2023

Iterative Deepening Hyperband

Hyperparameter optimization (HPO) is concerned with the automated search...

0 Jasmin Brandt, et al. ∙

∙ 01/30/2023

On Second-Order Scoring Rules for Epistemic Uncertainty Quantification

It is well known that accurate probabilistic predictors can be trained t...

0 Viktor Bengs, et al. ∙

∙ 12/01/2022

AC-Band: A Combinatorial Bandit-Based Approach to Algorithm Configuration

We study the algorithm configuration (AC) problem, in which one seeks to...

0 Jasmin Brandt, et al. ∙

∙ 05/20/2022

On Calibration of Ensemble-Based Credal Predictors

In recent years, several classification methods that intend to quantify ...

0 Thomas Mortier, et al. ∙

∙ 03/11/2022

On the Difficulty of Epistemic Uncertainty Quantification in Machine Learning: The Case of Direct Uncertainty Estimation through Loss Minimisation

Uncertainty quantification has received increasing attention in machine ...

0 Viktor Bengs, et al. ∙

∙ 02/09/2022

Finding Optimal Arms in Non-stochastic Combinatorial Bandits with Semi-bandit Feedback and Finite Budget

We consider the combinatorial bandits problem with semi-bandit feedback ...

0 Jasmin Brandt, et al. ∙

∙ 02/03/2022

A Survey of Methods for Automated Algorithm Configuration

Algorithm configuration (AC) is concerned with the automated search of t...

2 Elias Schede, et al. ∙

∙ 02/02/2022

Non-Stationary Dueling Bandits

We study the non-stationary dueling bandits problem with K arms, where t...

0 Patrick Kolpaczki, et al. ∙

∙ 09/13/2021

Machine Learning for Online Algorithm Selection under Censored Feedback

In online algorithm selection (OAS), instances of an algorithmic problem...

0 Alexander Tornede, et al. ∙

∙ 11/02/2020

Multi-Armed Bandits with Censored Consumption of Resources

We consider a resource-aware variant of the classical multi-armed bandit...

0 Viktor Bengs, et al. ∙

∙ 02/11/2020

Online Preselection with Context Information under the Plackett-Luce Model

We consider an extension of the contextual multi-armed bandit problem, i...

0 Adil El Mesaoudi-Paul, et al. ∙

∙ 07/13/2019

Preselection Bandits under the Plackett-Luce Model

In this paper, we introduce the Preselection Bandit problem, in which th...

0 Viktor Bengs, et al. ∙

∙ 03/23/2019

Asymptotic confidence sets for the jump curve in bivariate regression problems

We construct uniform and point-wise asymptotic confidence sets for the s...

0 Viktor Bengs, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world