Loopy Belief Propagation for Bipartite Maximum Weight b-Matching

Abstract

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 faster than popular combinatorial implementations, while still scaling at the same asymptotic rate of O(bn). Furthermore, the algorithm shows promising performance in machine learning applications.

Extracted Key Phrases

7 Figures and Tables

Statistics

0102020072008200920102011201220132014201520162017
Citations per Year

92 Citations

Semantic Scholar estimates that this publication has 92 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Huang2007LoopyBP, title={Loopy Belief Propagation for Bipartite Maximum Weight b-Matching}, author={Bert Huang and Tony Jebara}, booktitle={AISTATS}, year={2007} }