Bandit Algorithms

Douban
Bandit Algorithms

Inscrivez ou connectez-vous pour évaluer cette œuvre ou l'ajouter à votre collection.

ISBN: 9781108486828
écrit par: Tor Lattimore / Csaba Szepesvári
édition: Cambridge University Press
date de publication: 2020 -7
prix: USD 49.99
nombre de pages: 450

/ 10

0 évaluations

Pas assez d'évaluations
Acheter ou emprunter

Tor Lattimore / Csaba Szepesvári   

résumé

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.

commentaires
Avis
Notes