Adaptive algorithms for online convex optimization with long-term constraints

33rd International Conference on Machine Learning, ICML 2016

Volumn 1, Issue , 2016, Pages 620-629

  Jenatton, Rodolphe ^a   Huang, Jim C ^a   Archambeau, Cedric ^a  

^a AMAZON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE ALGORITHMS; ARTIFICIAL INTELLIGENCE; CONVEX OPTIMIZATION; ECONOMIC AND SOCIAL EFFECTS; LEARNING SYSTEMS;

COMPUTATIONALLY EFFICIENT; CONSTRAINT VIOLATION; CONVEX CONSTRAINTS; CONVEX DOMAINS; FINITE NUMBER; GRADIENT DESCENT ALGORITHMS; ONLINE CONVEX OPTIMIZATIONS; POLYHEDRAL SET;

OPTIMIZATION;

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

References (30)

1. Agrawal, S. and Devanur, N. R. (2015). Fast algorithms for online stochastic convex programming. In SODA 2015 (ACM-SIAM Symposium on Discrete Algorithms). SIAM-Society for Industrial and Applied Mathematics.
2. Awerbuch, B. and Kleinberg, R. (2008). Online linear optimization and adaptive routing. Journal of Computer and System Sciences, 74(1):97-114.
3. Badanidiyuru, A., Kleinberg, R., and Slivkins, A. (2013). Bandits with knapsacks. In Foundations of Computer Science (FOCS), 2013 IEEE 54th Annual Symposium on, pages 207-216.
4. Bertsekas, D. P. and Tsitsiklis, J. N. (1989). Parallel and Distributed Computation: Numerical Methods. Prentice-Hall, Inc.
5. Birkhoff, G. (1946). Tres observaciones sobre el algebra lineal. vUniv. Nac. Tucumán Rev. Ser. A, 5:147-151.
6. Borwein, J. M. and Lewis, A. S. (2006). Convex Analysis and Nonlinear Optimization: Theory and Examples. Springer.
7. Cesa-Bianchi, N. and Lugosi, G. (2006). Prediction, learning, and games. Cambridge University Press.
8. Defazio, A., Bach, F, and Lacoste-Julien, S. (2014). Saga: A fast incremental gradient method with support for nonstrongly convex composite objectives. Technical report, preprint arXiv: 1407.0202.
9. Diamond, S., Chu, E., and Boyd, S. (2014). CVXPY: A Python-embedded modeling language for convex optimization, version 0.2. http://cvxpy.org/.
10. Duchi, J., Hazan, E., and Singer, Y. (2011). Adaptive subgradient methods for online learning and stochastic optimization. Journal of Machine Learning Research, 12:2121-2159.
11. Fogel, F., Jenatton, R., Bach, F., and d'Aspremont, A. (2013). Convex relaxations for permutation problems. In Advances in Neural Information Processing Systems, pages 1016-1024.
12. Hazan, E., Agarwal, A., and Kale, S. (2007). Logarithmic regret algorithms for online convex optimization. Machine Learning, 69(2-3):169-192.
13. Hazan, E. and Kale, S. (2012). Projection-free online learning. In Proceedings of the International Conference on Machine Learning (ICML), pages 521-528.
14. Helmbold, D. P. and Warmuth, M. K. (2009). Learning permutations with exponential weights. Journal of Machine Learning Research, 10:1705-1736.
15. Koppel, A., Jakubiec, F. Y, and Ribeiro, A. (2014). A saddle point algorithm for networked online convex optimization. In Acoustics, Speech and Signal Processing (ICASSP), 2014 IEEE International Conference on, pages 8292-8296. IEEE.
16. Lemaréchal, C. and Sagastizábal, C. (1997). Practical aspects of the moreau-yosida regularization: Theoretical preliminaries. SIAM Journal on Optimization, 7(2):367-385.
17. Mahdavi, M., Jin, R., and Yang, T. (2012a). Trading regret for efficiency: online convex optimization with long term constraints. Journal of Machine Learning Research, 13(1):2503-2528.
18. Mahdavi, M., Yang, T., and Jin, R. (2012b). Efficient constrained regret minimization. Technical report, preprint arXiv: 1205.2265.
19. Mahdavi, M., Yang, T., Jin, R., Zhu, S., and Yi, J. (2012c). Stochastic gradient descent with only one projection. In Advances in Neural Information Processing Systems, pages 494-502.
20. Mannor, S. and Tsitsiklis, J. N. (2006). Online learning with constraints. In Learning Theory, pages 529-543. Springer.
21. McMahan, H. B. and Streeter, M. (2010). Adaptive bound optimization for online convex optimization. In Proceedings of the annual conference on Computational Learning Theory (COLT), page 244.
22. Nemirovski, A. (2004). Prox-method with rate of convergence o (1/t) for variational inequalities with lipschitz continuous monotone operators and smooth convexconcave saddle point problems. SIAM Journal on Optimization, 15(1):229-251.
23. Nocedal, J. and Wright, S. J. (2006). Numerical Optimization. Springer.
24. Shalev-Shwartz, S. (2011). Online learning and online convex optimization. Foundations and Trends in Machine Learning, 4(2):107-194.
25. Shalev-Shwartz, S. and Kakade, S. M. (2009). Mind the duality gap: Logarithmic regret algorithms for online optimization. In Advances in Neural Information Processing Systems, pages 1457-1464.
26. Wang, H. and Banerjee, A. (2013). Online alternating direction method. Technical report, preprint arXiv: 1306.3721.
27. Xu, Z., Weinberger, K., and Chapelle, O. (2012). The greedy miser: Learning under test-time budgets. Technical report, preprint arXiv: 1206.6451.
28. Zass, R. and Shashua, A. (2006). Doubly stochastic normalization for spectral clustering. In Advances in Neural Information Processing Systems, pages 1569-1576.
29. Zinkevich, M. (2003). Online convex programming and generalized infinitesimal gradient ascent. In Proceedings of the International Conference on Machine Learning (ICML).
30. Zou, H. and Hastie, T. (2005). Regularization and variable selection via the elastic net. Journal of the Royal Statistical Society. Series B, 67(2):301-320.