Bandit Algorithms

豆瓣
Bandit Algorithms

登录后可管理标记收藏。

ISBN: 9781108486828
作者: Tor Lattimore / Csaba Szepesvári
出版社: Cambridge University Press
发行时间: 2020 -7
装订: Hardcover
价格: USD 49.99
页数: 450

/ 10

0 个评分

评分人数不足
借阅或购买

Tor Lattimore / Csaba Szepesvári   

简介

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.

短评
评论
笔记