Viktor Bengs

Orcid: 0000-0001-6988-6186

According to our database1, Viktor Bengs authored at least 32 papers between 2019 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Is Epistemic Uncertainty Faithfully Represented by Evidential Deep Learning Methods?
CoRR, 2024

Approximating the Shapley Value without Marginal Contributions.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Multi-armed bandits with censored consumption of resources.
Mach. Learn., January, 2023

A Survey of Reinforcement Learning from Human Feedback.
CoRR, 2023

Second-Order Uncertainty Quantification: A Distance-Based Approach.
CoRR, 2023

Identifying Copeland Winners in Dueling Bandits with Indifferences.
CoRR, 2023

Approximating the Shapley Value without Marginal Contributions.
CoRR, 2023

Iterative Deepening Hyperband.
CoRR, 2023

Contextual Preselection Methods in Pool-based Realtime Algorithm Configuration.
Proceedings of the Lernen, 2023

A Survey of Methods for Automated Algorithm Configuration (Extended Abstract).
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

On Second-Order Scoring Rules for Epistemic Uncertainty Quantification.
Proceedings of the International Conference on Machine Learning, 2023

On the Calibration of Probabilistic Classifier Sets.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

AC-Band: A Combinatorial Bandit-Based Approach to Algorithm Configuration.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
A Survey of Methods for Automated Algorithm Configuration.
J. Artif. Intell. Res., 2022

On Calibration of Ensemble-Based Credal Predictors.
CoRR, 2022

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

Non-Stationary Dueling Bandits.
CoRR, 2022

Finding Optimal Arms in Non-stochastic Combinatorial Bandits with Semi-bandit Feedback and Finite Budget.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Pitfalls of Epistemic Uncertainty Quantification through Loss Minimisation.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Stochastic Contextual Dueling Bandits under Linear Stochastic Transitivity Models.
Proceedings of the International Conference on Machine Learning, 2022

Machine Learning for Online Algorithm Selection under Censored Feedback.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
On testing transitivity in online preference learning.
Mach. Learn., 2021

Preference-based Online Learning with Dueling Bandits: A Survey.
J. Mach. Learn. Res., 2021

Testification of Condorcet Winners in dueling bandits.
Proceedings of the Thirty-Seventh Conference on Uncertainty in Artificial Intelligence, 2021

Identification of the Generalized Condorcet Winner in Multi-dueling Bandits.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Identifying Top-k Players in Cooperative Games via Shapley Bandits.
Proceedings of the LWDA 2021 Workshops: FGWM, 2021

Single Player Monte-Carlo Tree Search Based on the Plackett-Luce Model.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Online Preselection with Context Information under the Plackett-Luce Model.
CoRR, 2020

Pool-Based Realtime Algorithm Configuration: A Preselection Bandit Approach.
Proceedings of the Learning and Intelligent Optimization - 14th International Conference, 2020

Preselection Bandits.
Proceedings of the 37th International Conference on Machine Learning, 2020

2019
Asymptotic confidence sets for the jump curve in bivariate regression problems.
J. Multivar. Anal., 2019

Preselection Bandits under the Plackett-Luce Model.
CoRR, 2019


  Loading...