Message passing for maximum weight independent set

IEEE Transactions on Information Theory

Volumn 55, Issue 11, 2009, Pages 4822-4834

  Sanghavi, Sujay ^a   Shah, Devavrat ^b   Willsky, Alan S ^b  

^a Purdue University   (United States)

^b USA   (United States)

Author keywords

Belief propagation; Combinatorial optimization; Distributed algorithms; Independent set; Iterative algorithms; Linear programming (LP); Optimization

Indexed keywords

BELIEF PROPAGATION; DIRECT ANALYSIS; DISTRIBUTED ALGORITHMS; EXTREME POINTS; FINITE DOMAINS; FIXED POINTS; GRADIENT DESCENT; INDEPENDENT SET; ITERATIVE ALGORITHM; ITERATIVE ALGORITHMS; LP RELAXATION; MAP ESTIMATION; MAX-PRODUCT; MAXIMUM A POSTERIORI ESTIMATION; MESSAGE PASSING ALGORITHM; OPTIMALITY; POINT ESTIMATE; POLYTOPES; SIMPLE MODIFICATIONS; WEIGHT INDEPENDENT SETS;

BINARY CODES; COMBINATORIAL OPTIMIZATION; DYNAMIC PROGRAMMING; ITERATIVE METHODS; LINEAR PROGRAMMING; LINEARIZATION; MESSAGE PASSING; PARALLEL ALGORITHMS; PROBABILITY DISTRIBUTIONS;

SET THEORY;

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

References (27)

1. M. Bayati, D. Shah, and M. Sharma, "Max-product for maximum weight matching: Convergence, correctness and LP duality," IEEE Trans. Inf. Theory, 2009, accepted for publication.
2. S. Sanghavi, D. Malioutov, and A.Willsky, "Linear programming analysis of Loopy Belief Propagation for weighted matching," in Advances in Neural Information Processing Systems. Cambridge, MA: MIT Press, 2007, pp. 1273-1280.
3. Z.-Q. Luo and P. Tseng, "On the linear convergence of descent methods for convex essentially smooth minimization," SIAM J. Control Optim. vol. 30, no. 2, pp. 408-425, 1992.
4. V. Kolmogorov, "Convergent tree-reweighted message passing for energy minimization," IEEE Trans. Pattern Anal. Mach. Intell., vol. 28, no. 10, pp. 1568-1583, Oct. 2006.
5. C. Moallemi and B. Van Roy, "Convergence of the min-sum message passing algorithm for quadratic optimization," 2006 [Online]. Available: arXiv:cS/0603058
6. L. Trevisan, "Inapproximability of combinatorial optimization problems," Electron. Colloq. Comput. Complex., Tech. Rep. TR04-065, 2004.
7. M. J. Wainwright, T. Jaakkola, and A. S. Willsky, "Tree consistency and bounds on the performance of the max-product algorithm and its generalizations," Statist. Comput., vol. 14, pp. 143-166, Apr. 2004.
8. M. Wainwright, T. Jaakkola, and A. Willsky, "MAP estimation via agreement on (hyper) trees: Message-passing and linear programming approaches," IEEE Trans. Inf. Theory, vol. 51, no. 11, pp. 3697-3717, Nov. 2005.
9. M. Wainwright and M. Jordan, "Graphical models, exponential families, and variational inference," Dept. Statist., Univ. California Berkeley, Berkeley, CA, Tech. Rep. 649, 2003.
10. M. Wainwright and M. Jordan, "Graphical models, exponential families, and variational inference," Found. Trends Mach. Learn., vol. 1, no. 1-2, pp. 1-305, 2008.
11. J. Yedidia, W. Freeman, and Y. Weiss, "Generalized belief propagation," Mitsubishi Elect. Res. Lab., Cambridge, MA, TR-2000-26, 2000.
12. Y. Weiss, C. Yanover, and T. Meltzer, "MAP estimation, linear programming and belief propagation with convex free energies," in Proc. Conf. Uncertainty Artif. Intell., 2007.
13. 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/0709.1190
14. P. O. Vontobel and R. Koetter, "On the relationship between linear programming decoding and min-sum algorithm decoding," in Proc. Int. Symp. Inf. Theory Appl., Parma, Italy, Oct. 10-13, 2004, pp. 991-996.
15. S. Sanghavi, D. Shah, and A. Willsky, "Message-passing for max-weight independent set," in Advances in Neural Information Processing Systems. Cambridge, MA: MIT Press, 2007, pp. 1281-1288.
16. A. Schrijver, Combinatorial Optimization. Polyhedra and Efficiency Berlin, Germany: Springer-Verlag, 2003.
17. D. Bertsekas, Non Linear Programming. Belmont, MA: Athena Scientific, 1995.
18. Grotschel, L. Lovasz, and Schrijver, "Polynomial algorithms for perfect graphs," Ann. Discrete Math., vol. 21, pp. 325-356, 1984.
19. K. Jung and D. Shah, "Low delay scheduling in wireless networks," in Proc. IEEE Int. Symp. Inf. Theory, 2007, pp. 1396-1400.
20. V. Kolmogorov and M.Wainwright, "On optimality of tree-reweighted max-product message-passing," in Proc. Conf. Uncertainty Artif. Intell., Edinburgh, Scotland, Jul. 2005.
21. Y. Weiss, C. Yanover, and T. Meltzer, "MAP estimation, linear programming and belief propagation with convex free energies," in Proc. Conf. Uncertainty Artif. Intell., 2007.
22. A. Globerson and T. Jaakkola, "Fixing max-product: Convergent message passing algorithms for MAP LP-relaxations," in Advances in Neural Information Processing Systems. Cambridge, MA: MIT Press, 2007, pp. 553-560.
23. Y.Weiss and W. 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. 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. Inf. Theory, Cambridge, MA, Aug. 1998, pp. 276-276.
25. J. Yedidia, W. Freeman, and Y. Weiss, "Constructing free-energy approximations and generalized belief propagation algorithms," IEEE Trans. Inf. Theory, vol. 51, no. 7, pp. 2282-2312, Jul. 2005.
26. S. Tatikonda and M. I. Jordan, "Loopy belief propagation and Gibbs measures," in Proc. Conf. Uncertainty Artif. Intell., 2002.
27. D. P. Bertsekas, "Auction algorithms for network flow problems: A tutorial introduction," Comput. Optim. Appl., vol. 1, pp. 7-66, 1992.