![[höher]](/style/images/multi_up.png)
Eine Ebene höherGruppiert nach:
Dokumententyp
| Veröffentlichungsdatum
Springe zu: Zeitschriftenartikel | Konferenzbeitrag
Anzahl der Publikationen: 10
Zeitschriftenartikel
Pfannschmidt, Karlson 
ORCID: https://orcid.org/0000-0001-9407-7903; Gupta, Pritha ORCID: https://orcid.org/0000-0002-7277-4633; Haddenhorst, Björn und Hüllermeier, Eyke ORCID: 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
ORCID: https://orcid.org/0000-0001-9407-7903; Gupta, Pritha ORCID: https://orcid.org/0000-0002-7277-4633; Haddenhorst, Björn und Hüllermeier, Eyke ORCID: 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: https://orcid.org/0000-0002-4023-6646; Bengs, Viktor und Hüllermeier, Eyke ORCID: 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
[PDF, 2MB]
ORCID: https://orcid.org/0000-0002-4023-6646; Bengs, Viktor und Hüllermeier, Eyke ORCID: 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
[PDF, 2MB]
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: 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
ORCID: 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
Bengs, Viktor ORCID: https://orcid.org/0000-0001-6988-6186; Haddenhorst, Björn und Hüllermeier, Eyke ORCID: https://orcid.org/0000-0002-9944-4108
(Mai 2024):
Identifying Copeland Winners in Dueling Bandits with Indifferences.
27th International Conference on Artificial Intelligence and Statistics (AISTATS 2024), Valencia, Spain, 2. - 4. May 2024.
In: Proceedings of The 27th International Conference on Artificial Intelligence and Statistics, Proceedings of Machine Learning Research
Bd. 238
PMLR. S. 226-234
[PDF, 522kB]
ORCID: https://orcid.org/0000-0001-6988-6186; Haddenhorst, Björn und Hüllermeier, Eyke ORCID: https://orcid.org/0000-0002-9944-4108
(Mai 2024):
Identifying Copeland Winners in Dueling Bandits with Indifferences.
27th International Conference on Artificial Intelligence and Statistics (AISTATS 2024), Valencia, Spain, 2. - 4. May 2024.
In: Proceedings of The 27th International Conference on Artificial Intelligence and Statistics, Proceedings of Machine Learning Research
Bd. 238
PMLR. S. 226-234
[PDF, 522kB]
Brandt, Jasmin; Schede, Elias; Haddenhorst, Björn ORCID: https://orcid.org/0000-0002-4023-6646; Bengs, Viktor ORCID: https://orcid.org/0000-0001-6988-6186; Hüllermeier, Eyke ORCID: 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
[PDF, 844kB]
ORCID: https://orcid.org/0000-0002-4023-6646; Bengs, Viktor ORCID: https://orcid.org/0000-0001-6988-6186; Hüllermeier, Eyke ORCID: 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
[PDF, 844kB]
Brandt, Jasmin; Bengs, Viktor ORCID: https://orcid.org/0000-0001-6988-6186; Haddenhorst, Björn ORCID: https://orcid.org/0000-0002-4023-6646 und Hüllermeier, Eyke ORCID: 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.
[PDF, 618kB]
ORCID: https://orcid.org/0000-0001-6988-6186; Haddenhorst, Björn ORCID: https://orcid.org/0000-0002-4023-6646 und Hüllermeier, Eyke ORCID: 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.
[PDF, 618kB]
Haddenhorst, Björn ORCID: https://orcid.org/0000-0002-4023-6646; Bengs, Viktor und Hüllermeier, Eyke ORCID: 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
[PDF, 516kB]
ORCID: https://orcid.org/0000-0002-4023-6646; Bengs, Viktor und Hüllermeier, Eyke ORCID: 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
[PDF, 516kB]
Haddenhorst, Björn ORCID: https://orcid.org/0000-0002-4023-6646; Bengs, Viktor; Brandt, Jasmin und Hüllermeier, Eyke ORCID: 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
[PDF, 875kB]
ORCID: https://orcid.org/0000-0002-4023-6646; Bengs, Viktor; Brandt, Jasmin und Hüllermeier, Eyke ORCID: 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
[PDF, 875kB]