Active Learning in Multi-armed Bandits

DOI10.1007/978-3-540-87987-9_25zbMath1156.68409OpenAlexW2135664069MaRDI QIDQ3529929

Csaba Szepesvári, Varun Grover, András Antos

Publication date: 14 October 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-87987-9_25

Mathematics Subject Classification ID

Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05) Reliability, availability, maintenance, inspection in operations research (90B25)

Related Items (2)

V-optimal designs for heteroscedastic regression ⋮ Active learning in heteroscedastic noise

Cites Work

• Unnamed Item
• Adaptive optimal allocation in stratified sampling methods
• Asymptotically efficient adaptive allocation rules
• Probability Inequalities for Sums of Bounded Random Variables
• Measure Theory and Probability Theory
• Finite-time analysis of the multiarmed bandit problem

This page was built for publication: Active Learning in Multi-armed Bandits