论文信息 - Online Geometric Optimization in the Bandit Setting Against an Adaptive Adversary - 字舞流文

Online Geometric Optimization in the Bandit Setting Against an Adaptive Adversary

H. B. McMahan | Avrim Blum

[1] Santosh S. Vempala,et al. Efficient algorithms for online decision problems , 2005, J. Comput. Syst. Sci..

[2] Baruch Awerbuch,et al. Adaptive routing with end-to-end feedback: distributed learning and geometric approaches , 2004, STOC '04.

[3] Martin Zinkevich,et al. Online Convex Programming and Generalized Infinitesimal Gradient Ascent , 2003, ICML.

[4] Manfred K. Warmuth,et al. Path Kernels and Multiplicative Updates , 2002, J. Mach. Learn. Res..

[5] Nicolò Cesa-Bianchi,et al. Gambling in a rigged casino: The adversarial multi-armed bandit problem , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[6] Peter Auer,et al. The Nonstochastic Multiarmed Bandit Problem , 2002, SIAM J. Comput..

[7] Russ Bubley,et al. Randomized algorithms , 1995, CSUR.

[8] Patrick Brézillon,et al. Lecture Notes in Artificial Intelligence , 1999 .