暂无分享,去创建一个
Sham M. Kakade | Sébastien Bubeck | Nicolò Cesa-Bianchi | S. Kakade | N. Cesa-Bianchi | Sébastien Bubeck
[1] Baruch Awerbuch,et al. Adaptive routing with end-to-end feedback: distributed learning and geometric approaches , 2004, STOC '04.
[2] Nicolò Cesa-Bianchi,et al. Combinatorial Bandits , 2012, COLT.
[3] Manfred K. Warmuth,et al. Relative Loss Bounds for Multidimensional Regression Problems , 1997, Machine Learning.
[4] Jacob D. Abernethy,et al. Beating the adaptive bandit with high probability , 2009, 2009 Information Theory and Applications Workshop.
[5] Sébastien Bubeck,et al. Introduction to Online Optimization , 2011 .
[6] Martin Zinkevich,et al. Online Convex Programming and Generalized Infinitesimal Gradient Ascent , 2003, ICML.
[7] Lin Xiao,et al. Optimal Algorithms for Online Convex Optimization with Multi-Point Bandit Feedback. , 2010, COLT 2010.
[8] Thomas P. Hayes,et al. The Price of Bandit Information for Online Optimization , 2007, NIPS.
[9] John Darzentas,et al. Problem Complexity and Method Efficiency in Optimization , 1983 .
[10] Peter Auer,et al. The Nonstochastic Multiarmed Bandit Problem , 2002, SIAM J. Comput..
[11] Wei Chu,et al. Contextual Bandits with Linear Payoff Functions , 2011, AISTATS.
[12] Gábor Lugosi,et al. Minimax Policies for Combinatorial Prediction Games , 2011, COLT.
[13] Avrim Blum,et al. Online Geometric Optimization in the Bandit Setting Against an Adaptive Adversary , 2004, COLT.
[14] Jean-Yves Audibert,et al. Regret Bounds and Minimax Policies under Partial Monitoring , 2010, J. Mach. Learn. Res..
[15] Gábor Lugosi,et al. Prediction, learning, and games , 2006 .
[16] K. Ball. An Elementary Introduction to Modern Convex Geometry , 1997 .
[17] Elad Hazan,et al. Competing in the Dark: An Efficient Algorithm for Bandit Linear Optimization , 2008, COLT.
[18] Ambuj Tewari,et al. Regularization Techniques for Learning with Matrices , 2009, J. Mach. Learn. Res..
[19] Jean-Yves Audibert,et al. Minimax Policies for Adversarial and Stochastic Bandits. , 2009, COLT 2009.
[20] Elad Hazan. The convex optimization approach to regret minimization , 2011 .
[21] Y. Freund,et al. The non-stochastic multi-armed bandit problem , 2001 .
[22] Ambuj Tewari,et al. On the Universality of Online Mirror Descent , 2011, NIPS.
[23] A. Nemirovski. Advances in convex optimization : conic programming , 2005 .