Exploiting easy data in online optimization

Advances in Neural Information Processing Systems

Volumn 1, Issue January, 2014, Pages 810-818

  Sani, Amir ^a   Neu, Gergely ^a   Lazaric, Alessandro ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BENCHMARKING; INFORMATION SCIENCE; SOCIAL NETWORKING (ONLINE);

ONLINE OPTIMIZATION; PREDICTION WITH EXPERT ADVICE; SHIFTING EXPERTS; STATE OF THE ART; THEORETICAL BOUNDS;

LEARNING ALGORITHMS;

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

References (25)

1. Agarwal, A., Dekel, O., and Xiao, L. (2010). Optimal algorithms for online convex optimization with multipoint bandit feedback. In Kalai, A. and Mohri, M., editors, Proceedings of the 23rd Annual Conference on Learning Theory (COLT 2010), pages 28-40.
2. Auer, P., Cesa-Bianchi, N., and Fischer, P. (2002a). Finite-time analysis of the multiarmed bandit problem. Mach. Learn., 47(2-3):235-256.
3. Auer, P., Cesa-Bianchi, N., Freund, Y., and Schapire, R. E. (2002b). The nonstochastic multiarmed bandit problem. SIAM J. Comput., 32(1):48-77.
4. Bartlett, P. L., Hazan, E., and Rakhlin, A. (2008). Adaptive online gradient descent. In Platt, J. C., Koller, D., Singer, Y., and Roweis, S. T., editors, Advances in Neural Information Processing Systems 20, pages 65-72. Curran Associates. (December 3-6, 2007).
5. Bubeck, S. and Slivkins, A. (2012). The best of both worlds: Stochastic and adversarial bandits. In COLT, pages 42.1-42.23.
6. Cesa-Bianchi, N. and Lugosi, G. (2006). Prediction, Learning, and Games. Cambridge University Press, New York, NY, USA.
7. Cesa-Bianchi, N., Mansour, Y., and Stoltz, G. (2007). Improved second-order bounds for prediction with expert advice. Machine Learning, 66(2-3):321-352.
8. de Rooij, S., van Erven, T., Grünwald, P. D., and Koolen, W. M. (2014). Follow the leader if you can, hedge if you must. Accepted to the Journal of Machine Learning Research.
9. Even-Dar, E., Kearns, M., Mansour, Y., and Wortman, J. (2008). Regret to the best vs. regret to the average. Machine Learning, 72(1-2):21-37.
10. Freund, Y. and Schapire, R. E. (1997). A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55:119-139.
11. Gaillard, P., Stoltz, G., and van Erven, T. (2014). A second-order bound with excess losses. In Balcan, M.-F. and Szepesvári, Cs., editors, Proceedings of The 27th Conference on Learning Theory, Volume 35 of JMLR Proceedings, pages 176-196. JMLR.org.
12. Geulen, S., Vöcking, B., and Winkler, M. (2010). Regret minimization for online buffering problems using the weighted majority algorithm. In COLT, pages 132-143.
13. Grunwald, P., and Koolen, W. M., and Rakhlin, A., editors (2013). NIPS Workshop on "Learning faster from easy data".
14. György, A., Linder, T., and Lugosi, G. (2012). Efficient tracking of large classes of experts. IEEE Transactions on Information Theory, 58(11):6709-6725.
15. György, A. and Neu, G. (2013). Near-optimal rates for limited-delay universal lossy source coding. Submitted to the IEEE Transactions on Information Theory.
16. Hannan, J. (1957). Approximation to Bayes risk in repeated play. Contributions to the theory of games, 3:97-139.
17. Hazan, E., Agarwal, A., and Kale, S. (2007). Logarithmic regret algorithms for online convex optimization. Machine Learning, 69:169-192.
18. Herbster, M. and Warmuth, M. (1998). Tracking the best expert. Machine Learning, 32:151-178.
19. Kalai, A. and Vempala, S. (2005). Efficient algorithms for online decision problems. Journal of Computer and System Sciences, 71:291-307.
20. Littlestone, N. and Warmuth, M. (1994). The weighted majority algorithm. Information and Computation, 108:212-261.
21. Seldin, Y., Bartlett, P., Crammer, K., and Abbasi-Yadkori, Y. (2014). Prediction with limited advice and multiarmed bandits with paid observations. In Proceedings of the 30th International Conference on Machine Learning (ICML 2013), page 280-287.
22. Seldin, Y. and Slivkins, A. (2014). One practical algorithm for both stochastic and adversarial bandits. In Proceedings of the 30th International Conference on Machine Learning (ICML 2014), pages 1287-1295.
23. Vovk, V. (1990). Aggregating strategies. In Proceedings of the third annual workshop on Computational learning theory (COLT), pages 371-386.
24. Warmuth, M. and Koolen, W. (2014). Shifting experts on easy data. COLT 2014 open problem.
25. Zinkevich, M. (2003). Online convex programming and generalized infinitesimal gradient ascent. In Proceedings of the Twentieth International Conference on Machine Learning (ICML).