Unimodal bandits

Proceedings of the 28th International Conference on Machine Learning, ICML 2011

Volumn , Issue , 2011, Pages 41-48

  Yu, Jia Yuan ^a   Mannor, Shie ^b  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH STRUCTURES; MAXIMAL DEGREE; MULTI-ARMED BANDIT PROBLEM; UNIMODAL; UNIMODALITY;

LEARNING SYSTEMS; OPTIMIZATION;

GRAPH THEORY;

EID: 80053457608     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. Agrawal, R. The continuum-armed bandit problem. SIAM J. Control Optim., 33:1926-1951, 1995.
2. Auer, P., Cesa-Bianchi, N., and Fischer, P. Finite-time analysis of the multiarmed bandit problem. Machine Learning, 47:235-256, 2002a. (Pubitemid 34126111)
3. Auer, P., Cesa-Bianchi, N., Freund, Y., and Schapire, R. E. The nonstochastic multiarmed bandit problem. SIAM J. Comput., 32(1):48-77, 2002b.
4. Auer, P., Ortner, R., and Szepesvári, C. Improved rates for the stochastic continuum-armed bandit problem. In Proc. COLT, 2007.
5. Bansal, N., Blum, A., Chawla, S., and Meyerson, A. Online oblivious routing. In Proc. of SPAA, 2003.
6. Blum, A., Kumar, V., Rudra, A., and Wu, F. Online learning in online auctions. In Symp. on Discrete Alg., pp. 202-204, 2003.
7. Bubeck, S., Munos, R., Stoltz, G., and Szepesvári, C. Online optimization in X-armed bandits. In Proc. NIPS, 2008.
8. Cesa-Bianchi, N. and Lugosi, G. Prediction, Learning, and Games. Cambridge University Press, 2006.
9. Cesa-Bianchi, N., Gentile, C., and Vitale, F. Fast and optimal prediction on a labeled tree. In Proc. COLT, 2009a.
10. Cesa-Bianchi, N., Gentile, C., and Vitale, F. Learning unknown graphs. In Proceedings of Algorithmic Learning Theory, 2009b.
11. Cope, E. W. Regret and convergence bounds for a class of continuum-armed bandit problems. IEEE Trans. Automat. Control, 54(6):1243-1253, 2009.
12. Even-Dar, E., Mannor, S., and Mansour, Y. PAC bounds for multi-armed bandit and Markov decision processes. In Proc. COLT, 2002.
13. Garivier, A. and Moulines, E. On upper-confidence bound policies for non-stationary bandit problems. In Proc. EWRL, 2008.
14. Hartland, C., Gelly, S., Baskiotis, N., Teytaud, O., and Sebag, M. Multi-armed bandit, dynamic environments and meta-bandits. In Workshops of NIPS, 2006.
15. Kiefer, J. Sequential minimax search for a maximum. Proc. Amer. Math. Soc., 4(3):502-506, 1953.
16. Kleinberg, R. Nearly tight bounds for the continuum-armed bandit problem. In Proc. NIPS, 2004.
17. Kleinberg, R., Slivkins, A., and Upfal, E. Multi-armed bandits in metric spaces. In Proc. STOC, 2008.
18. Lai, T. L. and Robbins, H. Asymptotically efficient adaptive allocation rules. Advances in Applied Mathematics, 6:4-22, 1985.
19. Mas-Collel, A., Whinston, M. D., and Green, J. R. Microeconomic Theory. Oxford University Press, 1995.
20. Müller-Hannemann, M. and Weihe, K. Algorithm Engineering, Pareto Shortest Paths is Often Feasible in Practice. Springer, 2001.
21. Pandey, S., Chakrabarti, D., and Agarwal, D. Multi-armed bandit problems with dependent arms. In Proc. ICML, 2007.
22. Spinrad, J. P. Efficient graph representations. American Mathematical Society, 2003.
23. Varian, H. R. Online ad auctions. American Economic Review, 99(2):430âǍŞ-434, 2009.
24. Yu, J. Y. and Mannor, S. Unimodal bandits. http://www.math.ens.fr/~jiayu/ unimodal.pdf.
25. Yu, J. Y. and Mannor, S. Piecewise-stationary bandit problems with side observations. In Proc. ICML, 2009.