• Multi-armed bandits[electronic resource] :theory and applications to online learning in networks /
  • 紀錄類型: 書目-電子資源 : Monograph/item
    杜威分類號: 006.3/1
    書名/作者: Multi-armed bandits : theory and applications to online learning in networks // Qing Zhao.
    其他題名: Theory and applications to online learning in networks
    作者: Zhao, Qing
    面頁冊數: 1 online resource (167 p.)
    標題: Machine learning.
    標題: Reinforcement learning.
    ISBN: 9781627056380
    ISBN: 9781627058711
    ISBN: 9781681736372
    書目註: Includes bibliographical references (pages 127-145).
    摘要、提要註: 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.
    電子資源: https://portal.igpublish.com/iglibrary/search/MCPB0006505.html
Export
取書館別
 
 
變更密碼
登入