Multi-armed bandits in metric spaces

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2008, Pages 681-690

  Kleinberg, Robert ^a   Slivkins, Aleksandrs ^b   Upfal, Eli ^c  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

^b MICROSOFT RESEARCH   (United States)

^c Brown Univerity   (United States)

Author keywords

Algorithms; Theory

Indexed keywords

ALGORITHMS; PROBABILITY; SET THEORY; STATISTICS; TOPOLOGY;

BANDIT PROBLEMS; COMPLETE SOLUTIONS; ISOMETRY INVARIANT; LIPSCHITZ CONDITIONS; MULTI ARMED BANDIT; MULTI-ARMED BANDIT PROBLEM; ON-LINE ALGORITHMS; THEORY;

COMPUTATION THEORY;

EID: 57049185311     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1374376.1374475     Document Type: Conference Paper

References (20)

1. R. Agrawal. The continuum-armed bandit problem. SIAM J. Control and Optimization, 33(6): 1926-1951, 1995.
2. P. Auer, N. Cesa-Bianchi, and P. Fischer. Finite-time analysis of the multiarmed bandit problem. Machine Learning, 47(2-3):235-256, 2002.
3. P. Auer, N. Cesa-Bianchi, Y. Freund, and R. E. Sehapire. The nonstochastic multiarmed bandit problem. SIAM J. Comput., 32(l):48-77, 2002.
4. P. Auer, R. Ortner, and C. Szepesvari. Improved Rates for the Stochastic Continuum-Armed Bandit Problem. In 20th Conference on Learning Theory (COLT), pages 454-468, 2007.
5. B. Awerbuch and R. Kleinberg. Online linear optimization and adaptive routing. Journal of Computer and System Sciences, 74(1):97-114, February 2008.
6. J. S. Banks and R. K. Sundaram. Denumerable-armed bandits. Econometrica, 60(5):1071-1096, 1992.
7. D. A. Berry and B. Fristedt. Bandit problems: sequential allocation of experiments. Chapman and Hall, 1985.
8. N. Cesa-Bianchi and G. Lugosi. Prediction, learning, and games. Cambridge University Press, 2006.
9. E. Cope. Regret and convergence bounds for immediate-reward reinforcement learning with continuous action spaces, 2004. Unpublished manuscript.
10. V. Dani, T. Hayes, and S. M. Kakade. The Price of Bandit Information for Online Optimization. Preprint, 2007.
11. V. Dani and T. P. Hayes. Robbing the bandit: Less regret in online geometric optimization against an adaptive adversary. In 16th ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 937-943, 2006.
12. A. D. Flaxman, A. T. Kalai, and H. B. McMahan. Online convex optimization in the bandit setting: Gradient descent without a gradient. In 16th ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 385-394, 2005.
13. J. C. Gittins and D. M. Jones. A dynamic allocation index for the sequential design of experiments. In J. G. et al., editor, Progress in Statistics, pages 241-266. North-Holland, 1974.
14. S. M. Kakade, A. T. Kalai, and K. Ligett. Playing Games with Approximation Algorithms. In 39th ACM Symp. on Theory of Computing (STOC), 2007.
15. R. Kleinberg. Nearly tight bounds for the continuum-armed bandit problem. In 18th Advances in Neural Information Processing Systems (NIPS), 2004. Full version appeared as Chapters 4-5 in [16].
16. R. Kleinberg. Online Decision Problems with Large Strategy Sets. PhD thesis, MIT, Boston, MA, 2005.
17. H. B. McMahan and A. Blum. Online geometric optimization in the bandit setting against an adaptive adversary. In 17th Annual Conference on Learning Theory (COLT), volume 3120 of LNCS, pages 109-123. Springer Verlag, 2004.
18. K. Neammanee. On the constant in the nonuniform version of the Berry-Esseen theorem. Intl. J. of Mathematics and Mathematical Sciences, 2005:12:1951-1967, 2005.
19. S. Pandey, D. Agarwal, D. Chakrabarti, and V. Josifovski. Bandits for Taxonomies: A Model-based Approach. In SIAM Intl. Conf. on Data Mining (SDM), 2007.
20. S. Pandey, D. Chakrabarti, and D. Agarwal. Multi-armed Bandit Problems with Dependent Arms. In 24th Intl. Conf.on Machine Learning (ICML), 2007.