{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T07:54:22Z","timestamp":1781164462090,"version":"3.54.1"},"reference-count":86,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,8,12]],"date-time":"2025-08-12T00:00:00Z","timestamp":1754956800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,12]],"date-time":"2025-08-12T00:00:00Z","timestamp":1754956800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Found Comput Math"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1007\/s10208-025-09721-x","type":"journal-article","created":{"date-parts":[[2025,8,12]],"date-time":"2025-08-12T15:26:58Z","timestamp":1755012418000},"page":"1859-1910","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Algorithms for Mean-Field Variational Inference Via Polyhedral Optimization in the Wasserstein Space"],"prefix":"10.1007","volume":"26","author":[{"given":"Yiheng","family":"Jiang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sinho","family":"Chewi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Aram-Alexandre","family":"Pooladian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,8,12]]},"reference":[{"key":"9721_CR1","unstructured":"Albergo, M.\u00a0S., Boffi, N.\u00a0M., Lindsey, M., and Vanden-Eijnden, E. (2024). Multimarginal generative modeling with stochastic interpolants. In The Twelfth International Conference on Learning Representations."},{"key":"9721_CR2","first-page":"22132","volume-title":"Advances in Neural Information Processing Systems","author":"JM Altschuler","year":"2021","unstructured":"Altschuler, J.\u00a0M., Chewi, S., Gerber, P.\u00a0R., and Stromme, A.\u00a0J. (2021). Averaging on the Bures\u2013Wasserstein manifold: dimension-free convergence of gradient descent. In Ranzato, M., Beygelzimer, A., Nguyen, K., Liang, P.\u00a0S., Vaughan, J.\u00a0W., and Dauphin, Y., editors, Advances in Neural Information Processing Systems, volume\u00a034, pages 22132\u201322145. Curran Associates, Inc."},{"key":"9721_CR3","unstructured":"Ambrosio, L., Gigli, N., and Savar\u00e9, G. (2005). Gradient flows: in metric spaces and in the space of probability measures. Springer Science & Business Media."},{"key":"9721_CR4","unstructured":"Arnese, M. and Lacker, D. (2024). Convergence of coordinate ascent variational inference for log-concave measures via optimal transport. arXiv preprint arXiv:2404.08792."},{"issue":"6","key":"9721_CR5","doi-asserted-by":"publisher","first-page":"4002","DOI":"10.1214\/19-AOP1352","volume":"47","author":"T Austin","year":"2019","unstructured":"Austin, T. (2019). The structure of low-complexity Gibbs measures on product spaces. Ann. Probab., 47(6):4002\u20134023.","journal-title":"Ann. Probab."},{"key":"9721_CR6","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1051\/ps\/2022015","volume":"26","author":"J Backhoff-Veraguas","year":"2022","unstructured":"Backhoff-Veraguas, J., Fontbona, J., Rios, G., and Tobar, F. (2022). Bayesian learning with Wasserstein barycenters. ESAIM Probab. Stat., 26:436\u2013472.","journal-title":"ESAIM Probab. Stat."},{"issue":"9","key":"9721_CR7","doi-asserted-by":"publisher","first-page":"3448","DOI":"10.1073\/pnas.1319779111","volume":"111","author":"S Basu","year":"2014","unstructured":"Basu, S., Kolouri, S., and Rohde, G.\u00a0K. (2014). Detecting and visualizing cell phenotype differences from microscopy images using transport-based morphometry. Proceedings of the National Academy of Sciences, 111(9):3448\u20133453.","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"9721_CR8","doi-asserted-by":"crossref","unstructured":"Beck, A. (2017). First-order methods in optimization. SIAM.","DOI":"10.1137\/1.9781611974997"},{"key":"9721_CR9","unstructured":"Bhattacharya, A., Pati, D., and Yang, Y. (2023). On the convergence of coordinate ascent variational inference. arXiv preprint arXiv:2306.01122."},{"issue":"1","key":"9721_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1214\/15-AIHP706","volume":"53","author":"J Bigot","year":"2017","unstructured":"Bigot, J., Gouet, R., Klein, T., and L\u00f3pez, A. (2017). Geodesic PCA in the Wasserstein space by convex PCA. Ann. Inst. Henri Poincar\u00e9 Probab. Stat., 53(1):1\u201326.","journal-title":"Ann. Inst. Henri Poincar\u00e9 Probab. Stat."},{"key":"9721_CR11","unstructured":"Bing, X., Bunea, F., and Niles-Weed, J. (2023). Estimation and inference for the Wasserstein distance between mixing measures in topic models. arXiv preprint arXiv:2206.12768."},{"issue":"518","key":"9721_CR12","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1080\/01621459.2017.1285773","volume":"112","author":"DM Blei","year":"2017","unstructured":"Blei, D.\u00a0M., Kucukelbir, A., and McAuliffe, J.\u00a0D. (2017). Variational inference: a review for statisticians. Journal of the American Statistical Association, 112(518):859\u2013877.","journal-title":"Journal of the American Statistical Association"},{"issue":"2","key":"9721_CR13","doi-asserted-by":"publisher","first-page":"740","DOI":"10.3150\/13-BEJ585","volume":"21","author":"E Boissard","year":"2015","unstructured":"Boissard, E., Le\u00a0Gouic, T., and Loubes, J.-M. (2015). Distribution\u2019s template estimate with Wasserstein metrics. Bernoulli, 21(2):740\u2013759.","journal-title":"Bernoulli"},{"issue":"4","key":"9721_CR14","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1145\/2897824.2925918","volume":"35","author":"N Bonneel","year":"2016","unstructured":"Bonneel, N., Peyr\u00e9, G., and Cuturi, M. (2016). Wasserstein barycentric coordinates: histogram regression using optimal transport. ACM Trans. Graph., 35(4):71\u20131.","journal-title":"ACM Trans. Graph."},{"issue":"4","key":"9721_CR15","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1016\/0022-1236(76)90004-5","volume":"22","author":"HJ Brascamp","year":"1976","unstructured":"Brascamp, H.\u00a0J. and Lieb, E.\u00a0H. (1976). On extensions of the Brunn\u2013Minkowski and Pr\u00e9kopa\u2013Leindler theorems, including inequalities for log concave functions, and with an application to the diffusion equation. J. Functional Analysis, 22(4):366\u2013389.","journal-title":"J. Functional Analysis"},{"issue":"4","key":"9721_CR16","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1002\/cpa.3160440402","volume":"44","author":"Y Brenier","year":"1991","unstructured":"Brenier, Y. (1991). Polar factorization and monotone rearrangement of vector-valued functions. Comm. Pure Appl. Math., 44(4):375\u2013417.","journal-title":"Comm. Pure Appl. Math."},{"issue":"3\u20134","key":"9721_CR17","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1561\/2200000050","volume":"8","author":"S Bubeck","year":"2015","unstructured":"Bubeck, S. (2015). Convex optimization: algorithms and complexity. Foundations and Trends in Machine Learning, 8(3-4):231\u2013357.","journal-title":"Foundations and Trends in Machine Learning"},{"issue":"3","key":"9721_CR18","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/s002200000257","volume":"214","author":"LA Caffarelli","year":"2000","unstructured":"Caffarelli, L.\u00a0A. (2000). Monotonicity properties of optimal transportation and the FKG and related inequalities. Communications in Mathematical Physics, 214(3):547\u2013563.","journal-title":"Communications in Mathematical Physics"},{"issue":"11","key":"9721_CR19","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevD.102.116019","volume":"102","author":"T Cai","year":"2020","unstructured":"Cai, T., Cheng, J., Craig, N., and Craig, K. (2020). Linearized optimal transport for collider events. Physical Review D, 102(11):116019.","journal-title":"Physical Review D"},{"issue":"2","key":"9721_CR20","doi-asserted-by":"publisher","first-page":"B429","DOI":"10.1137\/17M1143459","volume":"40","author":"E Cazelles","year":"2018","unstructured":"Cazelles, E., Seguy, V., Bigot, J., Cuturi, M., and Papadakis, N. (2018). Geodesic PCA versus log-PCA of histograms in the Wasserstein space. SIAM J. Sci. Comput., 40(2):B429\u2013B456.","journal-title":"SIAM J. Sci. Comput."},{"key":"9721_CR21","volume-title":"Advances in Neural Information Processing Systems","author":"RTQ Chen","year":"2018","unstructured":"Chen, R. T.\u00a0Q., Rubanova, Y., Bettencourt, J., and Duvenaud, D.\u00a0K. (2018). Neural ordinary differential equations. In Bengio, S., Wallach, H., Larochelle, H., Grauman, K., Cesa-Bianchi, N., and Garnett, R., editors, Advances in Neural Information Processing Systems, volume\u00a031. Curran Associates, Inc."},{"key":"9721_CR22","doi-asserted-by":"publisher","first-page":"6269","DOI":"10.1109\/ACCESS.2018.2889838","volume":"7","author":"Y Chen","year":"2019","unstructured":"Chen, Y., Georgiou, T.\u00a0T., and Tannenbaum, A. (2019). Optimal transport for Gaussian mixture models. IEEE Access, 7:6269\u20136278.","journal-title":"IEEE Access"},{"key":"9721_CR23","unstructured":"Chewi, S. (2024). Log-concave sampling. Book draft available at https:\/\/chewisinho.github.io."},{"key":"9721_CR24","unstructured":"Chewi, S., Clancy, J., Le\u00a0Gouic, T., Rigollet, P., Stepaniants, G., and Stromme, A.\u00a0J. (2021). Fast and smooth interpolation on Wasserstein space. In Banerjee, A. and Fukumizu, K., editors, Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, volume 130 of Proceedings of Machine Learning Research, pages 3061\u20133069. PMLR."},{"key":"9721_CR25","unstructured":"Chewi, S., Maunu, T., Rigollet, P., and Stromme, A. (2020). Gradient descent algorithms for Bures\u2013Wasserstein barycenters. In Abernethy, J. and Agarwal, S., editors, Proceedings of Thirty Third Conference on Learning Theory, volume 125 of Proceedings of Machine Learning Research, pages 1276\u20131304. PMLR."},{"key":"9721_CR26","first-page":"1471","volume":"361","author":"S Chewi","year":"2023","unstructured":"Chewi, S. and Pooladian, A.-A. (2023). An entropic generalization of Caffarelli\u2019s contraction theorem via covariance inequalities. Reports. Mathematical, 361:1471\u20131482.","journal-title":"Reports. Mathematical"},{"issue":"1","key":"9721_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10208-016-9331-y","volume":"18","author":"L Chizat","year":"2018","unstructured":"Chizat, L., Peyr\u00e9, G., Schmitzer, B., and Vialard, F.-X. (2018). An interpolating distance between optimal transport and Fisher\u2013Rao metrics. Found. Comput. Math., 18(1):1\u201344.","journal-title":"Found. Comput. Math."},{"issue":"2","key":"9721_CR28","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF02214649","volume":"9","author":"JA Cuesta-Albertos","year":"1996","unstructured":"Cuesta-Albertos, J.\u00a0A., Matr\u00e1n-Bea, C., and Tuero-Diaz, A. (1996). On lower bounds for the $$L^2$$-Wasserstein metric in a Hilbert space. J. Theoret. Probab., 9(2):263\u2013283.","journal-title":"J. Theoret. Probab."},{"key":"9721_CR29","unstructured":"Cuturi, M. (2013). Sinkhorn distances: lightspeed computation of optimal transport. Advances in Neural Information Processing Systems, 26."},{"key":"9721_CR30","unstructured":"Cuturi, M. and Doucet, A. (2014). Fast computation of Wasserstein barycenters. In International Conference on Machine Learning, pages 685\u2013693. PMLR."},{"key":"9721_CR31","unstructured":"Dalalyan, A.\u00a0S., Karagulyan, A., and Riou-Durand, L. (2022). Bounding the error of discretized Langevin algorithms for non-strongly log-concave targets. J. Mach. Learn. Res., 23:Paper No. 235, 38."},{"key":"9721_CR32","first-page":"29736","volume":"34","author":"N Deb","year":"2021","unstructured":"Deb, N., Ghosal, P., and Sen, B. (2021). Rates of estimation of optimal transport maps using plug-in estimators via barycentric projections. Advances in Neural Information Processing Systems, 34:29736\u201329753.","journal-title":"Advances in Neural Information Processing Systems"},{"issue":"2","key":"9721_CR33","doi-asserted-by":"publisher","first-page":"936","DOI":"10.1137\/19M1301047","volume":"13","author":"J Delon","year":"2020","unstructured":"Delon, J. and Desolneux, A. (2020). A Wasserstein-type distance in the space of Gaussian mixture models. SIAM J. Imaging Sci., 13(2):936\u2013970.","journal-title":"SIAM J. Imaging Sci."},{"key":"9721_CR34","unstructured":"Diao, M.\u00a0Z., Balasubramanian, K., Chewi, S., and Salim, A. (2023). Forward-backward Gaussian variational inference via JKO in the Bures\u2013Wasserstein space. In International Conference on Machine Learning, pages 7960\u20137991. PMLR."},{"key":"9721_CR35","unstructured":"Divol, V., Niles-Weed, J., and Pooladian, A.-A. (2022). Optimal transport map estimation in general function spaces. arXiv preprint arXiv:2212.03722."},{"key":"9721_CR36","unstructured":"Domke, J. (2020). Provable smoothness guarantees for black-box variational inference. In International Conference on Machine Learning, pages 2587\u20132596. PMLR."},{"key":"9721_CR37","first-page":"66289","volume-title":"Advances in Neural Information Processing Systems","author":"J Domke","year":"2023","unstructured":"Domke, J., Gower, R., and Garrigos, G. (2023). Provable convergence guarantees for black-box variational inference. In Oh, A., Neumann, T., Globerson, A., Saenko, K., Hardt, M., and Levine, S., editors, Advances in Neural Information Processing Systems, volume\u00a036, pages 66289\u201366327. Curran Associates, Inc."},{"issue":"6","key":"9721_CR38","doi-asserted-by":"publisher","first-page":"1548","DOI":"10.1007\/s00039-018-0461-z","volume":"28","author":"R Eldan","year":"2018","unstructured":"Eldan, R. (2018). Gaussian-width gradient complexity, reverse log-Sobolev inequalities and nonlinear large deviations. Geom. Funct. Anal., 28(6):1548\u20131596.","journal-title":"Geom. Funct. Anal."},{"key":"9721_CR39","doi-asserted-by":"crossref","unstructured":"Eldan, R. and Gross, R. (2018). Decomposition of mean-field Gibbs distributions into product measures. Electron. J. Probab., 23:Paper No. 35, 24.","DOI":"10.1214\/18-EJP159"},{"key":"9721_CR40","unstructured":"Finlay, C., Gerolin, A., Oberman, A.\u00a0M., and Pooladian, A.-A. (2020a). Learning normalizing flows from entropy-Kantorovich potentials. arXiv preprint arXiv:2006.06033."},{"key":"9721_CR41","unstructured":"Finlay, C., Jacobsen, J.-H., Nurbekyan, L., and Oberman, A. (2020b). How to train your neural ODE: the world of Jacobian and kinetic regularization. In International Conference on Machine Learning, pages 3154\u20133164. PMLR."},{"issue":"1\u20132","key":"9721_CR42","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1002\/nav.3800030109","volume":"3","author":"M Frank","year":"1956","unstructured":"Frank, M. and Wolfe, P. (1956). An algorithm for quadratic programming. Naval Research Logistics Quarterly, 3(1-2):95\u2013110.","journal-title":"Naval Research Logistics Quarterly"},{"key":"9721_CR43","unstructured":"Gunsilius, F., Hsieh, M.\u00a0H., and Lee, M.\u00a0J. (2022). Tangential Wasserstein projections. arXiv preprint arXiv:2207.14727."},{"key":"9721_CR44","unstructured":"Hiriart-Urruty, J.-B. and Lemar\u00e9chal, C. (2004). Fundamentals of convex analysis. Springer Science & Business Media."},{"key":"9721_CR45","unstructured":"Huang, C.-W., Chen, R. T.\u00a0Q., Tsirigotis, C., and Courville, A. (2021). Convex potential flows: universal probability distributions with optimal transport and convex optimization. In International Conference on Learning Representations."},{"issue":"2","key":"9721_CR46","doi-asserted-by":"publisher","first-page":"1166","DOI":"10.1214\/20-AOS1997","volume":"49","author":"J-C H\u00fctter","year":"2021","unstructured":"H\u00fctter, J.-C. and Rigollet, P. (2021). Minimax estimation of smooth optimal transport maps. Ann. Statist., 49(2):1166\u20131194.","journal-title":"Ann. Statist."},{"key":"9721_CR47","unstructured":"Jaggi, M. (2013). Revisiting Frank\u2013Wolfe: projection-free sparse convex optimization. In International Conference on Machine Learning, pages 427\u2013435. PMLR."},{"key":"9721_CR48","doi-asserted-by":"crossref","unstructured":"Jain, V., Risteski, A., and Koehler, F. (2019). Mean-field approximation, convex hierarchies, and the optimality of correlation rounding: a unified perspective. In STOC\u201919\u2014Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, pages 1226\u20131236. ACM, New York.","DOI":"10.1145\/3313276.3316299"},{"issue":"1","key":"9721_CR49","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0036141096303359","volume":"29","author":"R Jordan","year":"1998","unstructured":"Jordan, R., Kinderlehrer, D., and Otto, F. (1998). The variational formulation of the Fokker\u2013Planck equation. SIAM J. Math. Anal., 29(1):1\u201317.","journal-title":"SIAM J. Math. Anal."},{"key":"9721_CR50","unstructured":"Kent, C., Blanchet, J., and Glynn, P. (2021). Frank\u2013Wolfe methods in probability space. arXiv preprint arXiv:2105.05352."},{"issue":"1","key":"9721_CR51","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s43670-022-00038-2","volume":"21","author":"V Khurana","year":"2023","unstructured":"Khurana, V., Kannan, H., Cloninger, A., and Moosm\u00fcller, C. (2023). Supervised learning of sheared distributions using linearized optimal transport. Sampling Theory, Signal Processing, and Data Analysis, 21(1):1.","journal-title":"Sampling Theory, Signal Processing, and Data Analysis"},{"key":"9721_CR52","first-page":"44615","volume-title":"Advances in Neural Information Processing Systems","author":"K Kim","year":"2023","unstructured":"Kim, K., Oh, J., Wu, K., Ma, Y., and Gardner, J. (2023). On the convergence of black-box variational inference. In Oh, A., Neumann, T., Globerson, A., Saenko, K., Hardt, M., and Levine, S., editors, Advances in Neural Information Processing Systems, volume\u00a036, pages 44615\u201344657. Curran Associates, Inc."},{"key":"9721_CR53","doi-asserted-by":"crossref","unstructured":"Kolouri, S. and Rohde, G.\u00a0K. (2015). Transport-based single frame super resolution of very low resolution face images. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pages 4876\u20134884.","DOI":"10.1109\/CVPR.2015.7299121"},{"key":"9721_CR54","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1016\/j.patcog.2015.09.019","volume":"51","author":"S Kolouri","year":"2016","unstructured":"Kolouri, S., Tosun, A.\u00a0B., Ozolek, J.\u00a0A., and Rohde, G.\u00a0K. (2016). A continuous linear optimal transport approach for pattern analysis in image datasets. Pattern Recognition, 51:453\u2013462.","journal-title":"Pattern Recognition"},{"key":"9721_CR55","doi-asserted-by":"crossref","unstructured":"Kuhn, D., Esfahani, P.\u00a0M., Nguyen, V.\u00a0A., and Shafieezadeh-Abadeh, S. (2019). Wasserstein distributionally robust optimization: theory and applications in machine learning. In Operations Research & Management Science in the Age of Analytics, pages 130\u2013166. Informs.","DOI":"10.1287\/educ.2019.0198"},{"key":"9721_CR56","unstructured":"Lacker, D. (2023). Independent projections of diffusions: gradient flows for variational inference and optimal mean field approximations. arXiv preprint arXiv:2309.13332."},{"issue":"7","key":"9721_CR57","doi-asserted-by":"publisher","first-page":"6008","DOI":"10.1093\/imrn\/rnad302","volume":"2024","author":"D Lacker","year":"2024","unstructured":"Lacker, D., Mukherjee, S., and Yeung, L.\u00a0C. (2024). Mean field approximations via log-concavity. International Mathematics Research Notices, 2024(7):6008\u20136042.","journal-title":"International Mathematics Research Notices"},{"key":"9721_CR58","first-page":"14434","volume":"35","author":"M Lambert","year":"2022","unstructured":"Lambert, M., Chewi, S., Bach, F., Bonnabel, S., and Rigollet, P. (2022). Variational inference via Wasserstein gradient flows. Advances in Neural Information Processing Systems, 35:14434\u201314447.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"9721_CR59","doi-asserted-by":"crossref","unstructured":"Lavenant, H. and Zanella, G. (2024). Convergence rate of random scan coordinate ascent variational inference under log-concavity. arXiv preprint arXiv:2406.07292.","DOI":"10.1137\/24M1670627"},{"issue":"4","key":"9721_CR60","doi-asserted-by":"publisher","first-page":"2869","DOI":"10.1137\/15M1041420","volume":"48","author":"M Liero","year":"2016","unstructured":"Liero, M., Mielke, A., and Savar\u00e9, G. (2016). Optimal transport in competition with reaction: the Hellinger\u2013Kantorovich distance and geodesic curves. SIAM J. Math. Anal., 48(4):2869\u20132911.","journal-title":"SIAM J. Math. Anal."},{"issue":"3","key":"9721_CR61","doi-asserted-by":"publisher","first-page":"969","DOI":"10.1007\/s00222-017-0759-8","volume":"211","author":"M Liero","year":"2018","unstructured":"Liero, M., Mielke, A., and Savar\u00e9, G. (2018). Optimal entropy-transport problems and a new Hellinger\u2013Kantorovich distance between positive measures. Invent. Math., 211(3):969\u20131117.","journal-title":"Invent. Math."},{"key":"9721_CR62","unstructured":"Lu, Y., Lu, J., and Nolen, J. (2019). Accelerating Langevin sampling with birth-death. arXiv preprint arXiv:1905.09863."},{"key":"9721_CR63","unstructured":"Manole, T., Balakrishnan, S., Niles-Weed, J., and Wasserman, L. (2021). Plugin estimation of smooth optimal transport maps. arXiv preprint arXiv:2107.12364."},{"key":"9721_CR64","unstructured":"Nemirovski, A.\u00a0S. and Yudin, D.\u00a0B. (1983). Problem complexity and method efficiency in optimization. Wiley-Interscience Series in Discrete Mathematics. John Wiley & Sons, Inc., New York. Translated from the Russian and with a preface by E. R. Dawson."},{"key":"9721_CR65","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-91578-4","volume-title":"Lectures on convex optimization,","author":"Y Nesterov","year":"2018","unstructured":"Nesterov, Y. (2018). Lectures on convex optimization, volume 137. Springer."},{"issue":"3","key":"9721_CR66","first-page":"543","volume":"269","author":"YE Nesterov","year":"1983","unstructured":"Nesterov, Y.\u00a0E. (1983). A method for solving the convex programming problem with convergence rate $$O(1\/k^{2})$$. Dokl. Akad. Nauk SSSR, 269(3):543\u2013547.","journal-title":"Dokl. Akad. Nauk SSSR"},{"issue":"1\u20132","key":"9721_CR67","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1081\/PDE-100002243","volume":"26","author":"F Otto","year":"2001","unstructured":"Otto, F. (2001). The geometry of dissipative evolution equations: the porous medium equation. Comm. Partial Differential Equations, 26(1-2):101\u2013174.","journal-title":"Comm. Partial Differential Equations"},{"issue":"2","key":"9721_CR68","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1214\/15-AOS1387","volume":"44","author":"VM Panaretos","year":"2016","unstructured":"Panaretos, V.\u00a0M. and Zemel, Y. (2016). Amplitude and phase variation of point processes. Ann. Statist., 44(2):771\u2013812.","journal-title":"Ann. Statist."},{"key":"9721_CR69","doi-asserted-by":"crossref","unstructured":"Panaretos, V.\u00a0M. and Zemel, Y. (2020). An invitation to statistics in Wasserstein space. Springer Nature.","DOI":"10.1007\/978-3-030-38438-8"},{"key":"9721_CR70","doi-asserted-by":"crossref","unstructured":"Park, S. and Thorpe, M. (2018). Representing and learning high dimensional data with the optimal transport map from a probabilistic viewpoint. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pages 7864\u20137872.","DOI":"10.1109\/CVPR.2018.00820"},{"key":"9721_CR71","doi-asserted-by":"crossref","unstructured":"Peyr\u00e9, G. and Cuturi, M. (2019). Computational optimal transport. Foundations and Trends\u00ae in Machine Learning, 11(5-6):355\u2013607.","DOI":"10.1561\/2200000073"},{"key":"9721_CR72","unstructured":"Pooladian, A.-A. and Niles-Weed, J. (2021). Entropic estimation of optimal transport maps. arXiv preprint arXiv:2109.12004."},{"key":"9721_CR73","unstructured":"Rockafellar, R.\u00a0T. (1997). Convex analysis. Princeton Landmarks in Mathematics. Princeton University Press, Princeton, NJ. Reprint of the 1970 original, Princeton Paperbacks."},{"issue":"58\u201363","key":"9721_CR74","first-page":"94","volume":"55","author":"F Santambrogio","year":"2015","unstructured":"Santambrogio, F. (2015). Optimal transport for applied mathematicians. Birk\u00e4user, NY, 55(58-63):94.","journal-title":"Birk\u00e4user, NY"},{"key":"9721_CR75","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-71050-9","volume-title":"Optimal transport: old and new,","author":"C Villani","year":"2009","unstructured":"Villani, C. (2009). Optimal transport: old and new, volume 338. Springer."},{"key":"9721_CR76","unstructured":"Villani, C. (2021). Topics in optimal transportation, volume\u00a058. American Mathematical Soc."},{"key":"9721_CR77","doi-asserted-by":"crossref","unstructured":"Wainwright, M.\u00a0J. and Jordan, M.\u00a0I. (2008). Graphical models, exponential families, and variational inference. Foundations and Trends\u00ae in Machine Learning, 1(1\u20132):1\u2013305.","DOI":"10.1561\/2200000001"},{"key":"9721_CR78","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/s11263-012-0566-z","volume":"101","author":"W Wang","year":"2013","unstructured":"Wang, W., Slep\u010dev, D., Basu, S., Ozolek, J.\u00a0A., and Rohde, G.\u00a0K. (2013). A linear optimal transportation framework for quantifying and visualizing variations in sets of images. International Journal of Computer Vision, 101:254\u2013269.","journal-title":"International Journal of Computer Vision"},{"key":"9721_CR79","unstructured":"Werenski, M., Jiang, R., Tasissa, A., Aeron, S., and Murphy, J.\u00a0M. (2022). Measure estimation in the barycentric coding model. In International Conference on Machine Learning, pages 23781\u201323803. PMLR."},{"key":"9721_CR80","unstructured":"Wibisono, A. (2018). Sampling as optimization in the space of measures: the Langevin dynamics as a composite optimization problem. In Proceedings of the 31st Conference on Learning Theory, volume\u00a075 of Proceedings of Machine Learning Research, pages 2093\u20133027. PMLR."},{"key":"9721_CR81","unstructured":"Yao, R. and Yang, Y. (2022). Mean field variational inference via Wasserstein gradient flow. arXiv preprint arXiv:2207.08074."},{"key":"9721_CR82","unstructured":"Yi, M. and Liu, S. (2023). Bridging the gap between variational inference and Wasserstein gradient flows. arXiv preprint arXiv:2310.20090."},{"issue":"1\u20132","key":"9721_CR83","doi-asserted-by":"publisher","first-page":"1107","DOI":"10.1007\/s10107-021-01673-8","volume":"195","author":"M-C Yue","year":"2022","unstructured":"Yue, M.-C., Kuhn, D., and Wiesemann, W. (2022). On linear optimization over Wasserstein balls. Mathematical Programming, 195(1-2):1107\u20131122.","journal-title":"Mathematical Programming"},{"issue":"2","key":"9721_CR84","doi-asserted-by":"publisher","first-page":"932","DOI":"10.3150\/17-BEJ1009","volume":"25","author":"Y Zemel","year":"2019","unstructured":"Zemel, Y. and Panaretos, V.\u00a0M. (2019). Fr\u00e9chet means and Procrustes analysis in Wasserstein space. Bernoulli, 25(2):932\u2013976.","journal-title":"Bernoulli"},{"issue":"5","key":"9721_CR85","doi-asserted-by":"publisher","first-page":"2575","DOI":"10.1214\/19-AOS1898","volume":"48","author":"AY Zhang","year":"2020","unstructured":"Zhang, A.\u00a0Y. and Zhou, H.\u00a0H. (2020). Theoretical and computational guarantees of mean field variational inference for community detection. The Annals of Statistics, 48(5):2575\u20132598.","journal-title":"The Annals of Statistics"},{"issue":"4","key":"9721_CR86","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1145\/279232.279236","volume":"23","author":"C Zhu","year":"1997","unstructured":"Zhu, C., Byrd, R.\u00a0H., Lu, P., and Nocedal, J. (1997). Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound-constrained optimization. ACM Transactions on Mathematical Software (TOMS), 23(4):550\u2013560.","journal-title":"ACM Transactions on Mathematical Software (TOMS)"}],"container-title":["Foundations of Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-025-09721-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10208-025-09721-x","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-025-09721-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T17:02:14Z","timestamp":1780333334000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10208-025-09721-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,12]]},"references-count":86,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["9721"],"URL":"https:\/\/doi.org\/10.1007\/s10208-025-09721-x","relation":{},"ISSN":["1615-3375","1615-3383"],"issn-type":[{"value":"1615-3375","type":"print"},{"value":"1615-3383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,12]]},"assertion":[{"value":"24 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 May 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 May 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 August 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}