[3] Zeyuan Allen-Zhu and Yuanzhi Li, Neon2: Finding local minima via first-order oracles, Advances in Neural Information Processing Systems, pp. 3716-3726, 2018, arXiv:1711.06673.
[4] Dong An, Noah Linden, Jin-Peng Liu, Ashley Montanaro, Changpeng Shao, and Jiasu Wang, Quantum-accelerated multilevel Monte Carlo methods for stochastic differential equations in mathematical finance, Quantum 5 (2021), 481, arXiv:2012.06283.
[5] Joran van Apeldoorn, András Gilyén, Sander Gribling, and Ronald de Wolf, Convex optimization using quantum oracles, Quantum 4 (2020), 220, arXiv:1809.00643.
[6] Yossi Arjevani, Yair Carmon, John C. Duchi, Dylan J. Foster, Nathan Srebro, and Blake Woodworth, Lower bounds for non-convex stochastic optimization, Mathematical Programming (2022), 1–50, arXiv:1912.02365.
[7] Hilal Asi, Yair Carmon, Arun Jambulapati, Yujia Jin, and Aaron Sidford, Stochastic bias-reduced gradient methods, Advances in Neural Information Processing Systems 34 (2021), 10810-10822, arXiv:2106.09481.
[8] Srinadh Bhojanapalli, Behnam Neyshabur, and Nati Srebro, Global optimality of local search for low rank matrix recovery, Proceedings of the 30th International Conference on Neural Information Processing Systems, pp. 3880-3888, 2016, arXiv:1605.07221.
[9] Ernesto G. Birgin, J. L. Gardenghi, José Mario Martínez, Sandra Augusta Santos, and Ph. L. Toint, Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models, Mathematical Programming 163 (2017), no. 1, 359–368.
[10] Jose H. Blanchet and Peter W. Glynn, Unbiased Monte Carlo for optimization and functions of expectations via multi-level randomization, 2015 Winter Simulation Conference (WSC), pp. 3656-3667, IEEE, 2015.
[11] Stephen Boyd and Almir Mutapcic, Stochastic subgradient methods, Lecture Notes for EE364b, Stanford University (2008), 97.
[12] Fernando G.S.L. Brandão, Amir Kalev, Tongyang Li, Cedric Yen-Yu Lin, Krysta M. Svore, and Xiaodi Wu, Quantum SDP solvers: Large speed-ups, optimality, and applications to quantum learning, Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, Leibniz International Proceedings in Informatics (LIPics), vol. 132, pp. 27:1-27:14, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2019, arXiv:1710.02581.
[13] Fernando G.S.L. Brandão and Krysta M. Svore, Quantum speed-ups for solving semidefinite programs, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), pp. 415-426, IEEE, 2017, 1609.05537.
[14] Gilles Brassard, Peter Hoyer, Michele Mosca, and Alain Tapp, Quantum amplitude amplification and estimation, Contemporary Mathematics 305 (2002), 53-74, arXiv:quant-ph/0005055.
[15] Sébastien Bubeck, Qijia Jiang, Yin-Tat Lee, Yuzhhi Li, and Aaron Sidford, Complexity of highly parallel non-smooth convex optimization, Advances in neural information processing systems 32 (2019), arXiv:1906.10655.
[16] Yair Carmon, John C. Duchi, Oliver Hinder, and Aaron Sidford, “Convex until proven guilty”: Dimension-free acceleration of gradient descent on non-convex functions, International conference on machine learning, pp. 654–663, PMLR, 2017, arXiv:1705.02766.
[17] Yair Carmon, John C. Duchi, Oliver Hinder, and Aaron Sidford, Accelerated methods for nonconvex optimization, SIAM Journal on Optimization 28 (2018), no. 2, 1751-1772, arXiv:1611.00756.
[18] Yair Carmon, Arun Jambulapati, Yujia Jin, Yin Tat Lee, Daogao Liu, Aaron Sidford, and Kevin Tian, ReSQueing parallel and private stochastic convex optimization, 2023, arXiv:2301.00457.
[19] Nicolo Cesa-Bianchi, Alex Conconi, and Claudio Gentile, On the generalization ability of online learning algorithms, IEEE Transactions on Information Theory 50 (2004), no. 9, 2050-2057.
[20] Shouvanik Chakrabarti, Andrew M. Childs, Shih-Han Hung, Tongyang Li, Chunhao Wang, and Xiaodi Wu, Quantum algorithm for estimating volumes of convex bodies, ACM Transactions on Quantum Computing 4 (2023), no. 3, 1-60, arXiv:1908.03903.
[21] Shouvanik Chakrabarti, Andrew M. Childs, Tongyang Li, and Xiaodi Wu, Quantum algorithms and lower bounds for convex optimization, Quantum 4 (2020), 221, arXiv:1809.01731.