Fixing Convergence of Gaussian Belief Propagation
Jason K. Johnson, Danny Bickson, Danny Dolev

TL;DR
This paper introduces a double-loop algorithm that ensures convergence of Gaussian belief propagation, enabling accurate inference and solutions in cases where standard GaBP fails, with applications in linear systems and detection problems.
Contribution
The paper presents a novel double-loop algorithm that guarantees convergence of GaBP and extends its application to solve over-constrained linear systems and improve linear detection.
Findings
Successfully forces convergence of GaBP in previously unstable cases
Enables accurate MAP estimation where standard GaBP fails
Improves concurrent transmission capacity in linear detection
Abstract
Gaussian belief propagation (GaBP) is an iterative message-passing algorithm for inference in Gaussian graphical models. It is known that when GaBP converges it converges to the correct MAP estimate of the Gaussian random vector and simple sufficient conditions for its convergence have been established. In this paper we develop a double-loop algorithm for forcing convergence of GaBP. Our method computes the correct MAP estimate even in cases where standard GaBP would not have converged. We further extend this construction to compute least-squares solutions of over-constrained linear systems. We believe that our construction has numerous applications, since the GaBP algorithm is linked to solution of linear systems of equations, which is a fundamental problem in computer science and engineering. As a case study, we discuss the linear detection problem. We show that using our new…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
