Linear programming analysis of loopy belief propagation for weighted matching
نویسندگان
چکیده
Loopy belief propagation has been employed in a wide variety of applications with great empirical success, but it comes with few theoretical guarantees. In this paper we investigate the use of the max-product form of belief propagation for weighted matching problems on general graphs. We show that max-product converges to the correct answer if the linear programming (LP) relaxation of the weighted matching problem is tight and does not converge if the LP relaxation is loose. This provides an exact characterization of max-product performance and reveals connections to the widely used optimization technique of LP relaxation. In addition, we demonstrate that max-product is effective in solving practical weighted matching problems in a distributed fashion by applying it to the problem of self-organization in sensor networks.
منابع مشابه
Bottom-Up Approaches to Approximate Inference and Learning in Discrete Graphical Models
OF THE DISSERTATION Bottom-Up Approaches to Approximate Inference and Learning in Discrete Graphical Models By Andrew Edward Gelfand Doctor of Philosophy in Computer Science University of California, Irvine, 2014 Professors Rina Dechter, Alexander Ihler, Co-Chairs Probabilistic graphical models offer a convenient and compact way to describe complex and uncertain relationships in data. A graphic...
متن کاملLoopy annealing belief propagation for vertex cover and matching: convergence, LP relaxation, correctness and Bethe approximation
Abstract—For the minimum cardinality vertex cover and maximum cardinality matching problems, the max-product form of belief propagation (BP) is known to perform poorly on general graphs. In this paper, we present an iterative annealing BP algorithm which is shown to converge and to solve a Linear Programming relaxation of the vertex cover problem on general graphs. As a consequence, our anneali...
متن کاملStereo Matching With Color-Weighted Correlation, Hierarchical Belief Propagation And Occlusion Handling
In this paper, we contrive a stereo matching algorithm with careful handling of disparity, discontinuity and occlusion. This algorithm works a worldwide matching stereo model which is based on minimization of energy. The global energy comprises two terms, firstly the data term and secondly the smoothness term. The data term is approximated by a color-weighted correlation, then refined in obstru...
متن کاملLoopy Belief Propagation for Bipartite Maximum Weight b-Matching
We formulate the weighted b-matching objective function as a probability distribution function and prove that belief propagation (BP) on its graphical model converges to the optimum. Standard BP on our graphical model cannot be computed in polynomial time, but we introduce an algebraic method to circumvent the combinatorial message updates. Empirically, the resulting algorithm is on average fas...
متن کاملParameter Learning for Loopy Markov Random Fields with Structural Support Vector Machines
Discriminative learners for functions with structured outputs have been successfully applied to sequence prediction, parsing, sequence alignment, and other problems where exact inference is tractable. However, these learners face challenges when inference procedures must use approximations, e.g., for multi-label classification, clustering, image segmentation, or loopy graphical models. In this ...
متن کامل