A Survey of Preference-Based Online Learning with Bandit Algorithms

DOI10.1007/978-3-319-11662-4_3zbMath1432.68380OpenAlexW1032589285MaRDI QIDQ2938721

Eyke Hüllermeier, Róbert Busa-Fekete

Publication date: 14 January 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-11662-4_3

zbMATH Keywords

rankingonline learningPAC learningmulti-armed banditspreference learningsample complexitycumulative regretexploration/exploitationtop-k selection

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Online algorithms; streaming algorithms (68W27)

Related Items (4)

Top-\(\kappa\) selection with pairwise comparisons ⋮ Query complexity of tournament solutions ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: A Survey of Preference-Based Online Learning with Bandit Algorithms