Tightening fractional covering upper bounds on the partition function for high-order region graphs

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

Volumn , Issue , 2012, Pages 356-366

  Hazan, Tamir ^a   Peng, Jian ^a   Shashua, Amnon ^b  

^a Unversity of Chicago   (United States)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BARRIER METHOD; CONCAVE PROGRAMS; CONVEX PROGRAMS; COVERING BOUNDS; ENTROPY FUNCTION; LARGE PROBLEMS; OPTIMIZATION SCHEME; PARTITION FUNCTIONS;

ARTIFICIAL INTELLIGENCE; MESSAGE PASSING;

ENTROPY;

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

References (36)

1. D. P. Bertsekas, A. Nedic, and A. E. Ozdaglar. Convex Analysis and Optimization. Athena Scientific, 2003.
2. D.P. Bertsekas. Nonlinear programming. 1999.
3. S.P. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, 2004.
4. T.M. Cover, J.A. Thomas, J. Wiley, et al. Elements of information theory, volume 6. Wiley Online Library, 1991.
5. P.F. Felzenszwalb, R.B. Girshick, D. McAllester, and D. Ramanan. Object detection with discriminatively trained part-based models. IEEE Transactions on Pattern Analysis and Machine Intelligence, pages 1627-1645, 2009.
6. E. Friedgut. Hypergraphs, entropy, and inequalities. The American Mathematical Monthly, 111(9):749-760, 2004.
7. A. Globerson and T. Jaakkola. Approximate inference using conditional entropy decompositions. In Proceedings of the Eleventh International Conference on Artificial Intelligence and Statistics, 2007.
8. A. Globerson and T. Jaakkola. Approximate inference using planar graph decomposition. In Advances in Neural Information Processing Systems 19: Proceedings of the 2006 Conference, volume 19, page 473. The MIT Press, 2007.
9. A. Globerson and T. Jaakkola. Convergent propagation algorithms via oriented trees. In UAI, 2007.
10. A. Globerson and T. S. Jaakkola. Fixing maxproduct: convergent message passing algorithms for MAP relaxations. In NIPS, 2007.
11. T. Hazan and A. Shashua. Convergent messagepassing algorithms for inference over general graphs with convex free energies. In Conference on Uncertainty in Artificial Intelligence (UAI), Helsinki, Finland, July 2008.
12. T. Heskes. Convexity arguments for efficient minimization of the Bethe and Kikuchi free energies. Journal of Artificial Intelligence Research, 26(1):153-190, 2006.
13. T. Heskes and O. Zoeter. Generalized belief propagation for approximate inference in hybrid bayesian networks. In Artificial Intelligence and Statistics. Citeseer, 2003.
14. A. Jaimovich, O. Meshi, I. McGraw, and G. Elidan. Fastinf: An efficient approximate inference library. The Journal of Machine Learning Research, 11:1733-1736, 2010.
15. J. Jiang, P. Rai, and H. Daume III. Messagepassing for approximate map inference with latent variables. NIPS, 2011.
16. H.J. Kappen and W. Wiegerinck. Novel iteration schemes for the cluster variation method. In Advances in Neural Information Processing Systems 14, 2001.
17. D. Karger and N. Srebro. Learning markov networks: Maximum bounded tree-width graphs. In Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, pages 392-401. Society for Industrial and Applied Mathematics, 2001.
18. D. Koller and N. Friedman. Probabilistic graphical models. MIT press, 2009.
19. T. Koo, A.M. Rush, M. Collins, T. Jaakkola, and D. Sontag. Dual decomposition for parsing with non-projective head automata. In Proceedings of the 2010 Conference on Empirical Methods in Natural Language Processing, pages 1288-1298. Association for Computational Linguistics, 2010.
20. J. Lafferty, A. McCallum, and F. Pereira. Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In International Conference of Machine Learning, pages 282-289, 2001.
21. Q. Liu and A. Ihler. Bounding the partition function using holders inequality. 2011.
22. Qiang Liu and Alexander Ihler. Variational algorithms for marginal map. In Uncertainty in Artificial Intelligence (UAI). Barcelona, Spain, 2011.
23. M. Madiman and P. Tetali. Information inequalities for joint distributions, with interpretations and applications. Information Theory, IEEE Transactions on, 56(6):2699-2713, 2010.
24. T. Meltzer, A. Globerson, and Y. Weiss. Convergent message passing algorithms-A unifying view. In UAI, 2009.
25. P. Pakzad and V. Anantharam. Estimation and marginalization using the kikuchi approximation methods. Neural Computation, 17(8):1836-1873, 2005.
26. J. Pearl. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann Publishers, 1988.
27. M.J.D. Powell. On search directions for minimization algorithms. Mathematical Programming, 4(1):193-201, 1973.
28. N. Ruozzi and S. Tatikonda. Convergent and correct message passing schemes for optimization problems over graphical models. Arxiv preprint arXiv:1002.3239, 2010.
29. D. Sontag, T. Meltzer, A. Globerson, T. Jaakkola, a.Y.Weiss. Tightening LP relaxations for MAP using message passing. In Conf. Uncertainty in Artificial Intelligence (UAI). Citeseer, 2008.
30. R. Szeliski, R. Zabih, D. Scharstein, O. Veksler, V. Kolmogorov, A. Agarwala, M. Tappen, and C. Rother. A comparative study of energy minimization methods for markov random fields with smoothness-based priors. IEEE Transactions on Pattern Analysis and Machine Intelligence, pages 1068-1080, 2007.
31. L.G. Valiant. The complexity of computing the permanent. Theoretical computer science, 8(2):189-201, 1979.
32. M. J. Wainwright, T. S. Jaakkola, and A. S. Willsky. A new class of upper bounds on the log partition function. Trans. on Information Theory, 51(7):2313-2335, 2005.
33. M. J. Wainwright, T. S. Jaakkola, and A. S. Willsky. MAP estimation via agreement on trees: message-passing and linear programming. Trans. on Information Theory, 51(11):3697-3717, 2005.
34. M.J. Wainwright and M.I. Jordan. Graphical models, exponential families, and variational inference. Foundations and Trends R in Machine Learning, 1(1-2):1-305, 2008.
35. W. Wiegerinck. Approximations with reweighted generalized belief propagation. 2005.
36. JS Yedidia, WT Freeman, and Y. Weiss. Constructing free-energy approximations and generalized belief propagation algorithms. Information Theory, IEEE Transactions on, 51(7):2282-2312, 2005.