首页 | 官方网站   微博 | 高级检索  
     


Asymptotically optimal algorithms for budgeted multiple play bandits
Authors:Luedtke  Alex  Kaufmann  Emilie  Chambaz  Antoine
Affiliation:1.Department of Statistics, University of Washington, 4060 E Stevens Way NE, Seattle, WA, 98195, USA
;2.Univ. Lille, CRIStAL (UMR 9189), Inria Lille Nord Europe, CNRS, 40, Avenue du Halley, 59650, Villeneuve d’Ascq, France
;3.Laboratoire MAP5, Université Paris Descartes, 45 Rue des Saints Pres, 75270, Paris Cedex 06, France
;
Abstract:Machine Learning - We study a generalization of the multi-armed bandit problem with multiple plays where there is a cost associated with pulling each arm and the agent has a budget at each time...
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号