[18] Arnak S Dalalyan and Avetik G Karagulyan. User-friendly guarantees for the langevin monte carlo with inaccurate gradient. arXiv preprint arXiv:1710.00095, 2017.
[19] Arnak S. Dalalyan and Lionel Riou-Durand. On sampling from a log-concave density using kinetic Langevin diffusions. Bernoulli, 26(3):1956 - 1988, 2020. doi: 10.3150/19-BEJ1178. URL https://doi.org/10.3150/19-BEJ1178.
[20] Alain Durmus and Eric Moulines. Nonasymptotic convergence analysis for the unadjusted Langevin algorithm. The Annals of Applied Probability, 27(3):1551-1587, 2017.
[21] Alain Durmus, Szymon Majewski, and Băjęj Míasojedow. Analysis of Langevin monte carlo via convex optimization. The Journal of Machine Learning Research, 20(1):2666-2711, 2019.
[22] Murat A Erdogdu, Lester Mackey, and Ohad Shamir. Global non-convex optimization with discretized diffusions. Advances in Neural Information Processing Systems, 31, 2018.
[23] J Hale. Asymptotic behavior of dissipative systems. In *African Mathematical Society*, 1988.
[24] Ye He, Krishnakumar Balasubramanian, and Murat A Erdogdu. On the ergodicity, bias and asymptotic normality of randomized midpoint sampling method. Advances in Neural Information Processing Systems, 33:7366-7376, 2020.
[25] Ya-Ping Hsieh, Ali Kavis, Paul Rolland, and Volkan Cevher. Mirrored Langevin dynamics. Advances in Neural Information Processing Systems, 31, 2018.
[26] Ya-Ping Hsieh, Panayotis Mertikopoulos, and Volkan Cevher. The limits of min-max optimization algorithms: Convergence to spurious non-critical sets. In International Conference on Machine Learning, pages 4337-4348. PMLR, 2021.
[27] Richard Jordan, David Kinderlehrer, and Felix Otto. The variational formulation of the fokkerplanck equation. SIAM journal on mathematical analysis, 29(1):1-17, 1998.
[28] Mohammad Reza Karimi, Ya-Ping Hsieh, Panayotis Mertikopoulos, and Andreas Krause. The dynamics of riemannian robbins-monro algorithms. arXiv preprint arXiv:2206.06795, 2022.
[29] Damien Lamberton and Gilles Pages. Recursive computation of the invariant distribution of a diffusion. Bernoulli, pages 367-405, 2002.
[30] Vincent Lemaire. Estimation recursive de la mesure invariante d'un processus de diffusion. PhD thesis, Université de Marne la Vallée, 2005.
[31] Ruilin Li, Molei Tao, Santosh S. Vempala, and Andre Wibisono. The mirror langevin algorithm converges with vanishing bias, 2021.
[32] Ruilin Li, Hongyuan Zha, and Molei Tao. Sqrt(d) dimension dependence of langevin monte carlo. In The International Conference on Learning Representations, 2022.
[33] Xuechen Li, Yi Wu, Lester Mackey, and Murat A Erdogdu. Stochastic runge-kutta accelerates Langevin monte carlo and beyond. Advances in neural information processing systems, 32, 2019.
[34] Xuechen Li, Denny Wu, Lester Mackey, and Murat A. Erdogdu. Stochastic Runge-Kutta Accelerates Langevin Monte Carlo and Beyond, February 2020.
[35] Yi-An Ma, Niladri S Chatterji, Xiang Cheng, Nicolas Flammarion, Peter L Bartlett, and Michael I Jordan. Is there an analog of nesterov acceleration for gradient-based mcmc? Bernoulli, 27(3):1942-1992, 2021.
[36] Mateusz B Majka, Aleksandar Mijatović, and Łukasz Szpruch. Nonasymptotic bounds for sampling algorithms without log-concavity. The Annals of Applied Probability, 30(4):1534-1581, 2020.
[37] Panayotis Mertikopoulos, Ya-Ping Hsieh, and Volkan Cevher. Learning in games from a stochastic approximation viewpoint. arXiv preprint arXiv:2206.03922, 2022.