menu
{ "item_title" : "Bandit Algorithms", "item_author" : [" Tor Lattimore", "Csaba Szepesvári "], "item_description" : "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.", "item_img_path" : "https://covers1.booksamillion.com/covers/bam/1/10/848/682/1108486827_b.jpg", "price_data" : { "retail_price" : "59.00", "online_price" : "59.00", "our_price" : "59.00", "club_price" : "59.00", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Bandit Algorithms|Tor Lattimore

Bandit Algorithms

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

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.

This item is Non-Returnable

Details

  • ISBN-13: 9781108486828
  • ISBN-10: 1108486827
  • Publisher: Cambridge University Press
  • Publish Date: July 2020
  • Dimensions: 9.8 x 7.7 x 1.3 inches
  • Shipping Weight: 2.3 pounds
  • Page Count: 536

Related Categories

You May Also Like...

    1

BAM Customer Reviews