{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T18:18:19Z","timestamp":1764267499917,"version":"3.46.0"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T00:00:00Z","timestamp":1720569600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T00:00:00Z","timestamp":1720569600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Japan Society for the Promotion of Science (JSPS) KAKENHI","award":["23K16939"],"award-info":[{"award-number":["23K16939"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1007\/s10994-024-06586-z","type":"journal-article","created":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T12:01:52Z","timestamp":1720612912000},"page":"6697-6724","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Moreau-Yoshida variational transport: a general framework for solving regularized distributional optimization problems"],"prefix":"10.1007","volume":"113","author":[{"given":"Dai Hai","family":"Nguyen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tetsuya","family":"Sakurai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,10]]},"reference":[{"key":"6586_CR1","unstructured":"Arjovsky, M., Chintala, S., & Bottou, L. (2017). Wasserstein generative adversarial networks. In International conference on machine learning, (pp. 214\u2013223). PMLR."},{"issue":"3","key":"6586_CR2","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0167-6377(02)00231-6","volume":"31","author":"Amir Beck","year":"2003","unstructured":"Beck, Amir, & Teboulle, Marc. (2003). Mirror descent and nonlinear projected subgradient methods for convex optimization. Operations Research Letters, 31(3), 167\u2013175.","journal-title":"Operations Research Letters"},{"key":"6586_CR3","unstructured":"Chen, X., Duan, Y., Houthooft, R., Schulman, J., Sutskever, I., & Abbeel, P. (2016). Infogan: Interpretable representation learning by information maximizing generative adversarial nets. In Proceedings of the 30th International Conference on Neural Information Processing Systems, NIPS\u201916 2180\u20132188, Red Hook, NY, USA, 2016. Curran Associates Inc. ISBN 9781510838819."},{"key":"6586_CR4","unstructured":"Cheng, X., Chatterji, N.S., Bartlett, P.L., & Jordan, M.I. (2018). Underdamped langevin mcmc: A non-asymptotic analysis. In Conference on learning theory, (pp. 300\u2013323). PMLR."},{"key":"6586_CR5","first-page":"1458","volume":"54","author":"B Dai","year":"2017","unstructured":"Dai, B., He, N., Pan, Y., Boots, B., & Song, L. (2017). Learning from conditional distributions via dual embeddings. Artificial Intelligence and Statistics, 54, 1458\u20131467.","journal-title":"Artificial Intelligence and Statistics"},{"issue":"2","key":"6586_CR6","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1016\/j.jmaa.2009.10.073","volume":"365","author":"D Denny","year":"2010","unstructured":"Denny, D. (2010). A unique solution to a nonlinear elliptic equation. Journal of Mathematical Analysis and Applications, 365(2), 467\u2013482.","journal-title":"Journal of Mathematical Analysis and Applications"},{"issue":"1","key":"6586_CR7","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1137\/16M1108340","volume":"11","author":"Alain Durmus","year":"2018","unstructured":"Durmus, Alain, Moulines, Eric, & Pereyra, Marcelo. (2018). Efficient Bayesian computation by proximal Markov chain monte Carlo: when Langevin meets Moreau. SIAM Journal on Imaging Sciences, 11(1), 473\u2013506.","journal-title":"SIAM Journal on Imaging Sciences"},{"key":"6586_CR8","unstructured":"Feng, Y., Wang, D., & Liu, Q. (2017). Learning to draw samples with amortized stein variational gradient descent. arXiv preprint arXiv:1707.06626."},{"issue":"11","key":"6586_CR9","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1145\/3422622","volume":"63","author":"Ian Goodfellow","year":"2020","unstructured":"Goodfellow, Ian, Pouget-Abadie, Jean, Mirza, Mehdi, Bing, Xu., Warde-Farley, David, Ozair, Sherjil, Courville, Aaron, & Bengio, Yoshua. (2020). Generative adversarial networks. Communications of the ACM, 63(11), 139\u2013144.","journal-title":"Communications of the ACM"},{"key":"6586_CR10","doi-asserted-by":"publisher","first-page":"292","DOI":"10.2307\/1967124","volume":"20","author":"TH Gronwall","year":"1919","unstructured":"Gronwall, T. H. (1919). Note on the derivatives with respect to a parameter of the solutions of a system of differential equations. Annals of Mathematics, 20, 292\u2013296.","journal-title":"Annals of Mathematics"},{"key":"6586_CR11","unstructured":"Kingma, D.P., & Ba, J. (2014). Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980."},{"key":"6586_CR12","unstructured":"Kingma, D.P., & Welling, M. (2014). Stochastic gradient vb and the variational auto-encoder. In Second international conference on learning representations, ICLR, (vol.\u00a019, p. 121)."},{"key":"6586_CR13","unstructured":"Liu, L., Zhang, Y., Yang, Z., Babanezhad, R., & Wang, Z. (2021). Infinite-dimensional optimization for zero-sum games via variational transport. In International conference on machine learning, (pp. 7033\u20137044). PMLR."},{"key":"6586_CR14","first-page":"197","volume":"1","author":"GI Marchuk","year":"1990","unstructured":"Marchuk, G. I. (1990). Splitting and alternating direction methods. Handbook of numerical analysis, 1, 197\u2013462.","journal-title":"Handbook of numerical analysis"},{"key":"6586_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10994-023-06350-9","volume":"112","author":"DH Nguyen","year":"2023","unstructured":"Nguyen, D. H., & Sakurai, T. (2023). Mirror variational transport: a particle-based algorithm for distributional optimization on constrained domains. Machine Learning, 112, 1\u201325.","journal-title":"Machine Learning"},{"key":"6586_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2023.109351","volume":"138","author":"DH Nguyen","year":"2023","unstructured":"Nguyen, D. H., & Tsuda, K. (2023). On a linear fused Gromov-Wasserstein distance for graph structured data. Pattern Recognition, 138, 109351.","journal-title":"Pattern Recognition"},{"key":"6586_CR17","doi-asserted-by":"publisher","first-page":"1585","DOI":"10.1007\/s10994-021-05991-y","volume":"110","author":"DH Nguyen","year":"2021","unstructured":"Nguyen, D. H., Nguyen, C. H., & Mamitsuka, H. (2021). Learning subtree pattern importance for Weisfeiler-Lehman based graph kernels. Machine Learning, 110, 1585\u20131607.","journal-title":"Machine Learning"},{"issue":"482","key":"6586_CR18","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1198\/016214508000000337","volume":"103","author":"Trevor Park","year":"2008","unstructured":"Park, Trevor, & Casella, George. (2008). The Bayesian Lasso. Journal of the American Statistical Association, 103(482), 681\u2013686.","journal-title":"Journal of the American Statistical Association"},{"key":"6586_CR19","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1007\/s11222-015-9567-4","volume":"26","author":"Marcelo Pereyra","year":"2016","unstructured":"Pereyra, Marcelo. (2016). Proximal Markov chain Monte Carlo algorithms. Statistics and Computing, 26, 745\u2013760.","journal-title":"Statistics and Computing"},{"key":"6586_CR20","doi-asserted-by":"publisher","first-page":"13876","DOI":"10.48550\/arXiv.1906.0208","volume-title":"Advances in Neural Information Processing Systems","author":"HP Maretic","year":"2019","unstructured":"Maretic, H.P., El\u00a0Gheche, M., Chierchia, G., & Frossard, P. (2019). Got: An optimal transport framework for graph comparison.  In H. Wallach, H. Larochelle, A. Beygelzimer, F. d\u2019Alch\u00e9-Buc, E. Fox, & R. Garnett (Eds.), Advances in Neural Information Processing Systems, 32, 13876\u201313887. Curran Associates, Inc., 2019. https:\/\/doi.org\/10.48550\/arXiv.1906.02085"},{"key":"6586_CR21","volume-title":"Variational analysis","author":"RT Rockafellar","year":"2009","unstructured":"Rockafellar, R. T., & Wets, R.J.-B. (2009). Variational analysis (Vol. 317). Springer."},{"issue":"1\u20134","key":"6586_CR22","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0167-2789(92)90242-F","volume":"60","author":"LI Rudin","year":"1992","unstructured":"Rudin, L. I., Osher, S., & Fatemi, E. (1992). Nonlinear total variation based noise removal algorithms. Physica D: Nonlinear Phenomena, 60(1\u20134), 259\u2013268.","journal-title":"Physica D: Nonlinear Phenomena"},{"issue":"58\u201363","key":"6586_CR23","first-page":"94","volume":"55","author":"Filippo Santambrogio","year":"2015","unstructured":"Santambrogio, Filippo. (2015). Optimal transport for applied mathematicians. Birk\u00e4user, 55(58\u201363), 94.","journal-title":"Birk\u00e4user"},{"issue":"1","key":"6586_CR24","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"Robert Tibshirani","year":"1996","unstructured":"Tibshirani, Robert. (1996). Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society Series B: Statistical Methodology, 58(1), 267\u2013288.","journal-title":"Journal of the Royal Statistical Society Series B: Statistical Methodology"},{"key":"6586_CR25","volume-title":"Topics in optimal transportation","author":"C Villani","year":"2021","unstructured":"Villani, C. (2021). Topics in optimal transportation (Vol. 58). American Mathematical Soc."},{"key":"6586_CR26","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., et al. (2009). Optimal transport: Old and new (Vol. 338). Springer."},{"issue":"16","key":"6586_CR27","doi-asserted-by":"publisher","first-page":"83","DOI":"10.3182\/20120711-3-BE-2027.00310","volume":"45","author":"Bo Wahlberg","year":"2012","unstructured":"Wahlberg, Bo., Boyd, Stephen, Annergren, Mariette, & Wang, Yang. (2012). An ADMM algorithm for a class of total variation regularized estimation problems. IFAC Proceedings Volumes, 45(16), 83\u201388.","journal-title":"IFAC Proceedings Volumes"},{"key":"6586_CR28","unstructured":"Wang, D., & Liu, Q. (2016). Learning to draw samples: With application to amortized mle for generative adversarial learning. arXiv preprint arXiv:1611.01722."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-024-06586-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-024-06586-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-024-06586-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T18:13:31Z","timestamp":1764267211000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-024-06586-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,10]]},"references-count":28,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["6586"],"URL":"https:\/\/doi.org\/10.1007\/s10994-024-06586-z","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"type":"print","value":"0885-6125"},{"type":"electronic","value":"1573-0565"}],"subject":[],"published":{"date-parts":[[2024,7,10]]},"assertion":[{"value":"5 December 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 May 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 June 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 July 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"Not applicable","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"Not applicable","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}