Logo Logo
Eine Ebene nach oben
Exportieren als [RSS feed] RSS 1.0 [RSS2 feed] RSS 2.0
Gruppiert nach: Dokumententyp | Veröffentlichungsdatum
Anzahl der Publikationen: 9

Zeitschriftenartikel

Pfannschmidt, Karlson ORCID logoORCID: https://orcid.org/0000-0001-9407-7903; Gupta, Pritha ORCID logoORCID: https://orcid.org/0000-0002-7277-4633; Haddenhorst, Björn und Hüllermeier, Eyke ORCID logoORCID: https://orcid.org/0000-0002-9944-4108 (Januar 2022): Learning context-dependent choice functions. In: International Journal of Approximate Reasoning, Bd. 140: S. 116-155

Haddenhorst, Björn ORCID logoORCID: https://orcid.org/0000-0002-4023-6646; Bengs, Viktor und Hüllermeier, Eyke ORCID logoORCID: https://orcid.org/0000-0002-9944-4108 (Juli 2021): On testing transitivity in online preference learning. In: Machine Learning, Bd. 110, Nr. 8: S. 2063-2084

Haddenhorst, Björn; Bengs, Viktor und Hüllermeier, Eyke (2021): On testing transitivity in online preference learning. In: Machine Learning, Bd. 110, Nr. 8: S. 2063-2084

Pfannschmidt, Karlson; Gupta, Pritha; Haddenhorst, Björn und Hüllermeier, Eyke (2021): Learning context-dependent choice functions. In: International Journal of Approximate Reasoning, Bd. 140: S. 116-155

Haddenhorst, Björn; Hüllermeier, Eyke ORCID logoORCID: https://orcid.org/0000-0002-9944-4108 und Kolb, Martin (April 2020): Generalized transitivity: A systematic comparison of concepts with an application to preferences in the Babington Smith model. In: International Journal of Approximate Reasoning, Bd. 119: S. 373-407

Konferenzbeitrag

Brandt, Jasmin; Schede, Elias; Haddenhorst, Björn ORCID logoORCID: https://orcid.org/0000-0002-4023-6646; Bengs, Viktor ORCID logoORCID: https://orcid.org/0000-0001-6988-6186; Hüllermeier, Eyke ORCID logoORCID: https://orcid.org/0000-0002-9944-4108 und Tierney, Kevin (7. Februar 2023): AC-Band: A Combinatorial Bandit-Based Approach to Algorithm Configuration. AAAI Conference on Artificial Intelligence, Washington, DC, USA, February, 2023. Proceedings of the AAAI Conference on Artificial Intelligence. Bd. 37, Nr. 10 S. 12355-12363

Brandt, Jasmin; Bengs, Viktor ORCID logoORCID: https://orcid.org/0000-0001-6988-6186; Haddenhorst, Björn ORCID logoORCID: https://orcid.org/0000-0002-4023-6646 und Hüllermeier, Eyke ORCID logoORCID: https://orcid.org/0000-0002-9944-4108 (28. November 2022): Finding Optimal Arms in Non-stochastic Combinatorial Bandits with Semi-bandit Feedback and Finite Budget. Thirty-eighth Annual Conference on Neural Information Processing Systems (NeurIPS 2024), New Orleans, USA, 28 November - 9 December 2022.

Haddenhorst, Björn ORCID logoORCID: https://orcid.org/0000-0002-4023-6646; Bengs, Viktor und Hüllermeier, Eyke ORCID logoORCID: https://orcid.org/0000-0002-9944-4108 (7. Dezember 2021): Identification of the Generalized Condorcet Winner in Multi-dueling Bandits. Advances in Neural Information Processing Systems, Virtual, December 7 2021. Ranzato, M.; Beygelzimer, A.; Dauphin, Y.; Liang, P.S. und Vaughan, J. Wortman (Hrsg.): Bd. 34 Curran Associates, Inc.. S. 25904-25916

Haddenhorst, Björn ORCID logoORCID: https://orcid.org/0000-0002-4023-6646; Bengs, Viktor; Brandt, Jasmin und Hüllermeier, Eyke ORCID logoORCID: https://orcid.org/0000-0002-9944-4108 (27. Juli 2021): Testification of Condorcet Winners in dueling bandits. Thirty-Seventh Conference on Uncertainty in Artificial Intelligence, Virtual, July 27-30, 2021. de Campos, Cassio und Maathuis, Marloes H. (Hrsg.): In: Proceedings of the Thirty-Seventh Conference on Uncertainty in Artificial Intelligence, Bd. 161 PMLR. S. 1195-1205

Diese Liste wurde am Sun May 5 01:35:37 2024 CEST erstellt.