Björn Haddenhorst

Orcid: 0000-0002-4023-6646

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

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Identifying Copeland Winners in Dueling Bandits with Indifferences.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024

2023
Testing coherence and identifying winners in dueling bandits: theory and algorithms
PhD thesis, 2023

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

2022
Learning context-dependent choice functions.
Int. J. Approx. Reason., 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

2021
On testing transitivity in online preference learning.
Mach. Learn., 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

2020
Generalized transitivity: A systematic comparison of concepts with an application to preferences in the Babington Smith model.
Int. J. Approx. Reason., 2020


  Loading...