Message-Passing Algorithms for Quadratic Minimization

12/02/2012
by   Nicholas Ruozzi, et al.
0

Gaussian belief propagation (GaBP) is an iterative algorithm for computing the mean of a multivariate Gaussian distribution, or equivalently, the minimum of a multivariate positive definite quadratic function. Sufficient conditions, such as walk-summability, that guarantee the convergence and correctness of GaBP are known, but GaBP may fail to converge to the correct solution given an arbitrary positive definite quadratic function. As was observed in previous work, the GaBP algorithm fails to converge if the computation trees produced by the algorithm are not positive definite. In this work, we will show that the failure modes of the GaBP algorithm can be understood via graph covers, and we prove that a parameterized generalization of the min-sum algorithm can be used to ensure that the computation trees remain positive definite whenever the input matrix is positive definite. We demonstrate that the resulting algorithm is closely related to other iterative schemes for quadratic minimization such as the Gauss-Seidel and Jacobi algorithms. Finally, we observe, empirically, that there always exists a choice of parameters such that the above generalization of the GaBP algorithm converges.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/07/2016

Convergence Analysis of Distributed Inference with Vector-Valued Gaussian Belief Propagation

This paper considers inference over distributed linear Gaussian models u...
research
02/17/2010

Message-Passing Algorithms: Reparameterizations and Splittings

The max-product algorithm, a local message-passing scheme that attempts ...
research
03/01/2019

Trajectory convergence from coordinate-wise decrease of quadratic energy functions, and applications to platoons

We consider trajectories where the sign of the derivative of each entry ...
research
05/13/2020

A remark on approximating permanents of positive definite matrices

Let A be an n × n positive definite Hermitian matrix with all eigenvalue...
research
06/09/2019

A Low Rank Gaussian Process Prediction Model for Very Large Datasets

Spatial prediction requires expensive computation to invert the spatial ...
research
01/22/2017

Correct Convergence of Min-Sum Loopy Belief Propagation in a Block Interpolation Problem

This work proves a new result on the correct convergence of Min-Sum Loop...
research
05/26/2019

Partial minimization of strict convex functions and tensor scaling

Assume that f is a strict convex function with a unique minimum in R^n. ...

Please sign up or login with your details

Forgot password? Click here to reset