Bandit Algorithms

Citations Over TimeTop 1% of 2020 papers

Abstract

Decision-making in the face of uncertainty is a significant challenge in machine learning, and the multi-armed bandit model is a commonly used framework to address it. This comprehensive and rigorous introduction to the multi-armed bandit problem examines all the major settings, including stochastic, adversarial, and Bayesian frameworks. A focus on both mathematical intuition and carefully worked proofs makes this an excellent reference for established researchers and a helpful resource for graduate students in computer science, engineering, statistics, applied mathematics and economics. Linear bandits receive special attention as one of the most useful models in applications, while other chapters are dedicated to combinatorial bandits, ranking, non-stationary problems, Thompson sampling and pure exploration. The book ends with a peek into the world beyond bandits with an introduction to partial monitoring and learning in Markov decision processes.

Related Papers

• → Do Generic Proofs Improve Proof Comprehension?(2020)10 cited
• → Combining Pencil/Paper Proofs and Formal Proofs, A Challenge for Artificial Intelligence and Mathematics Education(2022)4 cited
• → Postsecondary Student Perceptions of Received Mathematical Proofs(2014)3 cited
• → Mathematical Proofs 101: How Proofs Should Be Read, Written, and Taught(2018)
• Passages of Proof(2003)