Variational algorithms for marginal MAP

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

Volumn , Issue , 2011, Pages 453-462

  Liu, Qiang ^a   Ihler, Alexander ^a  

^a Irvine   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; MESSAGE PASSING;

GRAPHICAL MODEL; LOCAL OPTIMA; MESSAGE PASSING ALGORITHM; UPPER BOUND; VARIATIONAL ALGORITHMS; VARIATIONAL EM; VARIATIONAL FRAMEWORK;

APPROXIMATION ALGORITHMS;

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

References (14)

1. A. Doucet, S. J. Godsill, and C. P. Robert. Marginal maximum a posteriori estimation using Markov chain Monte Carlo. Statistics and Computing, 12(1), Jan. 2002.
2. J. Huang, M. Chavira, and A. Darwiche. Solving MAP exactly by searching on compiled arithmetic circuits. InConference on Artificial Intelligence (AAAI), pages 143-148, 2006.
3. E. T. Jaynes. Information theory and statistical mechanics. Phys. Rev., 106(4):620-630, May 1957.
4. J. Jiang and H. Daumé III. Message-passing algorithm for marginal-MAP estimation. In Learning Workshop, 2010.
5. D. Koller and N. Friedman. Probabilistic graphical models: principles and techniques. MIT press, 2009.
6. R. Neal and G. E. Hinton. A view of the EM algorithm that justifies incremental, sparse, and other variants. In M. Jordan, editor, Learning in Graphical Models, pages 55-368. Kluwer, 1998.
7. J. Park and A. Darwiche. Complexity results and approximation strategies for MAP explanations. Journal of Artificial Intelligence Research, 21:101-133, 2004. (Pubitemid 41525899)
8. D. Sontag, A. Globerson, and T. Jaakkola. Introduction to dual decomposition for inference. In Optimization for Machine Learning. MIT Press, 2011.
9. M. Wainwright and M. Jordan. Graphical models, exponential families, and variational inference. Found. Trends Mach. Learn., 1(1-2):1-305, 2008.
10. M. Wainwright, T. Jaakkola, and A. Willsky. A new class of upper bounds on the log partition function. IEEE Trans. Info. Theory, 51(7):2313-2335, July 2005. (Pubitemid 41136395)
11. M. J. Wainwright, T. Jaakkola, and A. S. Willsky. Treebased reparameterization framework for analysis of sumproduct and related algorithms. IEEE Trans. Info. Theory, 45:1120-1146, 2003.
12. Y. Weiss, C. Yanover, and T. Meltzer. MAP estimation, linear programming and belief propagation with convex free energies. In Uncertainty in Artificial Intelligence, 2007.
13. J. Yedidia, W. Freeman, and Y. Weiss. Constructing freeenergy approximations and generalized BP algorithms. IEEE Trans. Inf. Theory, 51, July 2005.
14. A. L. Yuille. CCCP algorithms to minimize the Bethe and Kikuchi free energies: Convergent alternatives to belief propagation. Neural Comp., 14(7):1691-1722, July 2002.