Björn Haddenhorst

According to our database, Björn Haddenhorst authored at least 9 papers between 2020 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2023

Testing coherence and identifying winners in dueling bandits: theory and algorithms

Björn Haddenhorst

PhD thesis, 2023

Identifying Copeland Winners in Dueling Bandits with Indifferences.

Viktor Bengs, Björn Haddenhorst, Eyke Hüllermeier

CoRR, 2023

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

Jasmin Brandt, Elias Schede, Björn Haddenhorst, Viktor Bengs, Eyke Hüllermeier, Kevin Tierney

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Learning context-dependent choice functions.

Karlson Pfannschmidt, Pritha Gupta, Björn Haddenhorst, Eyke Hüllermeier

Int. J. Approx. Reason., 2022

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

Jasmin Brandt, Viktor Bengs, Björn Haddenhorst, Eyke Hüllermeier

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021

On testing transitivity in online preference learning.

Björn Haddenhorst, Viktor Bengs, Eyke Hüllermeier

Mach. Learn., 2021

Testification of Condorcet Winners in dueling bandits.

Björn Haddenhorst, Viktor Bengs, Jasmin Brandt, Eyke Hüllermeier

Proceedings of the Thirty-Seventh Conference on Uncertainty in Artificial Intelligence, 2021

Identification of the Generalized Condorcet Winner in Multi-dueling Bandits.

Björn Haddenhorst, Viktor Bengs, Eyke Hüllermeier

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020

Generalized transitivity: A systematic comparison of concepts with an application to preferences in the Babington Smith model.

Björn Haddenhorst, Eyke Hüllermeier, Martin Kolb

Int. J. Approx. Reason., 2020