Separate but equal: equality in belief propagation for single-cycle graphs

DOI10.1016/J.ARTINT.2024.104243MaRDI QIDQ6665729zbMATH OpenFDO

Authors Erel Cohen, Ben Rachmut, Omer Lev, Roie Zivan

Publication date 17 January 2025

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.ARTINT.2024.104243

zbMATH Keywords

belief propagationdistributed constraintsdistributed problem solving

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Mathematical programming (90C99)

Recommendations

• On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs
• On the Uniqueness of Loopy Belief Propagation Fixed Points
• Convergence and correctness of belief propagation for the Chinese postman problem
• Belief propagation for unbalanced assignment problem
• Belief Propagation for Weighted b-Matchings on Arbitrary Graphs and its Relation to Linear Programs with Integer Solutions

Cites work

• AND/OR branch-and-bound search for combinatorial optimization in graphical models
• Bounded approximate decentralised coordination via the max-sum algorithm
• Governing convergence of Max-sum on DCOPs through damping and splitting
• scientific article; zbMATH DE number 1714658 (Why is no real title available?)
• Linear programming relaxations and belief propagation -- an empirical study
• Loopy belief propagation: convergence and effects of message errors
• Message-Passing Algorithms: Reparameterizations and Splittings
• On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs
• On the Uniqueness of Loopy Belief Propagation Fixed Points

This page was built for publication: Separate but equal: equality in belief propagation for single-cycle graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6665729)