{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:01:03Z","timestamp":1740132063126,"version":"3.37.3"},"reference-count":57,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T00:00:00Z","timestamp":1535760000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T00:00:00Z","timestamp":1535760000000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T00:00:00Z","timestamp":1535760000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T00:00:00Z","timestamp":1535760000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"NSF","award":["DMS 11-15587"],"award-info":[{"award-number":["DMS 11-15587"]}]},{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund (FWF)","doi-asserted-by":"crossref","award":["P27803-N15"],"award-info":[{"award-number":["P27803-N15"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2018,9,1]]},"DOI":"10.1109\/tpami.2017.2749575","type":"journal-article","created":{"date-parts":[[2017,9,7]],"date-time":"2017-09-07T19:19:20Z","timestamp":1504811960000},"page":"2124-2136","source":"Crossref","is-referenced-by-count":10,"title":["Fixed Points of Belief Propagation\u2014An Analysis via Polynomial Homotopy Continuation"],"prefix":"10.1109","volume":"40","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3920-1419","authenticated-orcid":false,"given":"Christian","family":"Knoll","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dhagash","family":"Mehta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tianran","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6356-3367","authenticated-orcid":false,"given":"Franz","family":"Pernkopf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/0001-8708(82)90048-2"},{"key":"ref38","first-page":"1037","article-title":"Complexity of Bethe approximation.","author":"shin","year":"2012","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/11925231_19"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1561\/2200000001"},{"key":"ref31","first-page":"493","article-title":"Loopy belief propagation and Gibbs measures","author":"tatikonda","year":"2002","journal-title":"Proc Conf Uncertainty Artif Intell"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(02)00361-2"},{"key":"ref37","first-page":"554","article-title":"Belief optimization for binary networks: A stable alternative to loopy belief propagation","author":"welling","year":"2001","journal-title":"Proc Conf Uncertainty Artif Intell"},{"key":"ref36","first-page":"402","article-title":"Convexifying the Bethe free energy","author":"meshi","year":"2009","journal-title":"Proc Conf Uncertainty Artif Intell"},{"key":"ref35","first-page":"359","article-title":"Stable fixed points of loopy belief propagation are minima of the Bethe free energy","author":"heskes et","year":"2003","journal-title":"Proc 15th Int Conf Neural Inf Proc"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2005\/11\/P11012"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.850085"},{"key":"ref27","first-page":"905","article-title":"Loopy belief propagation: Convergence and effects of message errors","volume":"6","author":"ihler","year":"2005","journal-title":"J Mach Learning Res"},{"article-title":"A conversation about the Bethe free energy and sum-product","year":"2001","author":"mackay","key":"ref29"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33715-4_1"},{"journal-title":"Probabilistic Reasoning in Intelligent Systems Networks of Plausible Inference","year":"1988","author":"pearl","key":"ref1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1515\/9783110250329"},{"key":"ref22","article-title":"On loopy belief propagation–local stability analysis for non-vanishing fields","author":"knoll","year":"2017","journal-title":"Proc Conf Uncertainty Artif Intell"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198570837.001.0001"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1214\/088342304000000026"},{"journal-title":"Probabilistic Graphical Models Principles and Techniques","year":"2009","author":"koller","key":"ref23"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/18.910572"},{"key":"ref25","volume":"2","author":"gallager","year":"1968","journal-title":"Information Theory and Reliable Communication"},{"key":"ref50","first-page":"2169","article-title":"libdai: A free and open source C++ library for discrete approximate inference in graphical models","volume":"11","author":"mooij","year":"2010","journal-title":"J Mach Learning Res"},{"key":"ref51","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1111\/j.2517-6161.1988.tb01721.x","article-title":"Local computations with probabilities on graphical structures and their application to expert systems","volume":"50","author":"lauritzen","year":"1988","journal-title":"J Royal Stat Soc Series B"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2004.1267047"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/18.825794"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/49.661110"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511619199"},{"journal-title":"Information Theory Inference and Learning Algorithms","year":"2003","author":"mackay","key":"ref53"},{"journal-title":"Ordinary Differential Equations and Dynamical Systems","year":"2003","author":"teschl","key":"ref52"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1162\/08997660360581958"},{"key":"ref40","first-page":"172","article-title":"Upper and lower bounds for the degree of Gröbner bases","author":"m\u00f6ller","year":"1984","journal-title":"Proc Int Symp Symbolic Algebraic Comput"},{"key":"ref11","first-page":"165","article-title":"Residual belief propagation: Informed scheduling for asynchronous message passing","author":"elidan","year":"2006","journal-title":"Proc Conf Uncertainty Artif Intell"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-23525-7_18"},{"key":"ref13","first-page":"376","article-title":"Improved dynamic schedules for belief propagation","author":"sutton","year":"2007","journal-title":"Proc Conf Uncertainty Artif Intell"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20057"},{"key":"ref15","first-page":"286","article-title":"Survey propagation beyond constraint satisfaction problems","author":"srinivasa","year":"2016","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2181-2"},{"key":"ref17","volume":"185","author":"cox","year":"2005","journal-title":"Using Algebraic Geometry"},{"key":"ref18","first-page":"209","article-title":"Solving polynomial systems by the homotopy continuation method","volume":"11","author":"li","year":"2003","journal-title":"Handbook Numer Anal"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1142\/5763"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.909166"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-396502-8.00018-8"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1162\/089976600300015880"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1162\/0899766041941943"},{"key":"ref8","first-page":"858","article-title":"Approximating the Bethe partition function","author":"weller","year":"2014","journal-title":"Proc Conf Uncertainty Artif Intell"},{"article-title":"A network topology dependent upper bound on the number of equilibria of the Kuramoto model","year":"2016","author":"chen","key":"ref49"},{"key":"ref7","first-page":"183","article-title":"Accuracy bounds for belief propagation","author":"ihler","year":"2007","journal-title":"Proc Conf Uncertainty of Artificial Intelligence"},{"key":"ref9","first-page":"467","article-title":"Loopy belief propagation for approximate inference: An empirical study","author":"murphy","year":"1999","journal-title":"Proc Conf Uncertainty Artif Intell"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1017\/S0962492900002749"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44199-2_30"},{"key":"ref48","article-title":"On the network topology dependent solution count of the algebraic load flow equations","author":"chen","year":"2017","journal-title":"IEEE Trans Power Systems"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.4310\/CIS.2015.v15.n2.a1"},{"key":"ref42","first-page":"1","article-title":"The number of roots of a system of equations","volume":"9","author":"bernstein","year":"1975","journal-title":"Funkts Anal Prilozhen"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1995-1297471-4"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/BF01077562"},{"key":"ref43","first-page":"82","article-title":"Newton polytopes and the bezout theorem","volume":"10","author":"kushnirenko","year":"1976","journal-title":"Funkts Anal Prilozhen"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielaam\/34\/8424845\/8027142-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/34\/8424845\/08027142.pdf?arnumber=8027142","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,26]],"date-time":"2024-06-26T19:45:26Z","timestamp":1719431126000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8027142\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,1]]},"references-count":57,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tpami.2017.2749575","relation":{},"ISSN":["0162-8828","2160-9292","1939-3539"],"issn-type":[{"type":"print","value":"0162-8828"},{"type":"electronic","value":"2160-9292"},{"type":"electronic","value":"1939-3539"}],"subject":[],"published":{"date-parts":[[2018,9,1]]}}}