SlowGuess/NeurIPS_2023_OCR huggingface dataset:
Shipra Agrawal and Nikhil R. Devanur. Bandits with concave rewards and convex knapsacks. In ACM Conference on Economics and Computation, 2014.
Shipra Agrawal and Nikhil R. Devanur. Bandits with global convex constraints and objective. Operations Research, 67(5):1486-1502, 2019.
Peter Auer, Nicolò Cesa-Bianchi, Yoav Freund, and Robert E. Schapire. The nonstochastic multiarmed bandit problem. SIAM Journal on Computing, 32(1):48-77, 2002.
Ashwinkumar Badanidiyuru, Robert Kleinberg, and Aleksandrs Slivkins. Bandits with knapsacks. Journal of the ACM, 65(3):1-55, 2018.
Avrim L. Blum. On-line algorithms in machine learning. Online Algorithms: The State of the Art, pages 306-325, 1998.
Xuanyu Cao and K. J. Ray Liu. Online convex optimization with time-varying constraints and bandit feedback. IEEE Transactions on Automatic Control, 64(7):2665-2680, 2019.
Matteo Castiglioni, Andrea Celli, Alberto Marchesi, Giulia Romano, and Nicola Gatti. A unifying framework for online optimization with long-term constraints. In Advances in Neural Information Processing Systems 36, 2022.
Tianyi Chen, Qing Ling, and Georgios B. Giannakis. An online convex optimization approach to proactive network resource allocation. IEEE Transactions on Signal Processing, 65(24):6350-6364, 2017.
Francisco Facchinei and Christian Kanzow. Generalized Nash equilibrium problems. A Quarterly Journal of Operations Research, 5:173-210, 2007.
Francisco Facchinei and Christian Kanzow. Penalty methods for the solution of generalized Nash equilibrium problems. SIAM Journal on Optimization, 20(5):2228-2253, 2010.
Yoav Freud and Robert E. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1):119-139, 1997.
Dan Garber and Ben Kretzu. New projection-free algorithms for online convex optimization with adaptive regret guarantees. In Conference on Learning Theory, 2022.
Elad Hazan. Introduction to online convex optimization. Foundation and Trends in Optimization, 2 (3-4):157-325, 2016.
Nicole Immorlica, Karthik Abinav Sankararaman, Robert E. Schapire, and Aleksandrs Slivkins. Adversarial bandits with knapsacks. Journal of the ACM, 69(6):40:1-40:47, 2022.
Rodolphe Jenatton, Jim Huang, and Cedric Archambeau. Adaptive algorithms for online convex optimization with long-term constraints. In 33th International Conference on Machine Learning, 2016.
M. I. Jordan. Artificial intelligence – the revolution hasn't happened yet. Harvard Data Science Review, 1(1):1-8, 2019.
M. I. Jordan and T. M. Mitchell. Machine learning: Trends, perspectives, and prospects. Science, 349(6245):255-260, 2015.
Michael I. Jordan, Tianyi Lin, and Manolis Zampetakis. First-order algorithms for nonlinear generalized Nash equilibrium problems. Journal of Machine Learning Research, 24:38:1-38:46, 2023.
Jong Gwang Kim. Equilibrium computation of generalized nash games: A new Lagrangian-based approach. In 22nd Conference on Economics and Computation, 2021.
Tor Lattimore and Csaba Szepesvári. Bandit Algorithms. Cambridge University Press, 2020.
Kfir Y. Levy and Andreas Krause. Projection free online learning over smooth sets. In 22nd International Conference on Artificial Intelligence and Statistics, 2019.
Nick Littlestone and Manfred K. Warmuth. The weighted majority algorithm. Information and Computation, 108(2):212-261, 1994.
Qingsong Liu, Wenfei Wu, Longbo Huang, and Zhixuan Fang. Simultaneously achieving sublinear regret and constraint violations for online convex optimization with time-varying constraints. Performance Evaluation, 49(3):4-5, 2022.
Zhou Lu, Nataly Brukhim, Paula Gradu, and Elad Hazan. Projection-free adaptive regret with membership oracles. In International Conference on Algorithmic Learning Theory, 2023.
Mehrdad Mahdavi, Rong Jin, and Tianbao Yang. Trading regret for efficiency: online convex optimization with long term constraints. Journal of Machine Learning Research, 13(81):2503-2528, 2012.
Shie Mannor, John N. Tsitsiklis, and Jia Yuan Yu. Online learning with sample path constraints. Journal of Machine Learning Research, 10(20):569-590, 2009.
Zakaria Mhammedi. Efficient projection-free online convex optimization with membership oracle. In Conference on Learning Theory, 2022.
Michael Muehlebach and Michael I. Jordan. On constraints in first-order optimization: A view from non-smooth dynamical systems. Journal of Machine Learning Research, 23(256):1-47, 2022.
Michael J. Neely and Hao Yu. Online convex optimization with time-varying constraints. arXiv preprint arXiv:1702.04783, 2017.
Wen Sun, Debadeepta Dey, and Ashish Kapoor. Safety-aware algorithms for adversarial contextual bandit. In 34th International Conference on Machine Learning, 2017.
Xinlei Yi, Xiuxian Li, Tao Yang, Lihua Xie, Tianyou Chai, and Karl H. Johansson. Regret and cumulative constraint violation analysis for online convex optimization with long term constraints. In 38th International Conference on Machine Learning, 2021.
Hao Yu and Michael J. Neely. A low complexity algorithm with  $\mathrm{o}(\sqrt{\mathrm{t}})$  regret and O(1) constraint violations for online convex optimization with long term constraints. Journal of Machine Learning Research, 21(1):1-24, 2020.
Hao Yu, Michael Neely, and Xiaohan Wei. Online convex optimization with stochastic constraints. In Advances in Neural Information Processing Systems 30, 2017.
Jianjun Yuan and Andrew Lamperski. Online convex optimization for cumulative constraints. In Advances in Neural Information Processing Systems 31, 2018.
Martin Zinkevich. Online convex programming and generalized infinitesimal gradient ascent. In 20th International Conference on Machine Learning, 2003.