Efficiently searching for frustrated cycles in MAP inference

Uncertainty in Artificial Intelligence - Proceedings of the 28th Conference, UAI 2012

Volumn , Issue , 2012, Pages 795-804

  Sontag, David ^a   Choe, Do Kook ^a   Li, Yitao ^a  

^a POLYTECHNIC UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CANDIDATE SETS; CONSISTENCY CONSTRAINTS; DUAL DECOMPOSITION; GRAPHICAL MODEL; INFERENCE PROBLEM; INTEGRALITY GAPS; LINEAR-TIME ALGORITHMS; SEARCH ALGORITHMS;

INFERENCE ENGINES; ITERATIVE METHODS; PROBLEM SOLVING; STEREO VISION;

CLUSTERING ALGORITHMS;

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

References (25)

1. F. Barahona. On cuts and matchings in planar graphs. Mathematical Programming, 60:53-68, 1993.
2. F. Barahona and A. R. Mahjoub. On the cut polytope. Mathematical Programming, 36:157-173, 1986.
3. D. Batra, S. Nowozin, and P. Kohli. Tighter relaxations for MAP-MRF inference: A local primal-dual gap based separation algorithm. Journal of Machine Learning Research-Proceedings Track, 15:146-154, 2011.
4. M. M. Deza and M. Laurent. Geometry of Cuts and Metrics, volume 15 of Algorithms and Combinatorics. Springer, 1997.
5. G. Elidan, I. Mcgraw, and D. Koller. Residual belief propagation: informed scheduling for asynchronous message passing. In UAI, 2006.
6. A. Globerson and T. Jaakkola. Fixing maxproduct: Convergent message passing algorithms for MAP LP-relaxations. In J. Platt, D. Koller, Y. Singer, and S. Roweis, editors, NIPS. MIT Press, Cambridge, MA, 2007.
7. T. Hazan and A. Shashua. Norm-product belief propagation: primal-dual message-passing for approximate inference. IEEE Trans. Inf. Theor., 56(12):6294-6316, Dec. 2010.
8. A. Jaimovich, G. Elidan, H. Margalit, and N. Friedman. Towards an integrated proteinprotein interaction network: A relational Markov network approach. Journal of Computational Biology, 13(2):145-164, 2006.
9. J. Johnson. Convex Relaxation Methods for Graphical Models: Lagrangian and Maximum Entropy Approaches. PhD thesis, EECS, MIT, 2008.
10. V. Jojic, S. Gould, and D. Koller. Fast and smooth: Accelerated dual decomposition for MAP inference. In Proceedings of International Conference on Machine Learning (ICML), 2010.
11. V. Kolmogorov. Convergent tree-reweighted message passing for energy minimization. IEEE Trans. Pattern Anal. Mach. Intell., 28(10):1568-1583, 2006.
12. N. Komodakis and N. Paragios. Beyond loose LP-relaxations: Optimizing MRFs by repairing cycles. In ECCV, pages 806-820, 2008.
13. N. Komodakis, N. Paragios, and G. Tziritas. MRF energy minimization and beyond via dual decomposition. Pattern Analysis and Machine Intelligence, IEEE Transactions on, 33(3):531-552, March 2011.
14. V. A. Kovalevsky and V. K. Koval. A diffusion algorithm for decreasing energy of max-sum labeling problem. Glushkov Institute of Cybernetics, Kiev, USSR. Unpublished, approx. 1975.
15. M. Laurent. A comparison of the Sherali-Adams, Lovasz-Schrijver, and Lasserre relaxations for 0-1 programming. Math. Oper. Res., 28(3):470-496, 2003.
16. O. Meshi and A. Globerson. An alternating direction method for dual MAP LP relaxation. In Proceedings of ECML PKDD, pages 470-483, Berlin, Heidelberg, 2011. Springer-Verlag.
17. B. Schieber and U. Vishkin. On finding lowest common ancestors: simplification and parallelization. SIAM J. Comput., 17(6):1253-1262, Dec. 1988.
18. D. Sontag, A. Globerson, and T. Jaakkola. Clusters and coarse partitions in LP relaxations. In NIPS 21, pages 1537-1544. MIT Press, 2009.
19. D. Sontag, A. Globerson, and T. Jaakkola. Introduction to dual decomposition for inference. In S. Sra, S. Nowozin, and S. J. Wright, editors, Optimization for Machine Learning. MIT Press, 2011.
20. D. Sontag and T. Jaakkola. New outer bounds on the marginal polytope. In NIPS 20, pages 1393-1400, Cambridge, MA, 2008. MIT Press.
21. D. Sontag, T. Meltzer, A. Globerson, Y. Weiss, and T. Jaakkola. Tightening LP relaxations for MAP using message-passing. In UAI, pages 503-510. AUAI Press, 2008.
22. M. Wainwright and M. I. Jordan. Graphical Models, Exponential Families, and Variational Inference. Now Publishers Inc., Hanover, MA, USA, 2008.
23. T. Werner. A linear programming approach to max-sum problem: A review. IEEE Trans. Pattern Anal. Mach. Intell., 29(7):1165-1179, 2007.
24. T. Werner. High-arity interactions, polyhedral relaxations, and cutting plane algorithm for soft constraint optimisation (MAP-MRF). In CVPR, 2008.
25. C. Yanover, T. Meltzer, and Y. Weiss. Linear programming relaxations and belief propagation-an empirical study. JMLR, 7:1887-1907, 2006.