Online optimization: Competing with dynamic comparators

Journal of Machine Learning Research

Volumn 38, Issue , 2015, Pages 398-406

  Jadbabaie, Ali ^a   Rakhlin, Alexander ^a   Shahrampour, Shahin ^a   Sridharan, Karthik ^b  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b Department of Molecular Biology and Genetics   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE ALGORITHMS; ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPARATOR CIRCUITS; COST FUNCTIONS; GAME THEORY;

ADAPTIVE METHODS; COMPLEX BENCHMARK; COMPLEXITY MEASURES; DYNAMIC COMPARATORS; ONLINE OPTIMIZATION; PREDICTION METHODS; TWO-PLAYER GAMES; WORST-CASE PERFORMANCE;

COMPARATORS (OPTICAL);

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

References (18)

1. N. Cesa-Bianchi, G. Lugosi et al., Prediction, learning, and games. Cambridge University Press Cambridge, 2006, vol. 1, no. 1.1.
2. Y. Freund and R. E. Schapire, "A decision-theoretic generalization of on-line learning and an application to boosting, " Journal of computer and system sciences, vol. 55, no. 1, pp. 119-139, 1997.
3. M. Zinkevich, "Online convex programming and generalized infinitesimal gradient ascent, " in International Conference on Machine Learning, 2003.
4. E. Hazan, A. Agarwal, and S. Kale, "Logarithmic regret algorithms for online convex optimization, " Ma. chine Learning, vol. 69, no. 2-3, pp. 169-192, 2007.
5. J. Abernethy, P. L. Bartlett, A. Rakhlin, and A. Tewari, "Optimal strategies and minimax lower bounds for online convex games, " in Proceedings of the Nineteenth Annual Conference on Computational Learning Theory, 2008.
6. O. Bousquet and M. K. Warmuth, "Tracking a small set of experts by mixing past posteriors, " The Journal of Machine Learning Research, vol. 3, pp. 363-396, 2003.
7. N. Cesa-Bianchi, P. Gaillard, G. Lugosi, and G. Stoltz, "A new look at shifting regret, " CoRR abs/1202.3323, 2012.
8. N. Buchbinder, S. Chen, J. Naor, and O. Shamir, "Unified algorithms for online learning and competitive analysis." Journal of Machine Learning Research-Proceedings Track, vol. 23, pp. 5-1, 2012.
9. E. C. Hall and R. M. Willett, "Online optimization in dynamic environments, " arXiv preprint arXiv:1307.5944, 2013.
10. A. Rakhlin and K. Sridharan, "Online learning with predictable sequences, " in Conference on Learning Theory, 2013, pp. 993-1019.
11. -, "Optimization, learning, and games with predictable sequences, " in Advances in Neural Information Processing Systems, 2013, pp. 3066-3074.
12. E. Hazan and S. Kale, "Extracting certainty from uncertainty: Regret bounded by variation in costs, " Machine learning, vol. 80, no. 2-3, pp. 165-188, 2010.
13. C.-K. Chiang, T. Yang, C.-J. Lee, M. Mahdavi, C.-J. Lu, R. Jin, and S. Zhu, "Online optimization with gradual variations, " in Conference on Learning Theory, 2012.
14. O. Besbes, Y. Gur, and A. Zeevi, "Non-stationary stochastic optimization, " arXiv preprint arXiv.1307.5449, 2013.
15. C. Daskalakis, A. Deckelbaum, and A. Kim, "Near-optimal no-regret algorithms for zero-sum games, " Games and Economic Behavior, 2014.
16. A. S. Nemirovski and D. B. Yudin, Problem complexity and method efficiency in optimization. Wiley (Chichester and New York), 1983.
17. A. Beck and M. Teboulle, "Mirror descent and nonlinear projected subgradient methods for convex optimization, " Operations Research Letters, vol. 31, no. 3, pp. 167-175, 2003.
18. A. Nemirovski, "Prox-method with rate of convergence o (1/t) for variational inequalities with lipschitz continuous monotone operators and smooth convex-concave saddle point problems, " SIAM Journal on Optimization, vol. 15, no. 1, pp. 229-251, 2004.