Viktor Bengs
18 papers · 2020–2024 · 7 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+8 more ↓ Show less ↑
🐣 Hot Topic Early Bird 🌍 Conference Polyglot (7) 🌉 Interdisciplinary Bridge 🧭 Keyword Pioneer 🐝 Cross-Pollinator (11)
🐝
Cross-Pollinator
(11)
🌍
Conference Polyglot
(7)
🤝
Dynamic Duo
(18)
🔥
Unstoppable
(5)
💎
Century Club
(18)
⚡
Prolific Year
(5)
❓
The Questioner
🗃️
Keyword Collector
(61)
Conferences
ICML (5)
AAAI (4)
NIPS (3)
AISTATS (2)
IJCAI (2)
JMLR (1)
UAI (1)
Top co-authors
Keywords
multi-armed bandit
(7)
dueling bandit
(5)
epistemic uncertainty
(3)
preference learning
(3)
hyperparameter optimization
(3)
sample complexity
(3)
uncertainty quantification
(3)
second-order learner
(2)
online learning
(2)
combinatorial optimization
(2)
parameter tuning
(2)
loss minimisation
(2)
plackett-luce model
(2)
aleatoric uncertainty
(2)
algorithm configuration
(2)
arm selection
(1)
multi-class classification
(1)
regret minimization
(1)
feature attribution
(1)
ensemble learning
(1)
Papers
Is Epistemic Uncertainty Faithfully Represented by Evidential Deep Learning Methods?
ICML 2024
Approximating the Shapley Value without Marginal Contributions
AAAI 2024
Identifying Copeland Winners in Dueling Bandits with Indifferences
AISTATS 2024
Best Arm Identification with Retroactively Increased Sampling Budget for More Resource-Efficient HPO
IJCAI 2024
Second-Order Uncertainty Quantification: A Distance-Based Approach
ICML 2024
AC-Band: A Combinatorial Bandit-Based Approach to Algorithm Configuration
AAAI 2023
On Second-Order Scoring Rules for Epistemic Uncertainty Quantification
ICML 2023
On the Calibration of Probabilistic Classifier Sets
AISTATS 2023
A Survey of Methods for Automated Algorithm Configuration (Extended Abstract)
IJCAI 2023
Machine Learning for Online Algorithm Selection under Censored Feedback
AAAI 2022
Pitfalls of Epistemic Uncertainty Quantification through Loss Minimisation
NIPS 2022
Finding Optimal Arms in Non-stochastic Combinatorial Bandits with Semi-bandit Feedback and Finite Budget
NIPS 2022
Stochastic Contextual Dueling Bandits under Linear Stochastic Transitivity Models
ICML 2022
Identification of the Generalized Condorcet Winner in Multi-dueling Bandits
NIPS 2021
Single Player Monte-Carlo Tree Search Based on the Plackett-Luce Model
AAAI 2021
Testification of Condorcet Winners in dueling bandits
UAI 2021
Preference-based Online Learning with Dueling Bandits: A Survey
JMLR 2021
Preselection Bandits
ICML 2020