Tighter Bounds for Multi-Armed Bandits with Expert Advice
暂无分享,去创建一个
[1] Yoav Freund,et al. A decision-theoretic generalization of on-line learning and an application to boosting , 1995, EuroCOLT.
[2] Yoav Freund,et al. A decision-theoretic generalization of on-line learning and an application to boosting , 1997, EuroCOLT.
[3] Yishay Mansour,et al. Approximate Planning in Large POMDPs via Reusable Trajectories , 1999, NIPS.
[4] Peter Auer,et al. The Nonstochastic Multiarmed Bandit Problem , 2002, SIAM J. Comput..
[5] Ran El-Yaniv,et al. Online Choice of Active Learning Algorithms , 2003, J. Mach. Learn. Res..
[6] Sandeep Pandey,et al. Handling Advertisements of Unknown Quality in Search Advertising , 2006, NIPS.
[7] Gábor Lugosi,et al. Prediction, learning, and games , 2006 .
[8] Nimrod Megiddo,et al. Combining expert advice in reactive environments , 2006, JACM.
[9] Rica Gonen,et al. An incentive-compatible multi-armed bandit mechanism , 2007, PODC '07.
[10] John Langford,et al. The Epoch-Greedy Algorithm for Multi-armed Bandits with Side Information , 2007, NIPS.
[11] Thomas P. Hayes,et al. The Price of Bandit Information for Online Optimization , 2007, NIPS.
[12] Filip Radlinski,et al. Mortal Multi-Armed Bandits , 2008, NIPS.
[13] John Langford,et al. Maintaining Equilibria During Exploration in Sponsored Search Auctions , 2010, Algorithmica.
[14] T. L. Lai Andherbertrobbins. Asymptotically Efficient Adaptive Allocation Rules , 2022 .