Belief propagation and LP relaxation for weighted matching in general graphs

IEEE Transactions on Information Theory

Volumn 57, Issue 4, 2011, Pages 2203-2212

  Sanghavi, Sujay ^a   Malioutov, Dmitry ^b   Willsky, Alan ^c  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^b DRW Inc   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Belief propagation; combinatorial optimization; graphical models; Markov random fields; matching; message passing

Indexed keywords

B-MATCHING; BELIEF PROPAGATION; BIPARTITE GRAPHS; COVER PROBLEM; GENERAL GRAPH; GRAPHICAL MODEL; LINEAR PROGRAMMING RELAXATION; LOOPY BELIEF PROPAGATION; LP RELAXATION; MARKOV RANDOM FIELDS; MATCHING; MAX-PRODUCT; WEIGHTED MATCHING;

COMBINATORIAL OPTIMIZATION; LINEAR PROGRAMMING; MESSAGE PASSING; SENSOR NETWORKS; WIRELESS SENSOR NETWORKS;

GRAPHIC METHODS;

EID: 79952827502     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2011.2110170     Document Type: Article

References (17)

1. F. Kschischang, B. Frey, and H. Loeliger, "Factor graphs and the sumproduct algorithm," IEEE Trans. Inf. Theory, vol. 47, pp. 498-519, Feb. 2001.
2. J. Pearl, Probabilistic Inference in Intelligent Systems. Boston, MA: Morgan Kaufmann, 1988.
3. J. Yedidia, W. Freeman, and Y.Weiss, "Understanding belief propagation and its generalizations," Exploring AI in the New Millennium, pp. 239-269, 2003.
4. D. Malioutov, J. Johnson, and A.Willsky, "Walk-sums and belief propagation in Gaussian graphical models," J. Mach. Learn. Res., vol. 7, pp. 2031-2064, Oct. 2006. (Pubitemid 44497455)
5. Y.Weiss and W. Freeman, "On the optimality of solutions of the maxproduct belief-propagation algorithm in arbitrary graphs," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 736-744, Feb. 2001. (Pubitemid 32318100)
6. S. Sanghavi, "Equivalence of LP relaxation and max-product for weighted matching in general graphs," in Proc. Inf. Theory Workshop, Sep. 2007.
7. M. Bayati, C. Borgs, J. Chayes, and R. Zecchina, Belief Propagation for Weighted b-Matchings on Arbitrary Graphs and its Relation to Linear Programs With Integer Solutions [Online]. Available: http://arxiv.org/ abs/0807.3159
8. L. Tassiulas and A. Ephremides, "Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks," IEEE Trans. Autom. Control, vol. 37, no. 12, Dec. 1992.
9. B. Huang and T. Jebara, "Loopy belief propagation for bipartite maximum weight b-matching," in Proc. Artif. Intell. Statist. (AISTATS), Mar. 2007.
10. M. Bayati, D. Shah, and M. Sharma, "Maximum weight matching via max-product belief propagation," in Proc. Int. Symp. Inf. Theory (ISIT), Sep. 2005, pp. 1763-1767. (Pubitemid 44508347)
11. P. Vontobel and R. Koetter, "On the relationship between linear programming decoding and min-sum algorithm decoding," in Proc. ISITA 2004, Parma, Italy.
12. S. Tatikonda and M. Jordan, "Loopy belief propagation and Gibbs measures," in Proc. Loopy belief propagation and Gibbs measures, 2002, vol. 18, pp. 493-500.
13. S. Sanghavi, D. Shah, and A.Willsky, "Message passing for maximum weight independent set," in Proc. Neural Inf. Process. Syst. (NIPS), 2007.
14. M. J.Wainwright, T. S. Jaakkola, and A. S.Willsky, "MAP estimation via agreement on (hyper)trees: Message-passing and linear-programming approaches," IEEE Trans. Inf. Theory, vol. 51, pp. 3697-3717, Nov. 2005. (Pubitemid 41622574)
15. M. Wainwright and M. Jordan, "Graphical models, exponential families, and variational inference," Found. Trends in Mach. Learn., vol. 1, no. 1-2, pp. 1-305, Dec. 2008.
16. V. N. Kolmogorov and M. J. Wainwright, "On optimality of tree-reweighted max-product message-passing," in Proc. Uncert. Artif. Intell., Edinburgh, Scotland, Jul. 2005.
17. A. Schrijver, Combinatorial Optimization. Berlin-Heidelberg, Germany: Springer-Verlag, 2003.