Max-product for maximum weight matching: Convergence, correctness, and LP duality

IEEE Transactions on Information Theory

Volumn 54, Issue 3, 2008, Pages 1241-1251

  Bayati, Mohsen ^a   Shah, Devavrat ^b   Sharma, Mayank ^c  

^a MICROSOFT RESEARCH   (United States)

^b Department of Electrical Engineering and Computer Science   (United States)

^c IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Auction algorithm; Belief propagation (BP); Distributed optimization; Linear programming; Markov random fields; Max product algorithm; Maximum weight matching (MWM); Message passing algorithms; Min sum algorithm

Indexed keywords

COMBINATORIAL OPTIMIZATION; ITERATIVE DECODING; LINEAR PROGRAMMING; MARKOV PROCESSES; PARALLEL ALGORITHMS; PROBABILITY DISTRIBUTIONS;

AUCTION ALGORITHM; BELIEF PROPAGATION; MAXIMUM WEIGHT MATCHING; MIN-SUM ALGORITHM;

MESSAGE PASSING;

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

References (25)

1. S. M. Aji, G. B. Horn, and R. J. McEliece, "On the convergence of iterative decoding on graphs with a single cycle," in Proc. IEEE Int. Symp. Information Theory, Cambridge, MA, Aug. 1998, p. 276.
2. S. M. Aji and R. J. McEliece, "The generalized distributive law," IEEE Trans. Inf. Theory, vol. 46, no. 2, pp. 325-343, Mar. 2000.
3. M. Bayati, D. Shah, and M. Sharma, "Maximum weight matching via max-product belief propagation," in Proc. IEEE Int. Symp. Information Theory, Adelaide, Australia, Sep. 2005, pp. 1763-1767.
4. M. Bayati, D. Shah, and M. Sharma, "A simpler max-product maximum weight matching algorithm and the auction algorithm," in Proc. IEEE Int. Symp. Information Theory, Seattle, WA, Jul. 2006, pp. 557-561.
5. M. Bayati, B. Prabhakar, D. Shah, and M. Sharma, "Iterative scheduling algorithm," in Proc. IEEE Infocom, Anchorage, AK, May 2007, pp. 445-453.
6. D. P. Bertsekas, "Auction algorithms for network flow problems: A tutorial introduction," Comput. Optimiz. Applic., vol. 1, pp. 7-66, 1992.
7. D. Bertsekas and J. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods. Englewood Cliffs, NJ: Prentice-Hall, 1989.
8. R. G. Gallager, Low Density Parity Check Codes. Cambridge, MA: MIT Press, 1963.
9. J. Edmonds and R. Karp, "Theoretical improvements in algorithmic efficiency for network flow problems," J. ACM, vol. 19, pp. 248-264, 1972.
10. B. J. Frey and R. Koetter, "Exact inference using the attenuated max-product algorithm," in Advanced Mean Field Methods: Theory and Practice, M. Opper and D. Saad, Eds. Cambridge, MA: MIT Press, 2000.
11. G. B. Horn, "Iterative Decoding and Pseudocodewords," Ph.D. dissertation, Dep. Elec. Eng., California Insst. Technol., Pasadena, CA, 1999.
12. S. Lauritzen, Graphical models. Oxford, U.K.: Oxford Univ. Press, 1996.
13. E. Lawler, Combinatorial Optimization: Networks and Matroids. New York: Holt, Rinehart and Winston, 1976.
14. N. McKeown, V. Anantharam, and J. Walrand, "Achieving 100% throughput in an input-queued switch," in Proc. IEEE Inforcom, San Francisco, CA, Mar. 1996, vol. 1, pp. 296-302.
15. M. Mezard, G. Parisi, and R. Zecchina, "Analytic and algorithmic solution of random satisfiability problems," Science, vol. 297, p. 812, 2002.
16. J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. San Francisco, CA: Morgan Kaufmann, 1988.
17. T. Richardson and R. Urbanke, "The capacity of low-density parity check codes under message-passing decoding," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 599-618, Feb. 2001.
18. M. Wainwright and M. Jordan, Graphical Models, Exponential Families, and Variational Inference Dep. Statist., Univ. California, Berkeley, CA, 2003.
19. M. J. Wainwright, T. S. Jaakkola, and A. S. Willsky, "Tree consistency and bounds on the performance of the max-product algorithm and its generalizations," Statistics and Computing, vol. 14, pp. 143-166, Apr. 2004.
20. Y. Weiss, "Correctness of local probability propagation in graphical models with loops," Neural Comput., vol. 12, pp. 1-42, 2000.
21. Y. Weiss, Belief Propagation and Revision in Networks With Loops MIT AI Lab., 1997, Tech. Rep. 1616.
22. Y. Weiss and W. Freeman, "Correctness of belief propagation in Gaussian graphical models of arbitrary topology," Neural Comput., vol. 13, no. 10, pp. 2173-2200, 2001.
23. Y. Weiss and W. T. Freeman, "On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 736-744, Feb. 2001.
24. J. Yedidia, W. Freeman, and Y. Weiss, Understanding Belief Propagation and Its Generalizations Mitsubishi Elect. Res. Lab., 2000, TR-2001-22.
25. J. Yedidia, W. Freeman, and Y. Weiss, Generalized Belief Propagation Mitsubishi Elect. Res. Lab., 2000, TR-2000-26.