10% off all books and free delivery over £40
Buy from our bookstore and 25% of the cover price will be given to a school of your choice to buy more books. *15% of eBooks.

Bandit Algorithms

View All Editions

The selected edition of this book is not available to buy right now.
Add To Wishlist
Write A Review

About

Bandit Algorithms Synopsis

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.

About This Edition

ISBN: 9781108486828
Publication date: 16th July 2020
Author: Tor (University of Alberta) Lattimore, Csaba (University of Alberta) Szepesvári
Publisher: Cambridge University Press
Format: Hardback
Pagination: 536 pages
Genres: Machine learning
Algorithms and data structures
Microeconomics
Optimization
Mathematical theory of computation