The \(K\)-armed dueling bandits problem

DOI10.1016/j.jcss.2011.12.028zbMath1283.68181WikidataQ29300682 ScholiaQ29300682MaRDI QIDQ440003

Yisong Yue, Josef Broder, Thorsten Joachims, Robert D. Kleinberg

Publication date: 17 August 2012

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2011.12.028

zbMATH Keywords

online learning; multi-armed bandits; preference elicitation

Mathematics Subject Classification ID

68Q32: Computational learning theory

68T05: Learning and adaptive systems in artificial intelligence

91A60: Probabilistic games; gambling

68W27: Online algorithms; streaming algorithms

Related Items

The \(K\)-armed dueling bandits problem, Preference-based reinforcement learning: evolutionary direct policy search using a preference-based racing algorithm

Cites Work

• The \(K\)-armed dueling bandits problem
• Asymptotically efficient adaptive allocation rules
• Regret bounds for sleeping experts and bandits
• Computing with Noisy Information
• A PAC-Bayesian margin bound for linear classifiers
• The Nonstochastic Multiarmed Bandit Problem
• 10.1162/153244303321897663
• 10.1162/1532443041827916
• Probability Inequalities for Sums of Bounded Random Variables
• Regret Minimization Under Partial Monitoring
• Robust Reductions from Ranking to Classification
• Some aspects of the sequential design of experiments
• Finite-time analysis of the multiarmed bandit problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item