{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,20]],"date-time":"2025-07-20T03:56:05Z","timestamp":1752983765035,"version":"3.37.3"},"reference-count":57,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100004359","name":"Vetenskapsr\u00e5det","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":"KTH Digital Futures"},{"name":"NSF","award":["1901599","1942523"],"award-info":[{"award-number":["1901599","1942523"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Contr."],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1109\/tac.2022.3172268","type":"journal-article","created":{"date-parts":[[2022,5,3]],"date-time":"2022-05-03T19:57:53Z","timestamp":1651607873000},"page":"4483-4497","source":"Crossref","is-referenced-by-count":9,"title":["Inference With Aggregate Data in Probabilistic Graphical Models: An Optimal Transport Approach"],"prefix":"10.1109","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3889-8456","authenticated-orcid":false,"given":"Rahul","family":"Singh","sequence":"first","affiliation":[{"name":"School of Aerospace Engineering, Georgia Institute of Technology, Atlanta, GA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2484-0181","authenticated-orcid":false,"given":"Isabel","family":"Haasler","sequence":"additional","affiliation":[{"name":"Division of Optimization and Systems Theory, Department of Mathematics, KTH Royal Institute of Technology, Stockholm, Sweden"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6474-4522","authenticated-orcid":false,"given":"Qinsheng","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Aerospace Engineering, Georgia Institute of Technology, Atlanta, GA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5158-9255","authenticated-orcid":false,"given":"Johan","family":"Karlsson","sequence":"additional","affiliation":[{"name":"Division of Optimization and Systems Theory, Department of Mathematics, KTH Royal Institute of Technology, Stockholm, Sweden"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1459-6365","authenticated-orcid":false,"given":"Yongxin","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Aerospace Engineering, Georgia Institute of Technology, Atlanta, GA, USA"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1561\/2200000001"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1145\/504729.504754"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1109\/TSMC.1982.4308806"},{"volume-title":"Probabilistic Graphical Models: Principles and Techniques","year":"2009","author":"Koller","key":"ref4"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1002\/9781118033197"},{"volume-title":"Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference","year":"1988","author":"Pearl","key":"ref6"},{"key":"ref7","first-page":"689","article-title":"Generalized belief propagation","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Yedidia","year":"2001"},{"key":"ref8","first-page":"236","article-title":"Understanding belief propagation and its generalizations","volume":"8","author":"Yedidia","year":"2003","journal-title":"Exploring Artif. Intell. New Millennium"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1109\/18.910572"},{"issue":"2","key":"ref10","first-page":"71","article-title":"Some results about decomposable (or Markov-type) models for multidimensional contingency tables: Distribution of marginals and partitioning of tests","volume":"2","author":"Sundberg","year":"1975","journal-title":"Scand. J. Statist."},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.2307\/1913295"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.2307\/2531326"},{"key":"ref13","first-page":"1161","article-title":"Collective graphical models","volume-title":"Adv. Neural Inf. Process. Syst.","volume":"24","author":"Sheldon","year":"2011"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1109\/TKDE.2016.2522426"},{"key":"ref15","first-page":"1004","article-title":"Approximate inference in collective graphical models","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Sheldon","year":"2013"},{"key":"ref16","first-page":"853","article-title":"Message passing for collective graphical models","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Sun","year":"2015"},{"key":"ref17","first-page":"892","article-title":"Bethe projections for non-local inference","volume-title":"Proc. 31st Conf. Uncertainty Artif. Intell.","author":"Vilnis","year":"2015"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1002\/(SICI)1097-0312(199801)51:1<23::AID-CPA2>3.0.CO;2-H"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1051\/m2an\/2015020"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1137\/141000439"},{"year":"2016","author":"Nenna","article-title":"Numerical methods for multi-marginal optimal transportation","key":"ref21"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1007\/s00526-011-0421-z"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1090\/gsm\/058"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1214\/aoms\/1177703591"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1016\/0024-3795(89)90490-4"},{"key":"ref26","first-page":"2292","article-title":"Sinkhorn distances: Lightspeed computation of optimal transport","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Cuturi","year":"2013"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1016\/j.csda.2012.02.027"},{"key":"ref28","first-page":"1142","article-title":"Consistently estimating Markov chains with noisy aggregate data","volume-title":"Proc. Artif. Intell. Statist.","author":"Bernstein","year":"2016"},{"doi-asserted-by":"publisher","key":"ref29","DOI":"10.1109\/LCSYS.2018.2827001"},{"doi-asserted-by":"publisher","key":"ref30","DOI":"10.1109\/CDC40024.2019.9029787"},{"doi-asserted-by":"publisher","key":"ref31","DOI":"10.1109\/TAC.2015.2457784"},{"doi-asserted-by":"publisher","key":"ref32","DOI":"10.1109\/TAC.2020.3015410"},{"doi-asserted-by":"publisher","key":"ref33","DOI":"10.3934\/dcds.2014.34.1533"},{"doi-asserted-by":"publisher","key":"ref34","DOI":"10.1007\/s10957-015-0803-z"},{"doi-asserted-by":"publisher","key":"ref35","DOI":"10.1007\/978-3-030-26980-7_75"},{"doi-asserted-by":"publisher","key":"ref36","DOI":"10.1115\/1.3662552"},{"doi-asserted-by":"publisher","key":"ref37","DOI":"10.1109\/5.18626"},{"doi-asserted-by":"publisher","key":"ref38","DOI":"10.1109\/9.855552"},{"doi-asserted-by":"publisher","key":"ref39","DOI":"10.1109\/TAC.2013.2258825"},{"doi-asserted-by":"publisher","key":"ref40","DOI":"10.1109\/TAC.2011.2154430"},{"doi-asserted-by":"publisher","key":"ref41","DOI":"10.1109\/LCSYS.2020.3002731"},{"key":"ref42","first-page":"1367","article-title":"Computational optimal transport: Complexity by accelerated gradient descent is better than by Sinkhorns algorithm","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Dvurechensky","year":"2018"},{"year":"2021","author":"Lin","article-title":"On the efficiency of Sinkhorn and Greenkhorn and their acceleration for optimal transport","key":"ref43"},{"doi-asserted-by":"publisher","key":"ref44","DOI":"10.1109\/TIT.2005.850085"},{"key":"ref45","first-page":"2116","article-title":"Dual averaging method for regularized stochastic learning and online optimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Xiao","year":"2009"},{"doi-asserted-by":"publisher","key":"ref46","DOI":"10.1016\/j.sigpro.2020.107474"},{"doi-asserted-by":"publisher","key":"ref47","DOI":"10.1137\/16M1061382"},{"doi-asserted-by":"publisher","key":"ref48","DOI":"10.1214\/aoms\/1177731829"},{"doi-asserted-by":"publisher","key":"ref49","DOI":"10.1007\/BF00939948"},{"doi-asserted-by":"publisher","key":"ref50","DOI":"10.1137\/20M1320195"},{"issue":"1","key":"ref51","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1023\/A:1007469218079","article-title":"The hierarchical hidden Markov model: Analysis and applications","volume":"32","author":"Fine","year":"1998","journal-title":"Mach. Learn."},{"doi-asserted-by":"publisher","key":"ref52","DOI":"10.1137\/1.9781611970241"},{"key":"ref53","first-page":"953","article-title":"The unified propagation and scaling algorithm","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Teh","year":"2002"},{"doi-asserted-by":"publisher","key":"ref54","DOI":"10.1017\/CBO9780511804441"},{"doi-asserted-by":"publisher","key":"ref55","DOI":"10.1287\/moor.18.4.846"},{"volume-title":"Digital Image Processing","year":"2006","author":"Gonzalez","key":"ref56"},{"key":"ref57","first-page":"467","article-title":"Loopy belief propagation for approximate inference: An empirical study","volume-title":"Proc. 15th Conf. Uncertainty Artif. Intell.","author":"Murphy","year":"1999"}],"container-title":["IEEE Transactions on Automatic Control"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/9\/9870073\/9767564-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9\/9870073\/09767564.pdf?arnumber=9767564","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T22:12:00Z","timestamp":1705961520000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9767564\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9]]},"references-count":57,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tac.2022.3172268","relation":{},"ISSN":["0018-9286","1558-2523","2334-3303"],"issn-type":[{"type":"print","value":"0018-9286"},{"type":"electronic","value":"1558-2523"},{"type":"electronic","value":"2334-3303"}],"subject":[],"published":{"date-parts":[[2022,9]]}}}