An efficient algorithm for learning with semi-bandit feedback

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 8139 LNAI, Issue , 2013, Pages 234-248

  Neu, Gergely ^a   Bartók, Gábor ^b  

^a BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

^b ETH ZURICH   (Switzerland)

Author keywords

bandit problems; combinatorial optimization; Follow the perturbed leader; online learning

Indexed keywords

BANDIT PROBLEMS; BINARY VECTORS; FOLLOW-THE-PERTURBED-LEADER; FULL INFORMATIONS; LOSS ESTIMATION; ONLINE LEARNING; PREDICTION METHODS; REGRET BOUNDS;

COMBINATORIAL OPTIMIZATION;

ALGORITHMS;

EID: 84887500930     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-40935-6_17     Document Type: Conference Paper

References (17)

1. Allenberg, C., Auer, P., Györfi, L., Ottucsák, G.: Hannan consistency in on-line learning in case of unbounded losses under partial monitoring. In: Balcázar, J.L., Long, P.M., Stephan, F. (eds.) ALT 2006. LNCS (LNAI), vol. 4264, pp. 229-243. Springer, Heidelberg (2006)
2. Audibert, J.-Y., Bubeck, S.: Regret bounds and minimax policies under partial monitoring. Journal of Machine Learning Research 11, 2635-2686 (2010)
3. Audibert, J.Y., Bubeck, S., Lugosi, G.: Regret in online combinatorial optimization. To appear in Mathematics of Operations Research (2013)
4. Auer, P., Cesa-Bianchi, N., Freund, Y., Schapire, R.E.: The nonstochastic multiarmed bandit problem. SIAM J. Comput. 32(1), 48-77 (2002)
5. Awerbuch, B., Kleinberg, R.D.: Adaptive routing with end-to-end feedback: distributed learning and geometric approaches. In: Proceedings of the 36th ACM Symposium on Theory of Computing, pp. 45-53 (2004)
6. Bubeck, S., Cesa-Bianchi, N., Kakade, S.M.: Towards minimax policies for online linear optimization with bandit feedback. In: Proceedings of the 25th Annual Conference on Learning Theory (COLT), pp. 1-14 (2012)
7. Cesa-Bianchi, N., Lugosi, G.: Prediction, Learning, and Games. Cambridge University Press, New York (2006)
8. Cesa-Bianchi, N., Lugosi, G.: Combinatorial bandits. Journal of Computer and System Sciences 78, 1404-1422 (2012)
9. Dani, V., Hayes, T., Kakade, S.: The price of bandit information for online optimization. In: Advances in Neural Information Processing Systems (NIPS), vol. 20, pp. 345-352 (2008)
10. György, A., Linder, T., Lugosi, G., Ottucsák, G.: The on-line shortest path problem under partial monitoring. Journal of Machine Learning Research 8, 2369-2403 (2007)
11. Hannan, J.: Approximation to Bayes risk in repeated play. Contributions to the Theory of Games 3, 97-139 (1957)
12. Kalai, A., Vempala, S.: Efficient algorithms for online decision problems. Journal of Computer and System Sciences 71, 291-307 (2005)
13. Koolen, W., Warmuth, M., Kivinen, J.: Hedging structured concepts. In: Proceedings of the 23rd Annual Conference on Learning Theory (COLT), pp. 93-105 (2010)
14. McMahan, H.B., Blum, A.: Online geometric optimization in the bandit setting against an adaptive adversary. In: Shawe-Taylor, J., Singer, Y. (eds.) COLT 2004. LNCS (LNAI), vol. 3120, pp. 109-123. Springer, Heidelberg (2004)
15. Poland, J.: FPL analysis for adaptive bandits. In: Lupanov, O.B., Kasim-Zade, O.M., Chaskin, A.V., Steinhöfel, K. (eds.) SAGA 2005. LNCS, vol. 3777, pp. 58-69. Springer, Heidelberg (2005)
16. Suehiro, D., Hatano, K., Kijima, S., Takimoto, E., Nagano, K.: Online prediction under submodular constraints. In: Bshouty, N.H., Stoltz, G., Vayatis, N., Zeugmann, T. (eds.) ALT 2012. LNCS, vol. 7568, pp. 260-274. Springer, Heidelberg (2012)
17. Takimoto, E., Warmuth, M.: Paths kernels and multiplicative updates. Journal of Machine Learning Research 4, 773-818 (2003)