Normal view MARC view ISBD view

Bandit algorithms

By: Lattimore, Tor.
Contributor(s): Szepesvari, Csaba.
Material type: materialTypeLabelBookPublisher: Cambridge : Cambridge University Press, 2020Description: xviii, 518 p. ; ill., 24 cm.ISBN: 9781108486828.Subject(s): Resource allocation | Mathematical models | Algorithms | Computer algorithms | Decision making | Mathematical optimization | ProbabilitiesDDC classification: 519.3 Summary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
Item type Current location Call number Status Date due Barcode
Books 519.3 LAT (Browse shelf) Checked out 15/05/2024 034215

Includes bibliographical references and index.

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.

There are no comments for this item.

Log in to your account to post a comment.

Powered by Koha