Competing in the dark: An efficient algorithm for bandit linear optimization

21st Annual Conference on Learning Theory, COLT 2008

Volumn , Issue , 2008, Pages 263-273

  Abernethy, Jacob ^a   Hazan, Elad ^b   Rakhlin, Alexander ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INTERIOR POINT METHODS; LINEAR OPTIMIZATION; MULTI-ARMED BANDIT PROBLEM; NATURAL GENERALIZATION; ONLINE LEARNING; ONLINE LINEAR OPTIMIZATIONS; OPTIMAL ALGORITHM; POTENTIAL FUNCTION;

ALGORITHMS;

OPTIMIZATION;

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

References (21)

1. Peter Auer, Nicolò Cesa-Bianchi, Yoav Freund, and Robert E. Schapire. The nonstochastic multiarmed bandit problem. SIAM J. Comput., 32(1): 48-77, 2003.
2. Baruch Awerbuch and Robert D. Kleinberg. Adaptive routing with end-to-end feedback: distributed learning and geometric approaches. In STOC '04: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, pages 45-53, New York, NY, USA, 2004. ACM.
3. P. Bartlett, V. Dani, T. Hayes, S. Kakade, A. Rakhlin, and A. Tewari. High-probability bounds for the regret of bandit online linear optimization, 2008. In submission to COLT 2008.
4. A. Ben-Tal and A. Nemirovski. Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications, volume 2 of MPS/SIAM Series on Optimization. SIAM, Philadelphia, 2001.
5. Nicolò Cesa-Bianchi and Gábor Lugosi. Prediction, Learning, and Games. Cambridge University Press, 2006.
6. Varsha Dani, Thomas Hayes, and Sham Kakade. The price of bandit information for online optimization. In J.C. Platt, D. Koller, Y. Singer, and S. Roweis, editors, Advances in Neural Information Processing Systems 20. MIT Press, Cambridge, MA, 2008.
7. Varsha Dani and Thomas P. Hayes. Robbing the bandit: less regret in online geometric optimization against an adaptive adversary. In SODA '06: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, pages 937-943, New York, NY, USA, 2006. ACM.
8. Meir Feder, Neri Merhav, and Michael Gutman. Correction to 'universal prediction of individual sequences' (jul 92 1258-1270). IEEE Transactions on Information Theory, 40(1): 285, 1994.
9. Abraham D. Flaxman, Adam Tauman Kalai, and H. Brendan McMahan. Online convex optimization in the bandit setting: gradient descent without a gradient. In SODA '05: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, pages 385-394, Philadelphia, PA, USA, 2005. Society for Industrial and Applied Mathematics.
10. D. P. Helmbold, J. Kivinen, and M. K. Warmuth. Relative loss bounds for single neurons. IEEE Transactions on Neural Networks, 10(6): 1291-1304, November 1999.
11. Adam Kalai and Santosh Vempala. Efficient algorithms for online decision problems. Journal of Computer and System Sciences, 71(3): 291-307, 2005.
12. Jyrki Kivinen and Manfred K. Warmuth. Exponentiated gradient versus gradient descent for linear predictors. Inf. Comput., 132(1): 1-63, 1997.
13. Nick Littlestone and Manfred K. Warmuth. The weighted majority algorithm. Information and Computation, 108(2): 212-261, 1994.
14. H. Brendan McMahan and Avrim Blum. Online geometric optimization in the bandit setting against an adaptive adversary. In COLT, pages 109-123, 2004.
15. A.S. Nemirovskii. Interior point polynomial time methods in convex programming, 2004. Lecture Notes.
16. Y. E. Nesterov and A. S. Nemirovskii. Interior Point Polynomial Algorithms in Convex Programming. SIAM, Philadelphia, 1994.
17. Satish Rao. Lecure notes: Cs 270, graduate algorithms. 2006.
18. Herbert Robbins. Some aspects of the sequential design of experiments. Bull. Amer. Math. Soc., 58(5): 527-535, 1952.
19. Shai Shalev-Shwartz and Yoram Singer. A primal-dual perspective of online learning algorithms. Mach. Learn., 69(2-3): 115-142, 2007.
20. Eiji Takimoto and Manfred K. Warmuth. Path kernels and multiplicative updates. J. Mach. Learn. Res., 4: 773-818, 2003.
21. Martin Zinkevich. Online convex programming and generalized infinitesimal gradient ascent. In ICML, pages 928-936, 2003.