株式会社極東書店トップ > 商品一覧 > Multi-Armed Bandits: Theory and Applications to Online Learning in Networks.
商品詳細
Multi-Armed Bandits: Theory and Applications to Online Learning in Networks.
・ISBN 978-3-031-79288-5 paper EUR 54.99
¥14,698.- (税込) ※(※)価格はご注文時の参考価格となります。
納品価格につきましては書籍の入荷時点で確定となります。
版元の原価改定、外国為替の変動等により異なる場合がございますので、予めご了承下さい。
お気に入り
★★★
| 著者・編者 | Zhao, Qing, |
|---|---|
| シリーズ | (Synthesis Lectures on Learning, Networks, and Algorithms) |
| 出版社 | (Springer International Publishing AG, SZ) |
| 出版年月 | 2019 |
| ページ数 | 147 pp. |
| 言語 | ENG |
| ニュース番号 | <A02-48607> |
解説
Multi-armed bandit problems pertain to optimal sequential decision making and learning in unknown environments. Since the first bandit problem posed by Thompson in 1933 for the application of clinical trials, bandit problems have enjoyed lasting attention from multiple research communities and have found a wide range of applications across diverse domains. This book covers classic results and recent development on both Bayesian and frequentist bandit problems. We start in Chapter 1 with a brief overview on the history of bandit problems, contrasting the two schools-Bayesian and frequentist-of approaches and highlighting foundational results and key applications. Chapters 2 and 4 cover, respectively, the canonical Bayesian and frequentist bandit models. In Chapters 3 and 5, we discuss major variants of the canonical bandit models that lead to new directions, bring in new techniques, and broaden the applications of this classical problem. In Chapter 6, we present several representative application examples in communication networks and social-economic systems, aiming to illuminate the connections between the Bayesian and the frequentist formulations of bandit problems and how structural results pertaining to one may be leveraged to obtain solutions under the other.