Minimax Games with Bandits
暂无分享,去创建一个
[1] Manfred K. Warmuth,et al. The Minimax Strategy for Gaussian Density Estimation. pp , 2000, COLT.
[2] Manfred K. Warmuth,et al. The Weighted Majority Algorithm , 1994, Inf. Comput..
[3] Vladimir Vovk,et al. A game of prediction with expert advice , 1995, COLT '95.
[4] E. Takimoto,et al. The Minimax Strategy for Gaussian Density Estimation , 2000 .
[5] Peter Auer,et al. The Nonstochastic Multiarmed Bandit Problem , 2002, SIAM J. Comput..
[6] Yoav Freund,et al. A decision-theoretic generalization of on-line learning and an application to boosting , 1995, EuroCOLT.
[7] Ambuj Tewari,et al. Optimal Stragies and Minimax Lower Bounds for Online Convex Games , 2008, COLT.
[8] Manfred K. Warmuth,et al. When Random Play is Optimal Against an Adversary , 2008, COLT.
[9] John Langford,et al. Continuous Experts and the Binning Algorithm , 2006, COLT.