{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T11:04:07Z","timestamp":1779879847751,"version":"3.53.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T00:00:00Z","timestamp":1775520000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T00:00:00Z","timestamp":1775520000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JP24K06861"],"award-info":[{"award-number":["JP24K06861"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Stat Comput"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1007\/s11222-026-10871-3","type":"journal-article","created":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T02:52:43Z","timestamp":1775530363000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A deep learning approach to multi-marginal optimal transport via Hilbert space embeddings of probability measures"],"prefix":"10.1007","volume":"36","author":[{"given":"Yumiharu","family":"Nakano","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Takafumi","family":"Saito","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,4,7]]},"reference":[{"key":"10871_CR1","first-page":"1","volume":"22","author":"B Charlier","year":"2021","unstructured":"Charlier, B., Feydy, J., Glaun\u00e8s, J.A., Collin, F.D., Durif, G.: Kernel operations on the GPU, with autodiff, without memory overflows. J. Mach. Learn. Res. 22, 1\u20136 (2021)","journal-title":"J. Mach. Learn. Res."},{"key":"10871_CR2","unstructured":"Cuturi, M., Meng-Papaxanthos, L., Tian, Y., Bunne, C., Davis, G., Teboul, O.: Optimal transport tools (ott): a jax toolbox for all things wasserstein. (2022) arXiv:2201.12324"},{"key":"10871_CR3","unstructured":"Feydy, J., S\u00e9journ\u00e9, T., Vialard, F.X., Amari, S., Trouve, A., Peyr\u00e9, G.: Interpolating between Optimal Transport and MMD using Sinkhorn Divergences. In: The 22nd International Conference on Artificial Intelligence and Statistics, pages 2681\u20132690, (2019)"},{"key":"10871_CR4","first-page":"23","volume":"51","author":"W Gangbo","year":"1998","unstructured":"Gangbo, W., \u015awi\u0229ch, A.: Optimal maps for the multidimensional Monge-Kantorovich problem. Commun. Pure Appl. Anal. 51, 23\u201345 (1998)","journal-title":"Commun. Pure Appl. Anal."},{"key":"10871_CR5","doi-asserted-by":"crossref","unstructured":"Gretton, A., Borgwardt, K., Rasch, M., Sch\u00f6lkopf, B., Smola, A. A kernel method for the two-sample-problem. Adv. Neural Inf. Process. Syst., 19, (2006)","DOI":"10.7551\/mitpress\/7503.003.0069"},{"key":"10871_CR6","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0893-6080(91)90009-T","volume":"4","author":"K Hornik","year":"1991","unstructured":"Hornik, K.: Approximation capabilities of multilayer feedforward networks. Neural Netw. 4, 251\u2013257 (1991)","journal-title":"Neural Netw."},{"key":"10871_CR7","unstructured":"Kidger, P., Lyons, T.: Universal approximation with deep narrow networks. In: Conference on learning theory, pages 2306\u20132327. PMLR, (2020)"},{"key":"10871_CR8","unstructured":"Nakano, Y.: A kernel-based method for Schr\u00f6dinger bridges. 2024, arXiv:2310.14522"},{"key":"10871_CR9","unstructured":"Pedregosa, F., Varoquaux, G., Gramfort, A., Michel, V., Thirion, B., Grisel, O., Blondel, M., Prettenhofer, P., Weiss, R., Dubourg, V., Vanderplas, J., Passos, A., Cournapeau, D., Brucher, M., Perrot, M., Duchesnay, E.: Scikit-learn: machine learning in python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011)"},{"key":"10871_CR10","doi-asserted-by":"crossref","unstructured":"Puccetti, G., R\u00fcschendorf, L., Vanduffel, S.: On the computation of Wasserstein barycenters. J. Multivar. Anal. 176, 104581 (2020)","DOI":"10.1016\/j.jmva.2019.104581"},{"key":"10871_CR11","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1006\/jmva.2001.2005","volume":"81","author":"L R\u00fcschendorf","year":"2002","unstructured":"R\u00fcschendorf, L., Uckelmann, L.: On the $$n$$-coupling problem. J. Multivar. Anal. 81, 242\u2013258 (2002)","journal-title":"J. Multivar. Anal."},{"key":"10871_CR12","doi-asserted-by":"crossref","unstructured":"Saito, T., Nakano, Y.: Solving Monge problem by Hilbert space embeddings of probability measures. In: Proceedings of the 14th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, pages 294\u2013300, (2025)","DOI":"10.5220\/0013167600003893"},{"key":"10871_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-20828-2","volume-title":"Optimal Transport for Applied Mathematicians","author":"F Santambrogio","year":"2015","unstructured":"Santambrogio, F.: Optimal Transport for Applied Mathematicians. Birkh\u00e4user\/Springer, Cham (2015)"},{"key":"10871_CR14","first-page":"1517","volume":"11","author":"BK Sriperumbudur","year":"2010","unstructured":"Sriperumbudur, B.K., Gretton, A., Fukumizu, K., Sch\u00f6lkopf, B., Lanckriet, G.R.G.: Hilbert space embeddings and metrics on probability measures. J. Mach. Learn. Res. 11, 1517\u20131561 (2010)","journal-title":"J. Mach. Learn. Res."},{"key":"10871_CR15","doi-asserted-by":"publisher","DOI":"10.1090\/gsm\/058","volume-title":"Topics in Optimal Transportation","author":"C Villani","year":"2003","unstructured":"Villani, C.: Topics in Optimal Transportation. American Mathematical Society, Providence (2003)"},{"key":"10871_CR16","volume-title":"Optimal Transport: Old and New","author":"C Villani","year":"2008","unstructured":"Villani, C.: Optimal Transport: Old and New. Springer, Berlin (2008)"},{"key":"10871_CR17","volume-title":"Scattered Data Approximation","author":"H Wendland","year":"2010","unstructured":"Wendland, H.: Scattered Data Approximation. Cambridge University Press, Cambridge (2010)"}],"container-title":["Statistics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-026-10871-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11222-026-10871-3","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-026-10871-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T10:22:36Z","timestamp":1779877356000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11222-026-10871-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,7]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["10871"],"URL":"https:\/\/doi.org\/10.1007\/s11222-026-10871-3","relation":{},"ISSN":["0960-3174","1573-1375"],"issn-type":[{"value":"0960-3174","type":"print"},{"value":"1573-1375","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4,7]]},"assertion":[{"value":"12 July 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 March 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 April 2026","order":3,"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 that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"All materials used in this study are publicly available or will be made available upon request.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Materials availability"}},{"value":"The code used in this study is available from the corresponding author upon reasonable request.","order":6,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}}],"article-number":"118"}}