{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,12]],"date-time":"2026-09-12T17:38:31Z","timestamp":1789234711541,"version":"build-2803163510"},"reference-count":71,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2022]]},"DOI":"10.1109\/tpami.2022.3196140","type":"journal-article","created":{"date-parts":[[2022,8,8]],"date-time":"2022-08-08T19:56:11Z","timestamp":1659988571000},"page":"1-18","source":"Crossref","is-referenced-by-count":1,"title":["Self-Guided Belief Propagation \u2013 a Homotopy Continuation Method"],"prefix":"10.1109","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3920-1419","authenticated-orcid":false,"given":"Christian","family":"Knoll","sequence":"first","affiliation":[{"name":"Signal Processing and Speech Communication Laboratory, Graz University of Technology, Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1915-7158","authenticated-orcid":false,"given":"Adrian","family":"Weller","sequence":"additional","affiliation":[{"name":"University of Cambridge, England"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6356-3367","authenticated-orcid":false,"given":"Franz","family":"Pernkopf","sequence":"additional","affiliation":[{"name":"Signal Processing and Speech Communication Laboratory, Graz University of Technology, Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2019.2935810"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719154"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0304-8853(91)90825-U"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557497"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20057"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/090767145"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s00220-019-03387-7"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(90)90060-D"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/0022-247X(67)90139-4"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1214\/09-AAP627"},{"key":"ref11","first-page":"165","article-title":"Residual belief propagation: Informed scheduling for asynchronous message passing","volume-title":"Proc. 22nd Conf. Uncertainty Artif. Intell.","author":"Elidan"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-006-7899-4"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.1984.4767596"},{"key":"ref14","first-page":"133","article-title":"Convergent propagation algorithms via oriented trees","volume-title":"Proc. 23rd Conf. Uncertainty Artif. Intell.","author":"Globerson"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10090"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2159037"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1063\/1.1705220"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1307\/mmj\/1028989917"},{"key":"ref19","first-page":"264","article-title":"Convergent message-passing algorithms for inference over general graphs with convex free energies","volume-title":"Proc. 24th Conf. Uncertainty Artif. Intell.","author":"Hazan"},{"key":"ref20","first-page":"905","article-title":"Loopy belief propagation: Convergence and effects of message errors","volume":"6","author":"Ihler","year":"2005","journal-title":"J. Mach. Learn. Res."},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/0222066"},{"issue":"1","key":"ref22","first-page":"7539","article-title":"Learning planar Ising models","volume":"17","author":"Johnson","year":"2016","journal-title":"The J. Mach. Learn. Res."},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1214\/088342304000000026"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2017.2749575"},{"key":"ref25","article-title":"On loopy belief propagation\u2013local stability analysis for non-vanishing fields","volume-title":"Proc. Conf. Uncertainty Artif. Intell.","author":"Knoll"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/abcaef"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-23525-7_18"},{"key":"ref28","article-title":"Fast convergence of belief propagation to global optima: Beyond correlation decay","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Koehler"},{"key":"ref29","volume-title":"Probabilistic Graphical Models: Principles and Techniques","author":"Koller","year":"2009"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/18.910572"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/11744047_21"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1988.tb01721.x"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2001.937655"},{"key":"ref34","article-title":"The role of normalization in the belief propagation algorithm","author":"Martin","year":"2011"},{"key":"ref35","first-page":"393","article-title":"Convergent message passing algorithms: A unifying view","volume-title":"Proc. Conf. Uncertainty Artif. Intell.","author":"Meltzer"},{"key":"ref36","first-page":"402","article-title":"Convexifying the Bethe free energy","volume-title":"Proc. Conf. Uncertainty Artif. Intell.","author":"Meshi"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198570837.001.0001"},{"key":"ref38","volume-title":"Spin Glass Theory and Beyond: An Introduction to the Replica Method and Its Appl.","volume":"9","author":"Mezard","year":"1987"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2005\/11\/P11012"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.909166"},{"key":"ref41","first-page":"467","article-title":"Loopy belief propagation for approximate inference: An empirical study","volume-title":"Proc. Conf. Uncertainty Artif. Intell.","author":"Murphy"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-396502-8.00018-8"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.97.012152"},{"key":"ref44","first-page":"738","article-title":"Learning unbelievable probabilities","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Pitkow"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02431-3"},{"key":"ref46","volume-title":"Principles of Mathematical Analysis","volume":"3","author":"Rudin","year":"1964"},{"key":"ref47","first-page":"546","article-title":"Beyond log-supermodularity: Lower bounds and the bethe partition function","volume-title":"Proc. 29th Conf. Uncertainty Artif. Intell.","author":"Ruozzi"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/aa6f1e"},{"key":"ref49","first-page":"1037","article-title":"Complexity of bethe approximation","volume-title":"Proc. 15th Int. Conf. Artif. Intell. Statist.","author":"Shin"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1142\/5763"},{"key":"ref51","first-page":"1393","article-title":"New outer bounds on the marginal polytope","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Sontag"},{"key":"ref52","first-page":"286","article-title":"Survey propagation beyond constraint satisfaction problems","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Srinivasa"},{"key":"ref53","article-title":"Loopy belief propagation: Benefits and pitfalls on Ising-like systems","volume-title":"Proc. Int. Symp. Nonlinear Theory Appl.","author":"Stoop"},{"key":"ref54","first-page":"376","article-title":"Improved dynamic schedules for belief propagation","volume-title":"Proc. 23rd Conf. Uncertainty Artif. Intell.","author":"Sutton"},{"key":"ref55","first-page":"493","article-title":"Loopy belief propagation and gibbs measures","volume-title":"Proc. 18th Conf. Uncertainty Artif. Intell.","author":"Tatikonda"},{"key":"ref56","first-page":"308","article-title":"Tree-reweighted belief propagation algorithms and approximate ML estimation by pseudo-moment matching","volume-title":"Proc. 9th Int. Workshop Artif. Intell. Statist.","author":"Wainwright"},{"key":"ref57","first-page":"2017","article-title":"Graph zeta function in the bethe free energy and loopy belief propagation","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Watanabe"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1162\/089976600300015880"},{"key":"ref59","first-page":"942","article-title":"Bethe and related pairwise entropy approximations","volume-title":"Proc. 31st Conf. Uncertainty Artif. Intell.","author":"Weller"},{"key":"ref60","first-page":"21","article-title":"Uprooting and rerooting graphical models","author":"Weller","year":"2016","journal-title":"Proc. Int. Conf. Mach. Learn."},{"key":"ref61","first-page":"618","article-title":"Bethe bounds and approximating the global optimum","volume-title":"Proc. 16th Int. Workshop Artif. Intell. Statist.","author":"Weller"},{"key":"ref62","first-page":"858","article-title":"Approximating the bethe partition function","volume-title":"Proc. Conf. Uncertainty Artif. Intell.","author":"Weller"},{"key":"ref63","first-page":"909","article-title":"Clamping variables and approximate inference","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Weller"},{"key":"ref64","first-page":"868","article-title":"Understanding the Bethe approximation: When and how can it go wrong?","volume-title":"Proc. 13th Conf. Uncertainty Artif. Intell.","author":"Weller"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(02)00361-2"},{"key":"ref66","first-page":"554","article-title":"Belief optimization for binary networks: A stable alternative to loopy belief propagation","volume-title":"Proc. 17th Conf. Uncertainty Artif. Intell.","author":"Welling"},{"key":"ref67","first-page":"1425","article-title":"Loop series and bethe variational bounds in attractive graphical models","volume-title":"Proc. 20th Int. Conf. Neural Inf. Process. Syst.","author":"Willsky"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.850085"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1162\/08997660360581958"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevB.81.224205"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1080\/00018732.2016.1211393"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/34\/4359286\/09852264.pdf?arnumber=9852264","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T12:12:39Z","timestamp":1706789559000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9852264\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":71,"URL":"https:\/\/doi.org\/10.1109\/tpami.2022.3196140","relation":{},"ISSN":["0162-8828","2160-9292","1939-3539"],"issn-type":[{"value":"0162-8828","type":"print"},{"value":"2160-9292","type":"electronic"},{"value":"1939-3539","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]}}}