[22] Sinho Chewi, Sébastien Bubeck, and Adil Salim, On the complexity of finding stationary points of smooth functions in one dimension, International Conference on Algorithmic Learning Theory, pp. 358-374, PMLR, 2023, arXiv:arXiv:2209.07513.
[23] Andrew M. Childs, Jiaqi Leng, Tongyang Li, Jin-Peng Liu, and Chenyi Zhang, Quantum simulation of real-space dynamics, Quantum 6 (2022), 680, arXiv:2203.17006.
[24] Arjan Cornelissen and Yassine Hamoudi, A sublinear-time quantum algorithm for approximating partition functions, Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1245-1264, SIAM, 2023, arXiv:2207.08643.
[25] Arjan Cornelissen, Yassine Hamoudi, and Sofiene Jerbi, Near-optimal quantum algorithms for multivariate mean estimation, Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, pp. 33-43, 2022, arXiv:2111.09787.
[26] Aaron Defazio, Francis Bach, and Simon Lacoste-Julien, *Saga: A fast incremental gradient method with support for non-strongly convex composite objectives*, Advances in neural information processing systems 27 (2014).
[27] John C Duchi, Introductory lectures on stochastic optimization, The mathematics of data 25 (2018), 99-186.
[28] John C. Duchi, Peter L. Bartlett, and Martin J. Wainwright, Randomized smoothing for stochastic optimization, SIAM Journal on Optimization 22 (2012), no. 2, 674-701.
[29] Cong Fang, Chris Junchi Li, Zhouchen Lin, and Tong Zhang, SPIDER: Near-optimal nonconvex optimization via stochastic path-integrated differential estimator, Advances in Neural Information Processing Systems 31 (2018), arXiv:1807.01695.
[30] Cong Fang, Zhouchen Lin, and Tong Zhang, Sharp analysis for nonconvex SGD escaping from saddle points, Conference on Learning Theory, pp. 1192–1234, 2019, arXiv:1902.00247.
[31] Ankit Garg, Robin Kothari, Praneeth Netrapalli, and Suhail Sherif, No quantum speedup over gradient descent for non-smooth convex optimization, 2020, arXiv:2010.01801.
[32] Ankit Garg, Robin Kothari, Praneeth Netrapalli, and Suhail Sherif, Near-optimal lower bounds for convex optimization for all orders of smoothness, Advances in Neural Information Processing Systems 34 (2021), 29874-29884, arXiv:2112.01118.
[33] A. V. Gasnikov, E. A. Gorbunov, D. A. Kovalev, A. A. Mohammed, E. O. Chernousova, et al., The global rate of convergence for optimal tensor methods in smooth convex optimization, Computer research and modeling 10 (2018), no. 6, 737-753, arXiv:1809.00382.
[34] Rong Ge, Furong Huang, Chi Jin, and Yang Yuan, *Escaping from saddle points - online stochastic gradient for tensor decomposition*, Proceedings of the 28th Conference on Learning Theory, Proceedings of Machine Learning Research, vol. 40, pp. 797-842, 2015, arXiv:1503.02101.
[35] Rong Ge, Chi Jin, and Yi Zheng, No spurious local minima in nonconvex low rank problems: A unified geometric analysis, International Conference on Machine Learning, pp. 1233-1242, PMLR, 2017, arXiv:1704.00708.
[36] Rong Ge, Jason D. Lee, and Tengyu Ma, Matrix completion has no spurious local minimum, Advances in Neural Information Processing Systems, pp. 2981-2989, 2016, arXiv:1605.07272.
[37] Rong Ge, Jason D. Lee, and Tengyu Ma, Learning one-hidden-layer neural networks with landscape design, International Conference on Learning Representations, 2018, arXiv:1711.00501.
[38] Rong Ge, Zhize Li, Weiyao Wang, and Xiang Wang, Stabilized SVRG: Simple variance reduction for nonconvex optimization, Conference on Learning Theory, pp. 1394-1448, PMLR, 2019, arXiv:1905.00529.
[39] Rong Ge and Tengyu Ma, On the optimization landscape of tensor decompositions, Advances in Neural Information Processing Systems, pp. 3656-3666, Curran Associates Inc., 2017, arXiv:1706.05598.
[40] Saeed Ghadimi and Guanghui Lan, Stochastic first-and zeroth-order methods for nonconvex stochastic programming, SIAM Journal on Optimization 23 (2013), no. 4, 2341-2368.