Online learning with predictable sequences

Journal of Machine Learning Research

Volumn 30, Issue , 2013, Pages 993-1019

  Rakhlin, Alexander ^a   Sridharan, Karthik ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

OPTIMIZATION;

MODEL SELECTION; ONLINE LEARNING; ONLINE LINEAR OPTIMIZATIONS; PATH LENGTH; PRIOR KNOWLEDGE; REGRET BOUNDS; SIDE INFORMATION;

E-LEARNING;

EID: 84898022795     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (16)

1. J. Abernethy and A. Rakhlin. Beating the adaptive bandit with high probability. Technical Report UCB/EECS-2009-10, EECS Department, University of California, Berkeley, Jan 2009.
2. J. Abernethy, E. Hazan, and A. Rakhlin. Competing in the dark: An efficient algorithm for bandit linear optimization. In Proceedings of the 21st Annual Conference on Learning Theory (COLT), Volume 3, page 3, 2008.
3. J.D. Abernethy, E. Hazan, and A. Rakhlin. Interior-point methods for full-information and bandit online learning. Information Theory, IEEE Transactions on, 58(7): 4164-4175, 2012.
4. P. Auer, N. Cesa-Bianchi, Y. Freund, and R. E. Schapire. The nonstochastic multiarmed bandit problem. SIAM J. Comput., 32(1): 48-77, 2003.
5. P.L. Bartlett, E. Hazan, and A. Rakhlin. Adaptive online gradient descent. Advances in Neural Information Processing Systems, 20: 65-72, 2007.
6. A. Beck and M. Teboulle. Mirror descent and nonlinear projected subgradient methods for convex optimization. Operations Research Letters, 31(3): 167-175, 2003.
7. N. Cesa-Bianchi and G. Lugosi. Prediction, Learning, and Games. Cambridge University Press, 2006.
8. N. Cesa-Bianchi, Y. Mansour, and G. Stoltz. Improved second-order bounds for prediction with expert advice. Machine Learning, 66(2): 321-352, 2007.
9. C.-K. Chiang, T. Yang, C.-J. Lee, M. Mahdavi, C.-J. Lu, R. Jin, and S. Zhu. Online optimization with gradual variations. In COLT, 2012.
10. E. Hazan and S. Kale. Better algorithms for benign bandits. In Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 38-47. Society for Industrial and Applied Mathematics, 2009.
11. E. Hazan and S. Kale. Extracting certainty from uncertainty: Regret bounded by variation in costs. Machine learning, 80(2): 165-188, 2010.
12. A.S. Nemirovski and M.J. Todd. Interior-point methods for optimization. Acta Numerica, 17(1): 191-234, 2008.
13. A. Rakhlin. Lecture notes on online learning, 2008. Available at http://www-stat.wharton.upenn.edu/~rakhlin/papers/online-learning.pdf.
14. A. Rakhlin, K. Sridharan, and A. Tewari. Online learning: Random averages, combinatorial parameters, and learnability. In NIPS, 2010. Available at http://arXiv.org/abs/1006.1138.
15. A. Rakhlin, K. Sridharan, and A. Tewari. Online learning: Stochastic, constrained, and smoothed adversaries. In NIPS, 2011. Available at http://arXiv.org/abs/1104.5070.
16. A. Rakhlin, O. Shamir, and K. Sridharan. Relax and localize: From value to algorithms. CoRR, abs/1204.0870, 2012. Submitted.