[19] Ming Xu, Matias Quiroz, Robert Kohn, and Scott A. Sisson. Variance reduction properties of the reparameterization trick. In AISTATS, 2019.
[20] Justin Domke. Provable Gradient Variance Guarantees for Black-Box Variational Inference. In NeurIPS, 2019.
[21] Kyurae Kim, Kaiwen Wu, Jisu Oh, and Jacob R. Gardner. Practical and matching gradient variance bounds for black-box variational inference. In ICML, 2023.
[22] Zuheng Xu and Trevor Campbell. The computational asymptotics of gaussian variational inference and the laplace approximation. Stat Comput, (32), 2023.
[23] Marc Lambert, Sinho Chewi, Francis Bach, Silvère Bonnabel, and Philippe Rigollet. Variational inference via wasserstein gradient flows. In Advances in Neural Information Processing Systems, volume 35, pages 14434-14447. Curran Associates, Inc., 2022.
[24] Michael Ziyang Diao, Krishna Balasubramanian, Sinho Chewi, and Adil Salim. Forward-backward Gaussian variational inference via JKO in the bures-Wasserstein space. In Proceedings of the 40th International Conference on Machine Learning, volume 202, pages 7960-7991. PMLR, 23-29 Jul 2023.
[25] Gabriel Peyre and Marco Cuturi. Computational optimal transport. Foundations and Trends in Machine Learning, 11(5-6):355-607, 2019.
[26] Kyurae Kim, Jisu Oh, Kaiwen Wu, Yi-An Ma, and Jacob R. Gardner. On the convergence and scale parameterizations of black-box variational inference. In NeurIPS, 2023.
[27] Gregory F. Cooper. The computational complexity of probabilistic inference using bayesian belief networks. Artificial Intelligence, 42(2):393-405, 1990.
[28] Paul Dagum and Michael Luby. Approximating probabilistic inference in bayesian belief networks is np-hard. Artificial Intelligence, 60(1):141-153, 1993. ISSN 0004-3702.
[29] Ahmed Khaled and Peter Richtárik. Better theory for sgd in the nonconvex world. Transactions of Machine Learning Research, 2023.
[30] Geoffrey Roeder, Yuhuai Wu, and David K Duvenaud. Sticking the Landing: Simple, Lower-Variance Gradient Estimators for Variational Inference. In NeurIPS, 2017.
[31] Damek Davis and Dmitriy Drusvyatskiy. Stochastic model-based minimization of weakly convex functions. SIAM Journal on Optimization, 29(1):207-239, 2019. ISSN 1052-6234.
[32] Eric Moulines and Francis Bach. Non-asymptotic analysis of stochastic approximation algorithms for machine learning. In J. Shawe-Taylor, R. Zemel, P. Bartlett, F. Pereira, and K.Q. Weinberger, editors, Advances in Neural Information Processing Systems, volume 24. Curran Associates, Inc., 2011.
[33] Deanna Needell, Nathan Srebro, and Rachel Ward. Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm. Mathematical Programming, 155(1): 549-573, 2015. ISSN 1436-4646.
[34] Ahmed Khaled, Othmane Sebbouh, Nicolas Loizou, Robert M. Gower, and Peter Rictarik. Unified analysis of stochastic gradient methods for composite convex and smooth optimization, 2020.
[35] Guillaume Garrigos and Robert M. Gower. Handbook of convergence theorems for (stochastic) gradient methods, 2023.
[36] Eduard Gorbunov, Filip Hanzely, and Peter Richtarik. A unified theory of sgd: Variance reduction, sampling, quantization and coordinate descent. In Proceedings of the Twenty Third International Conference on Artificial Intelligence and Statistics, volume 108 of Proceedings of Machine Learning Research, pages 680-690. PMLR, 26-28 Aug 2020.
[37] Alexander Buchholz, Florian Wenzel, and Stephan Mandt. Quasi-Monte Carlo Variational Inference. In ICML, 2018.