Worst-case bounds on the quality of max-product fixed-points

Advances in Neural Information Processing Systems 23: 24th Annual Conference on Neural Information Processing Systems 2010, NIPS 2010

Volumn , Issue , 2010, Pages

  Vinyals, Meritxell ^a   Cerquides, Jesús ^a   Farinelli, Alessandro ^b   Rodríguez Aguilar, Juan Antonio ^a  

^a CSIC   (Spain)

^b UNIVERSITY OF VERONA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BIPARTITE GRAPHS; DISJOINT CYCLE; FIELD PARAMETERS; FIELD STRUCTURES; FIXED POINTS; MARKOV RANDOM FIELDS; MAX-PRODUCT; MAX-PRODUCT ALGORITHMS;

MARKOV PROCESSES;

EID: 85162002481     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. Marshall F. Tappen andWilliam T. Freeman. Comparison of graph cuts with belief propagation for stereo, using identical mrf parameters. In In ICCV, pages 900-907, 2003.
2. Jon Feldman, Martin J. Wainwright, and David R. Karger. Using linear programming to decode binary linear codes. IEEE Transactions on Information Theory, 51(3):954-972, 2005.
3. Chen Yanover and Yair Weiss. Approximate inference and protein-folding. In Advances in Neural Information Processing Systems, pages 84-86. MIT Press, 2002.
4. Alessandro Farinelli, Alex Rogers, Adrian Petcu, and Nicholas R. Jennings. Decentralised coordination of low-power embedded devices using the max-sum algorithm. In AAMAS, pages 639-646, 2008.
5. Solomon Eyal Shimony. Finding MAPs for belief networks is NP-Hard. Artif. Intell., 68(2):399-410, 1994.
6. Judea Pearl. Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 1988.
7. Srinivas M. Aji and Robert J. McEliece. The generalized distributive law. IEEE Transactions on Information Theory, 46(2):325-343, 2000.
8. Srinivas Aji, Gavin Horn, Robert Mceliece, and Meina Xu. Iterative min-sum decoding of tail-biting codes. In In Proc. IEEE Information Theory Workshop, pages 68-69, 1998.
9. Brendan J. Frey, Ralf Koetter, G. David Forney Jr., Frank R. Kschischang, Robert J. McEliece, and Daniel A. Spielman. Introduction to the special issue on codes on graphs and iterative algorithms. IEEE Transactions on Information Theory, 47(2):493-497, 2001.
10. Brendan J. Frey, Ralf Koetter, and Nemanja Petrovic. Very loopy belief propagation for unwrapping phase images. In NIPS, pages 737-743, 2001.
11. Yair Weiss. Correctness of local probability propagation in graphical models with loops. Neural Computation, 12(1):1-41, 2000.
12. Mohsen Bayati, Christian Borgs, Jennifer T. Chayes, and Riccardo Zecchina. Belief-propagation for weighted b-matchings on arbitrary graphs and its relation to linear programs with integer solutions. CoRR, abs/0709.1190, 2007.
13. Sujay Sanghavi, Dmitry Malioutov, and Alan Willsky. Linear programming analysis of loopy belief propagation for weighted matching. In J.C. Platt, D. Koller, Y. Singer, and S. Roweis, editors, Advances in Neural Information Processing Systems 20, pages 1273-1280. MIT Press, Cambridge, MA, 2008.
14. Sujay Sanghavi, Devavrat Shah, and Alan S.Willsky. Message-passing for maximum weight independent set. CoRR, abs/0807.5091, 2008.
15. Bert Huang and Tony Jebara. Loopy belief propagation for bipartite maximum weight b-matching. In Marina Meila and Xiaotong Shen, editors, In Proceedings of the Eleventh International Conference on Artificial Intelligence and Statistics, March 2007.
16. Martin J. Wainwright, Tommi Jaakkola, and Alan S. Willsky. Tree consistency and bounds on the performance of the max-product algorithm and its generalizations. Statistics and Computing, 14(2):143-166, 2004.
17. YairWeiss andWilliam T. Freeman. On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs. IEEE Transactions on Information Theory, 47(2):736-744, 2001.
18. Jonathan P. Pearce and Milind Tambe. Quality guarantees on k-optimal solutions for distributed constraint optimization problems. In IJCAI, pages 1446-1451, 2007.
19. Christopher Kiekintveld, Zhengyu Yin, Atul Kumar, and Milind Tambe. Asynchronous algorithms for approximate distributed constraint optimization with quality bounds. In AAMAS, pages 133-140, 2010.
20. J. P. Pearce. Local Optimization in Cooperative Agent Networks. PhD thesis, University of Southern California, Los Angeles, CA, August 2007.