Online convex optimization with stochastic constraints

Advances in Neural Information Processing Systems

Volumn 2017-December, Issue , 2017, Pages 1429-1439

  Yu, Hao ^a   Neely, Michael J ^a   Wei, Xiaohan ^a  

^a University of Southern California ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINED OPTIMIZATION; CONVEX OPTIMIZATION; DECISION MAKING; PROBLEM SOLVING;

CONSTRAINED CONVEX OPTIMIZATIONS; CONSTRAINT VIOLATION; FUNCTIONAL CONSTRAINTS; NOISY OBSERVATIONS; ONLINE CONVEX OPTIMIZATIONS; SCHEDULING PROBLEM; STOCHASTIC CONSTRAINTS; STOCHASTIC ENVIRONMENT;

STOCHASTIC SYSTEMS;

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

References (29)

1. New York ISO open access pricing data. http://www.nyiso.com/.
2. Peter L Bartlett, Varsha Dani, Thomas Hayes, Sham Kakade, Alexander Rakhlin, and Ambuj Tewari. High-probability regret bounds for bandit online linear optimization. In Proceedings of Conference on Learning Theory (COLT), 2008.
3. Nicolò Cesa-Bianchi, Philip M Long, and Manfred K Warmuth. Worst-case quadratic loss bounds for prediction using linear functions and gradient descent. IEEE Transactions on Neural Networks, 7(3):604-619, 1996.
4. Nicolò Cesa-Bianchi and Gábor Lugosi. Prediction, Learning, and Games. Cambridge University Press, 2006.
5. Andrew Cotter, Maya Gupta, and Jan Pfeifer. A light touch for heavily constrained sgd. In Proceedings of Conference on Learning Theory (COLT), 2015.
6. Joseph L Doob. Stochastic processes. Wiley New York, 1953.
7. Rick Durrett. Probability: Theory and Examples. Cambridge University Press, 2010.
8. Anshul Gandhi, Mor Harchol-Balter, and Michael A Kozuch. Are sleep states effective in data centers? In International Green Computing Conference (IGCC), 2012.
9. Geoffrey J Gordon. Regret bounds for prediction problems. In Proceeding of Conference on Learning Theory (COLT), 1999.
10. Bruce Hajek. Hitting-time and occupation-time bounds implied by drift analysis with applications. Advances in Applied Probability, 14(3):502-525, 1982.
11. Elad Hazan. Introduction to online convex optimization. Foundations and Trends in Optimization, 2(3-4):157-325, 2016.
12. Elad Hazan, Amit Agarwal, and Satyen Kale. Logarithmic regret algorithms for online convex optimization. Machine Learning, 69:169-192, 2007.
13. Rodolphe Jenatton, Jim Huang, and Cédric Archambeau. Adaptive algorithms for online convex optimization with long-term constraints. In Proceedings of International Conference on Machine Learning (ICML), 2016.
14. Jyrki Kivinen and Manfred K Warmuth. Exponentiated gradient versus gradient descent for linear predictors. Information and Computation, 132(1):1-63, 1997.
15. Guanghui Lan and Zhiqiang Zhou. Algorithms for stochastic optimization with expectation constraints. arXiv:1604.03887, 2016.
16. Mehrdad Mahdavi, Rong Jin, and Tianbao Yang. Trading regret for efficiency: online convex optimization with long term constraints. Journal of Machine Learning Research, 13(1):2503-2528, 2012.
17. Mehrdad Mahdavi, Tianbao Yang, and Rong Jin. Stochastic convex optimization with multiple objectives. In Advances in Neural Information Processing Systems (NIPS), 2013.
18. Shie Mannor, John N Tsitsiklis, and Jia Yuan Yu. Online learning with sample path constraints. Journal of Machine Learning Research, 10:569-590, March 2009.
19. Angelia Nedić and Asuman Ozdaglar. Subgradient methods for saddle-point problems. Journal of Optimization Theory and Applications, 142(1):205-228, 2009.
20. Michael J. Neely. Energy-aware wireless scheduling with near optimal backlog and convergence time tradeoffs. IEEE/ACM Transactions on Networking, 24(4):2223-2236, 2016.
21. Yurii Nesterov. Introductory Lectures on Convex Optimization: A Basic Course. Springer Science & Business Media, 2004.
22. Asfandyar Qureshi, Rick Weber, Hari Balakrishnan, John Guttag, and Bruce Maggs. Cutting the electric bill for internet-scale systems. In ACM SIGCOMM, 2009.
23. Shai Shalev-Shwartz. Online learning and online convex optimization. Foundations and Trends in Machine Learning, 4(2):107-194, 2011.
24. Terence Tao and Van Vu. Random matrices: universality of local spectral statistics of non-hermitian matrices. The Annals of Probability, 43(2):782-874, 2015.
25. David Tse and Pramod Viswanath. Fundamentals of Wireless Communication. Cambridge University Press, 2005.
26. Van Vu. Concentration of non-lipschitz functions and applications. Random Structures & Algorithms, 20(3):262-316, 2002.
27. Hao Yu and Michael J. Neely. A low complexity algorithm with O(√T) regret and finite constraint violations for online convex optimization with long term constraints. arXiv:1604.02218, 2016.
28. Hao Yu and Michael J. Neely. A simple parallel algorithm with an O(1/t) convergence rate for general convex programs. SIAM Journal on Optimization, 27(2):759-783, 2017.
29. Martin Zinkevich. Online convex programming and generalized infinitesimal gradient ascent. In Proceedings of International Conference on Machine Learning (ICML), 2003.