[41] Michael B. Giles, Multilevel Monte Carlo methods, Acta Numerica 24 (2015), 259-328.
[42] András Gilyén and Tongyang Li, Distributional property testing in a quantum world, 11th Innovations in Theoretical Computer Science Conference (ITCS 2020), Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2020, arXiv:1902.00814.
[43] Weiyuan Gong, Chenyi Zhang, and Tongyang Li, Robustness of quantum algorithms for nonconvex optimization, 2022, arXiv:2212.02548.
[44] Yassine Hamoudi, Quantum sub-Gaussian mean estimator, 29th Annual European Symposium on Algorithms (ESA 2021), Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2021, arXiv:2108.12172.
[45] Yassine Hamoudi and Frédéric Magniez, Quantum Chebyshev's inequality and applications, 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019), 2019, arXiv:1807.06456.
[46] Moritz Hardt, Tengyu Ma, and Benjamin Recht, Gradient descent learns linear dynamical systems, Journal of Machine Learning Research 19 (2018), no. 29, 1-44, arXiv:1609.05191.
[47] Trevor Hastie, Robert Tibshirani, Jerome H. Friedman, and Jerome H. Friedman, The elements of statistical learning: Data mining, inference, and prediction, vol. 2, Springer, 2009.
[48] Haotian Jiang, Yin Tat Lee, Zhao Song, and Sam Chiu-wai Wong, An improved cutting plane method for convex optimization, convex-concave games, and its applications, Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, pp. 944–953, 2020, arXiv:2004.04250.
[49] Chi Jin, Rong Ge, Praneeth Netrapalli, Sham M. Kakade, and Michael I. Jordan, How to escape saddle points efficiently, Proceedings of the 34th International Conference on Machine Learning, vol. 70, pp. 1724-1732, 2017, arXiv:1703.00887.
[50] Chi Jin, Praneeth Netrapalli, Rong Ge, Sham M Kakade, and Michael I. Jordan, On nonconvex optimization for machine learning: Gradients, stochasticity, and saddle points, Journal of the ACM (JACM) 68 (2021), no. 2, 1–29, arXiv:1902.04811.
[51] Rie Johnson and Tong Zhang, Accelerating stochastic gradient descent using predictive variance reduction, Advances in neural information processing systems 26 (2013).
[52] Stephen P. Jordan, Fast quantum algorithm for numerical gradient estimation, Physical Review Letters 95 (2005), no. 5, 050501, arXiv:quant-ph/0405146.
[53] Jonathan Kelner, Jerry Li, Allen X. Liu, Aaron Sidford, and Kevin Tian, Semi-random sparse recovery in nearly-linear time, The Thirty Sixth Annual Conference on Learning Theory, pp. 2352-2398, PMLR, 2023, arXiv:2203.04002.
[54] Iordanis Kerenidis and Anupam Prakash, A quantum interior point method for LPs and SDPs, 2018, arXiv:1808.09266.
[55] A. Yu. Kitaev, Quantum measurements and the Abelian stabilizer problem, (1995), arXiv:quant-ph/9511026.
[56] Robin Kothari and Ryan O'Donnell, Mean estimation when you have the source code; or, quantum Monte Carlo methods, Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1186-1215, SIAM, 2023, arXiv:2208.07544.
[57] Guanghui Lan, An optimal method for stochastic composite optimization, Mathematical Programming 133 (2012), no. 1-2, 365-397.
[58] Yin Tat Lee, Aaron Sidford, and Sam Chiu-wai Wong, A faster cutting plane method and its implications for combinatorial and convex optimization, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, pp. 1049-1065, IEEE, 2015, arXiv:1508.04874.
[59] Tongyang Li and Xiaodi Wu, Quantum query complexity of entropy estimation, IEEE Transactions on Information Theory 65 (2018), no. 5, 2899-2921, arXiv:1710.06025.
[60] Xiantao Li, Enabling quantum speedup of markov chains using a multi-level approach, 2022.
[61] Zhize Li, SSRGD: Simple stochastic recursive gradient descent for escaping saddle points, Advances in Neural Information Processing Systems 32 (2019), 1523-1533, arXiv:1904.09265.