Belief propagation for min-cost network flow: Convergence and correctness

Operations Research

Volumn 60, Issue 2, 2012, Pages 410-428

  Gamarnik, David ^a   Shah, Devavrat ^b   Wei, Yehua ^c  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b Information and Decision Systems   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Belief propagation; Graphical model; Network flow

Indexed keywords

BELIEF PROPAGATION; GRAPHICAL MODEL; ITERATIVE ALGORITHM; MESSAGE PASSING ALGORITHM; NETWORK FLOWS; OPTIMAL SOLUTIONS; OPTIMIZATION PROBLEMS; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS; PROBLEM PARAMETERS; RANDOMIZED APPROXIMATION SCHEMES; RUNNING TIME; SIMPLE MODIFICATIONS; STATISTICAL INFERENCE; UNDERLYING NETWORKS;

ALGORITHMS; DATA STRUCTURES; OPTIMAL SYSTEMS; OPTIMIZATION; POLYNOMIAL APPROXIMATION; SIGNAL PROCESSING;

BACKPROPAGATION;

EID: 84861595751     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1110.1025     Document Type: Article

References (31)

1. Ahuja, R., A. Goldberg, J. Orlin, R. Tarjan. 1992. Finding minimum-cost flows by double scaling. Math. Programming 53 243-266.
2. Ahuja, R. K., T. L. Magnanti, J. B. Orlin. 1993. Network Flows. Prentice- Hall Inc, Englewood Cliffs, NJ.
3. Aji, S. M., R. J. McEliece. 2000. The generalized distributive law. IEEE Trans. Inform. Theory 46(2) 325-343.
4. Bayati, M., D. Shah, M. Sharma. 2008a. Max-product for maximum weight matching: Convergence, correctness, and lp duality. IEEE Trans. Inform. Theory 54(3) 1241-1251. (Pubitemid 351410929)
5. Bayati, M., C. Borgs, J. Chayes, R. Zecchina. 2008b. On the exactness of the cavity method for weighted b-matchings on arbitrary graphs and its relation to linear programs. J. Statist. Mech.: Theory and Experiment L06001.
6. Bertsekas, D. P. 1986. Distributed relaxation methods for linear network flow problems. Proc. 25th IEEE Conf. Decision and Control, Athens, Greece, 2101-2106.
7. Bertsimas, D., J. Tsitsiklis. 1997. Introduction to Linear Optimization, 3rd ed. Athena Scientific, Belmont, MA, 289-290.
8. Edmonds, J., R. M. Karp. 1972. Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM 19(2) 248-264.
9. Fujishige, S. 1986. A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm. Math. Programming 35(3) 298-308. (Pubitemid 16612076)
10. Gallager, R. 1963. Low density parity check codes. Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, MA.
11. Gamarnik, D., D. Shah, Y. Wei. 2010. Belief propagation for min-cost network flow: Convergence and correctness. Proc. 21st ACM-SIAM Sympos. Discrete Algorithms, SIAM, Philadelphia, 279-292.
12. Goldberg, A., R. Tarjan. 1987. Solving minimum-cost flow problems by successive approximation. STOC '87: Proc. Nineteenth Annual ACM Sympos. Theory of Comput., ACM, New York, 7-18. (Pubitemid 18643386)
13. Goldberg, A. V., R. E. Tarjan. 1989. Finding minimum-cost circulations by canceling negative. J. ACM 36(4) 873-886.
14. Horn, G. B. 1999. Iterative decoding and pseudocodewords. Ph.D. thesis, California Institute of Technology, Pasadena, CA.
15. Kanoria, Y., M. Bayati, C. Borgs, J. T. Chayes, A. Montanari. 2011. Fast convergence of natural bargaining dynamics in exchange networks. Proc. 22nd ACM-SIAM Sympos. Discrete Algorithms, SIAM, Philadelphia, 1518-1537.
16. Malioutov, D. M., J. K. Johnson, A. S. Willsky. 2006. Walk-sums and belief propagation in Gaussian graphical models. J. Machine Learning Res. 7 2031-2064. (Pubitemid 44497455)
17. Mezard, M., G. Parisi, R. Zecchina. 2002. Analytic and algorithmic solution of random satisfiability problems. Science 297 812.
18. Moallemi, C. C., B. Van Roy. 2007. Convergence of min-sum message passing for convex optimization. 45th Allerton Conf. Comm., Control, Comput., SIAM, Philadelphia.
19. Moallemi, C. C., B. Van Roy. 2009. Convergence of the min-sum message passing for quadratic optimization. IEEE Trans. Inform. Theory 55(5) 2413-2423.
20. Montanari, A., F. Ricci-Tersenghi, G. Semerjian. 2007. Solving constraint satisfaction problems through belief propagation-guided decimation. 45th Allerton Conf. Comm., Control, Comput., SIAM, Philadelphia.
21. Mulmuley, K., U. Vazirani, V. Vazirani. 1987. Matching is as easy as matrix inversion. Combinatorica 7(1) 105-113.
22. Orlin, J. B. 1993. A faster strongly polynomial minimum cost flow algorithm. Oper. Res. 41(2) 338-350.
23. Pearl, J. 1988. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, San Francisco.
24. Richardson, T., R. Urbanke. 2001. The capacity of low-density parity check codes under message-passing decoding. IEEE Trans. Inform. Theory 47(2) 599-618. (Pubitemid 32318092)
25. Röck, H. 1980. Scaling techniques for minimal cost flow problems. Discrete Structures Algorithms 181-191.
26. Ruozzi, N., S. Tatikonda. 2008. s-t paths using the min-sum algorithm. Forty-Sixth Annual Allerton Conf. Comm., Control, Comput., Urbana, IL, 918-921.
27. Sanghavi, S., D. Malioutov, A. Willsky. 2007. Linear programming analysis of loopy belief propagation for weighted matching. Proc. NIPS Conf., Vancouver, British Columbia, Canada.
28. Sanghavi, S., D. Shah, A. Willsky. 2009. Message-passing for maximum weight independent set. IEEE Trans. Inform. Theory 51(11) 4822-4834.
29. Schrijver, A. 2003. Combinatorial Optimization. Springer, Berlin. Tardos, E. 1985. A strongly polynomial minimum cost circulation algorithm. Combinatorica 5(3) 247-255.
30. Weiss, Y., W. Freeman. 2001. On the optimality of solutions of the maxproduct belief-propagation algorithm in arbitrary graphs. IEEE Trans. Inform. Theory 47(2) 736-744. (Pubitemid 32318100)
31. Yedidia, J., W. Freeman, Y. Weiss. 2002. Understanding belief propagation and its generalizations. Technical Report, TR-2001-22, Mitsubishi Electric Research Lab, Cambridge, MA.