Subproblem-tree calibration: A unified approach to max-product message passing

30th International Conference on Machine Learning, ICML 2013

Volumn , Issue PART 2, 2013, Pages 849-857

  Wang, Huayan ^a   Koller, Daphne ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; LEARNING SYSTEMS;

BLOCK COORDINATE DESCENTS; DUAL DECOMPOSITION; LARGE BLOCKS; MAP INFERENCES; MAX-PRODUCT; MESSAGE PASSING ALGORITHM; UNIFIED APPROACH;

INFERENCE ENGINES;

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

References (17)

1. Felzenszwalb, P. F. and McAuley, J. J. Fast inference with min-sum matrix product. PAMI, 33(12):2549-2554, 2011.
2. Globerson, Amir and Jaakkola, Tommi. Fixing max-product: Convergent message passing algorithms for MAP LP-relaxations. In NIPS, 2007.
3. Roller, D. and Friedman, N. Probabilistic Graphical Models: Principles and Techniques. MIT Press, 2009.
4. Kolmogorov, V. Convergent tree-reweighted message passing for energy minimization. PAMI, 28(10):-1568-1583, October 2006.
5. Komodakis, N. and Paragios, N. Beyond loose LP-relaxations: Optimizing MRFs by repairing cycles. In ECCV, pp. III: 806-820, 2008.
6. Komodakis, Nikos, Paragios, Nikos, and Tziritas, Georgios. MRF energy minimization and beyond via dual decomposition. PAMI, 33(3):531-552, 2011.
7. Meltzer, Talya, Globerson, Amir, and Weiss, Yair. Convergent message passing algorithms - a unifying view. In UAI, pp. 393-401, 2009.
8. Shimony. Finding MAPs for belief networks is NP-hard. AIJ: Artificial Intelligence, 68, 1994.
9. Sontag, David and Jaakkola, Tommi. Tree block coordinate descent for MAP in graphical models. AISTATS, 5:544-551, 2009.
10. Sontag, David, Meltzer, Talya, Globerson, Amir, Jaakkola, Tommi, and Weiss, Yair. Tightening LP relaxations for MAP using message passing. In UAI, pp. 503-510, 2008.
11. Sontag, David, Globerson, Amir, and Jaakkola, Tommi. Introduction to dual decomposition for inference. In Sra, Suvrit, Nowozin, Sebastian, and Wright, Stephen J. (eds.), Optimization for Machine Learning. MIT Press, 2011.
12. Szeliski, R. S., Zabih, R., Scharstein, D., Veksler, O., Kolmogorov, V., Agarwala, A., Tappen, M., and Rother, C. A comparative study of energy minimization methods for markov random fields with smoothness-based priors. IEEE Trans. Pattern Analysis and Machine Intelligence, 30(6):1068-1080, June 2008. (Pubitemid 351650109)
13. Tarlow, Daniel, Batra, Dhruv, Kohli, Pushineet, and Kolmogorov, Vladimir. Dynamic tree block coordinate ascent. In ICML, 2011.
14. Wainwright, Martin J. and Jordan, Michael I. Graphical models, exponential families, and variational inference. Foundations and Trends in Machine Learning, 1(1-2):1-305, 2008.
15. Weiss, Y. Correctness of local probability propagation in graphical models with loops. Neural Computation, 12:1-41, 2000.
16. Werner, T. A linear programming approach to max-sum problem: A review. PAMI, 29(7):1165-1179, July 2007. (Pubitemid 46825067)
17. Yanover, Chen, Meltzer, Talya, and Weiss, Yair. Linear programming relaxations and belief propagation - an empirical study. JMLR, 7:1887-1907, 2006.