{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T21:23:35Z","timestamp":1768253015127,"version":"3.49.0"},"reference-count":70,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100004359","name":"Swedish Research Council","doi-asserted-by":"publisher","award":["2014-5870"],"award-info":[{"award-number":["2014-5870"]}],"id":[{"id":"10.13039\/501100004359","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Cooperation Grant"},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1901599"],"award-info":[{"award-number":["1901599"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1942523"],"award-info":[{"award-number":["1942523"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1109\/tit.2021.3077465","type":"journal-article","created":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T21:45:16Z","timestamp":1620164716000},"page":"4647-4668","source":"Crossref","is-referenced-by-count":32,"title":["Multi-Marginal Optimal Transport and Probabilistic Graphical Models"],"prefix":"10.1109","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2484-0181","authenticated-orcid":false,"given":"Isabel","family":"Haasler","sequence":"first","affiliation":[]},{"given":"Rahul","family":"Singh","sequence":"additional","affiliation":[]},{"given":"Qinsheng","family":"Zhang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5158-9255","authenticated-orcid":false,"given":"Johan","family":"Karlsson","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1459-6365","authenticated-orcid":false,"given":"Yongxin","family":"Chen","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref70","author":"cover","year":"2012","journal-title":"Elements of Information Theory"},{"key":"ref39","first-page":"1004","article-title":"Approximate inference in collective graphical models","author":"sheldon","year":"2013","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref38","first-page":"1161","article-title":"Collective graphical models","author":"sheldon","year":"2011","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref33","first-page":"236","article-title":"Understanding belief propagation and its generalizations","volume":"8","author":"yedidia","year":"2003","journal-title":"Exploring Artificial Intelligence in the New Millennium"},{"key":"ref32","first-page":"467","article-title":"Loopy belief propagation for approximate inference: An empirical study","author":"murphy","year":"1999","journal-title":"Proc 15th Conf Uncertainty Artif Intell"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.850085"},{"key":"ref30","first-page":"689","article-title":"Generalized belief propagation","author":"yedidia","year":"2001","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref37","first-page":"953","article-title":"The unified propagation and scaling algorithm","author":"teh","year":"2002","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2079014"},{"key":"ref35","author":"pearl","year":"1988","journal-title":"Probabilistic Reasoning in Intelligent Systems Networks of Plausible Inference"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/18.825794"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1137\/17M1162925"},{"key":"ref62","article-title":"Linear time Sinkhorn divergences using positive features","author":"scetbon","year":"2020","journal-title":"arXiv 2006 07057"},{"key":"ref61","first-page":"4427","article-title":"Massively scalable Sinkhorn distances via the Nystr&#x00F6;m method","author":"altschuler","year":"2019","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1007\/BF00939948"},{"key":"ref28","first-page":"4","article-title":"The graphical models toolkit: An open source software system for speech and time-series processing","volume":"4","author":"bilmes","year":"2002","journal-title":"Proc IEEE Int Conf Acoust Speech Signal Process"},{"key":"ref64","first-page":"1964","article-title":"Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration","volume":"30","author":"altschuler","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref27","first-page":"209","article-title":"A variational Baysian framework for graphical models","author":"attias","year":"2000","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref65","first-page":"3982","article-title":"On efficient optimal transport: An analysis of greedy and accelerated mirror descent algorithms","author":"lin","year":"2019","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref66","first-page":"2196","article-title":"Computational optimal transport: Complexity by accelerated gradient descent is better than by Sinkhorn&#x2019;s algorithm","author":"dvurechensky","year":"2018","journal-title":"Proc 35th Int Conf Mach Learn (ICML)"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1093\/bib\/bbk007"},{"key":"ref67","article-title":"Fixed-support Wasserstein barycenters: Computational hardness and fast algorithm","author":"lin","year":"2020","journal-title":"arXiv 2002 04783"},{"key":"ref68","first-page":"3530","article-title":"On the complexity of approximating Wasserstein barycenters","author":"kroshnin","year":"2019","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref69","first-page":"402","article-title":"Convexifying the Bethe free energy","author":"meshi","year":"2009","journal-title":"Proc 25th Conf Uncertainty Artif Intell"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1090\/gsm\/058"},{"key":"ref1","volume":"653","author":"evans","year":"1999","journal-title":"Differential Equations Methods for the Monge-Kantorovich Mass Transfer Problem"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/20M1310977"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/LCSYS.2018.2827001"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/18M1166249"},{"key":"ref24","article-title":"On the complexity of approximating multimarginal optimal transport","author":"lin","year":"2019","journal-title":"arXiv 1910 00152"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/141000439"},{"key":"ref26","author":"koller","year":"2009","journal-title":"Probabilistic Graphical Models Principles and Techniques"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1561\/2200000001"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007665907178"},{"key":"ref51","first-page":"416","article-title":"MAP estimation, linear programming and belief propagation with convex free energies","author":"weiss","year":"2007","journal-title":"Proc 23rd Conf Uncertainty Artif Intell"},{"key":"ref59","article-title":"Approximating the quadratic transportation metric in near-linear time","author":"altschuler","year":"2018","journal-title":"arXiv 1810 10046"},{"key":"ref58","article-title":"Polynomial-time algorithms for multimarginal optimal transport problems with decomposable structure","author":"altschuler","year":"2020","journal-title":"arXiv 2008 03006"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1287\/moor.18.4.846"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1137\/0328011"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1080\/02331930008844513"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-015-0892-3"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1137\/100805741"},{"key":"ref52","article-title":"Multi-marginal optimal transport with a tree-structured cost and the Schr&#x00F6;dinger bridge problem","author":"haasler","year":"2020","journal-title":"arXiv 2004 06909"},{"key":"ref10","first-page":"2292","article-title":"Sinkhorn distances: Lightspeed computation of optimal transport","author":"cuturi","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177731829"},{"key":"ref40","first-page":"853","article-title":"Message passing for collective graphical models","author":"sun","year":"2015","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0312(199801)51:1<23::AID-CPA2>3.0.CO;2-H"},{"key":"ref13","first-page":"517","article-title":"On a class of multidimensional optimal transportation problems","volume":"10","author":"carlier","year":"2003","journal-title":"J Convex Anal"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s00526-011-0421-z"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1051\/m2an\/2015020"},{"key":"ref16","article-title":"Numerical methods for multi-marginal optimal transportation","author":"nenna","year":"2016"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2020.107474"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s00211-018-0995-x"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.85.062502"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2013.2258353"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1023\/B:VISI.0000036836.66311.97"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2016.2602103"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-015-0803-z"},{"key":"ref8","article-title":"Modeling and control of collective dynamics: From Schr&#x00F6;dinger bridges to optimal mass transport","author":"chen","year":"2016"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.23943\/princeton\/9780691172767.001.0001"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729694"},{"key":"ref9","first-page":"214","article-title":"Wasserstein generative adversarial networks","author":"arjovsky","year":"2017","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(89)90490-4"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177703591"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1093\/actrade\/9780199572199.001.0001"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511984068"},{"key":"ref42","article-title":"Inference with aggregate data: An optimal transport approach","author":"singh","year":"2020","journal-title":"arXiv 2003 13933"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/CDC40024.2019.9029787"},{"key":"ref44","first-page":"227","article-title":"On the transfer of masses","volume":"37","author":"kantorovich","year":"1942","journal-title":"Dokl Akad Nauk SSSR"},{"key":"ref43","author":"monge","year":"1781","journal-title":"M&#x00E9;moire sur la th&#x00E9;orie des d&#x00E9;blais et des remblais"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/9457114\/9422971-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9457114\/09422971.pdf?arnumber=9422971","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:54:27Z","timestamp":1652194467000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9422971\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7]]},"references-count":70,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tit.2021.3077465","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7]]}}}