Overview of Methods and History

Cambridge University Press eBooks 2026 Book chapter

View at publisher
Authors: Tor Lattimore
DOI: 10.1017/9781009607551.003
Cited by: 0

Abstract

This chapter briefly outlines the key algorithmic ideas and history of bandit convex optimisation. There follow in Section 2.4 and Section 2.5 summary tables of known lower and upper bounds for the various settings studied in this book.

Fields of Study & Subjects

Advanced Bandit Algorithms Research Optimization and Search Problems Stochastic Gradient Optimization Techniques

Publication details

Journal / source
Cambridge University Press eBooks
Pages
14–25
Publication date
7 March 2026
Language
EN
Document type
Book chapter