Bandit algorithms / Tor Lattimore and Csaba Szepesvari.

Includes bibliographical references and index.

Foundations of probability -- Stochastic processes and Markov chains -- Stochastic bandits -- Concentration of measure -- The explore-then-commit algorithm -- The upper confidence bound algorithm -- The upper confidence bound algorithm: asymptotic optimality -- The upper confidence bound algorithm: minimax optimality -- The upper confidence bound algorithm: Bernoulli noise -- The Exp3 algorithm -- The Exp3-IX algorithm -- Lower bounds: basic ideas -- Foundations of information theory -- Minimax lower bounds -- Instance dependent lower bounds -- High probability lower bounds -- Contextual bandits -- Stochastic linear bandits -- Confidence bounds for least squares estimators -- Optimal design for least squares estimators -- Stochastic linear bandits with finitely many arms -- Stochastic linear bandits with sparsity -- Minimax lower bounds for stochastic linear bandits -- Asymptotic lower bounds for stochastic linear bandits -- Foundations of convex analysis -- Exp3 for adversarial linear bandits -- Follow the regularized leader and mirror descent -- The relation between adversarial and stochastic linear bandits -- Combinatorial bandits -- Non-stationary bandits -- Ranking -- Pure exploration -- Foundations of Bayesian learning -- Bayesian bandits -- Thompson sampling -- Partial monitoring -- Markov decision processes.

"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"-- Provided by publisher.