MAP estimation, linear programming and belief propagation with convex free energies

Proceedings of the 23rd Conference on Uncertainty in Artificial Intelligence, UAI 2007

Volumn , Issue , 2007, Pages 416-425

  Weiss, Yair ^a   Chen, Yanover ^a   Meltzer, Talya ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ARBITRARY GRAPHS; BELIEF PROPAGATION; BP ALGORITHM; EXACT INFERENCE; FIXED POINTS; GRAPHICAL MODEL; LINEAR PROGRAMS; MAP ESTIMATION; MAX-PRODUCT; NP-HARD; SINGLE CYCLE; SUM PRODUCT;

APPROXIMATION ALGORITHMS; ARTIFICIAL INTELLIGENCE; FREE ENERGY; GRAPHIC METHODS; LINEAR PROGRAMMING; PLANT EXTRACTS; SPEECH RECOGNITION; TREES (MATHEMATICS);

BACKPROPAGATION;

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

References (29)

1. D. Bertismas and J. Ttsitskikilis. Introduction to linear optimization. Athena Scientific, 1997.
2. A. Canutescu, A. Shelenkov, and R.L. Dunbrack. A graph-theory algorithm for rapid protein side-chain prediction. Protein Sci, 12(9):2001-2014, 2003. (Pubitemid 37022822)
3. J. Feldman, D. Karger, and M. J. Wainwright. LP decoding. In Allerton Conference on Communication, Control, and Computing, 2003.
4. G.D. Forney, F.R. Kschischang, and B. Marcus. Iterative decoding of tail-biting trellisses. preprint presented at 1998 Information Theory Workshop in San Diego, 1998.
5. A. S. Fraenkel. Protein folding, spin glass and computational complexity. In Proceedings of the 3rd DiMACS Workshop on DNA Based Computers, held at the University of Pennsylvania, June 23 - 25, 1997, pages 175-191, 1997.
6. T. Heskes. On the uniqueness of loopy belief propagation fixed points. Neural Computation, 16:2379-2413, 2004. (Pubitemid 39392556)
7. T. Heskes. Convexity arguments for efficient minimization of the Bethe and Kikuchi free energies. Journal of AI Research, 26:153-190, 2006. (Pubitemid 44452210)
8. S. Ikeda, T. Tanaka, and S. Amari. Stochastic reasoning, free energy, and information geometry. Neural Comput., 16(9):1779-1810, 2004. (Pubitemid 38932656)
9. C. L. Kingsford, B. Chazelle, and M. Singh. Solving and analyzing side-chain positioning problems using linear and integer programming. Bioinformatics, 21(7):1028-1039, 2005.
10. V. Kolmogorov. Convergent tree-reweighted message passing for energy minimization. IEEE Trans. Pattern Anal. Mach. Intell., 28(10):1568-1583, 2006. (Pubitemid 46405078)
11. V. Kolmogorov and M.J. Wainwright. On the optimality of tree-reweighted max-product message passing. In Uncertainty in Artificial Intelligence (UAI), 2005.
12. B. Kuhlman and D. Baker. Native protein sequences are close to optimal for their structures. PNAS, 97(19):10383-10388, 2000.
13. R. Marinescu, K. Kask, and R. Dechter. Systematic vs. non-systematic algorithms for solving the MPE task. In UAI, 2003.
14. T. Meltzer, C. Yanover, and Y. Weiss. Globally optimal solutions for energy minimization in stereo vision using reweighted belief propagation. In ICCV, 2005.
15. E.G. Santos. On the generation of alternative explanations with implications for belief revision. In UAI, 1991.
16. Y. Shimony. Finding the MAPs for belief networks is NP-hard. Aritifical Intelligence, 68(2):399-410, 1994.
17. A.G. Street and S.L. Mayo. Computational protein design. Structure with folding and design, 7:R105-109, 1999. (Pubitemid 29230480)
18. R. Szeliski, R. Zabih, D. Scharstein, O. Veksler, V. Kolmogorov, A. Agarwala, M. F. Tappen, and C. Rother. A comparative study of energy minimization methods for markov random fields. In ECCV (2), pages 16-29, 2006. (Pubitemid 44029714)
19. M. Tappen and W.T. Freeman. Graph cuts and belief propagation for stereo, using identical MRF parameters. In ICCV, 2003.
20. M. J. Wainwright, T. Jaakkola, and A. S. Willsky. Tree consistency and bounds on the performance of the max-product algorithm and its generalizations. Statistics and Computing, 14:143-166, 2004. (Pubitemid 39051297)
21. M. J. Wainwright, T. Jaakkola, and A. S. Willsky. MAP estimation via agreement on trees: message-passing and linear programming. IEEE Transactions on Information Theory, 51(11):3697-3717, 2005. (Pubitemid 41622574)
22. M. J. Wainwright, T. Jaakkola, and A. S. Willsky. A new class of upper bounds on the log partition function. IEEE Transactions on Information Theory, 51(7):2313-2335, 2005. (Pubitemid 41136395)
23. Y. Weiss. Correctness of local probability propagation in graphical models with loops. Neural Computation, 12:1-41, 2000.
24. M. Welling and Y.W. Teh. Belief optimization: a stable alternative to belief propagation. In Proceedings UAI 2001, 2001.
25. W. Wiegerinck and T. Heskes. Fractional belief propagation. In Advances in Neural Processing Systems (NIPS), 2003.
26. C. Yanover, T. Meltzer, and Y. Weiss. Linear programming relaxations and belief propagation - an empirical study. Jourmal of Machine Learning Research, 7:1887-1907, 2006. (Pubitemid 44423552)
27. C. Yanover and Y. Weiss. Approximate inference and protein folding. Advances in Neural Information Processing Systems, 2002.
28. J.S. Yedidia, W.T. Freeman, and Yair Weiss. Constructing free energy approximations and generalized belief propagation algorithms. IEEE Transactions on Information Theory, 51(7):2282-2312, 2005. (Pubitemid 41136394)
29. A. L. Yuille. CCCP algorithms to minimize the Bethe and Kikuchi free energies: convergent alternatives to belief propagation. Neural Comput., 14(7):1691-1722, 2002.