Message-passing algorithms for quadratic programming formulations of MAP estimation

Proceedings of the 27th Conference on Uncertainty in Artificial Intelligence, UAI 2011

Volumn , Issue , 2011, Pages 428-435

  Kumar, Akshat ^a   Zilberstein, Shlomo ^a  

^a University of Massachusetts Amherst   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; MARKOV PROCESSES; QUADRATIC PROGRAMMING;

CONCAVE-CONVEX PROCEDURE; EXPECTATION-MAXIMIZATION ALGORITHMS; GLOBALLY CONVERGENT ALGORITHMS; INFERENCE PROBLEM; MAXIMUM A POSTERIORI ESTIMATION; MESSAGE PASSING ALGORITHM; PAIR-WISE MARKOV RANDOM FIELDS; REAL-WORLD PROBLEM;

MESSAGE PASSING;

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

References (17)

1. Baxter, R. (1982). Exactly Solved Models in Statistical Mechanics. Academic Press, London.
2. Bertsekas, D. P. (1999). Nonlinear Programming. Athena Scientific, 2nd edition.
3. Boyd, S., Kim, S.-J., Vandenberghe, L., and Hassibi, A. (2007). A tutorial on geometric programming. Optimization and Engineering, 8:67-127. (Pubitemid 46844969)
4. Boyd, S. and Vandenberghe, L. (2004). Convex Optimization. Cambridge University Press, New York, NY, USA.
5. Globerson, A. and Jaakkola, T. (2007). Fixing MaxProduct: Convergent message passing algorithms for MAP LP-relaxations. In NIPS, pages 553-560.
6. Kolmogorov, V. (2006). Convergent tree-reweighted message passing for energy minimization. IEEE Trans. Pattern Anal. Mach. Intell., 28:1568-1583. (Pubitemid 46405078)
7. Kumar, A. and Zilberstein, S. (2010). MAP estimation for graphical models by likelihood maximization. In NIPS, pages 1180-1188.
8. Kumar, M. P., Kolmogorov, V., and Torr, H. S. P. (2009). An analysis of convex relaxations for map estimation of discrete mrfs. J. Mach. Learn. Res., 10:71-106.
9. Pearl, J. (1988). Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann Publishers Inc.
10. Ravikumar, P. and Lafferty, J. (2006). Quadratic programming relaxations for metric labeling and Markov random field MAP estimation. In ICML, pages 737-744.
11. Sontag, D., Globerson, A., and Jaakkola, T. (2010). Introduction to Dual Decomposition for Inference. Optimization for Machine Learning.
12. Sontag, D., Meltzer, T., Globerson, A., Jaakkola, T., and Weiss, Y. (2008). Tightening LP relaxations for MAP using message passing. In UAI, pages 503-510.
13. Sriperumbudur, B. and Lanckriet, G. (2009). On the convergence of the concave-convex procedure. In NIPS, pages 1759-1767.
14. Wainwright, M., Jaakkola, T., and Willsky, A. (2002). MAP estimation via agreement on (hyper)trees: Message-passing and linear programming approaches. IEEE Transactions on Information Theory, 51:3697-3717. (Pubitemid 41622574)
15. Wainwright, M. J. and Jordan, M. I. (2008). Graphical models, exponential families, and variational inference. Foundations and Trends in Machine Learning, 1:1-305.
16. Yanover, C., Meltzer, T., and Weiss, Y. (2006). Linear programming relaxations and belief propagation - an empirical study. J. Mach. Learn. Res., 7:2006.
17. Yuille, A. L. and Rangarajan, A. (2003). The concaveconvex procedure. Neural Comput., 15:915-936.