| 書目名稱 | Multi-Armed Bandits | | 副標(biāo)題 | Theory and Applicati | | 編輯 | Qing Zhao | | 視頻video | http://file.papertrans.cn/640/639908/639908.mp4 | | 叢書名稱 | Synthesis Lectures on Learning, Networks, and Algorithms | | 圖書封面 |  | | 描述 | 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 structu | | 出版日期 | Book 2020 | | 版次 | 1 | | doi | https://doi.org/10.1007/978-3-031-79289-2 | | isbn_softcover | 978-3-031-79288-5 | | isbn_ebook | 978-3-031-79289-2Series ISSN 2690-4306 Series E-ISSN 2690-4314 | | issn_series | 2690-4306 | | copyright | Springer Nature Switzerland AG 2020 |
The information of publication is updating
|
|
|Archiver|手機(jī)版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-13 16:02
發(fā)表于 2025-3-21 20:02:11
