Anytime marginal maximum a posteriori inference

Proceedings of the 29th International Conference on Machine Learning, ICML 2012

Volumn 2, Issue , 2012, Pages 1471-1478

  Mauá, Denis Deratani ^a   De Campos, Cassio Polpo ^a  

^a DALLE MOLLE INSTITUTE FOR ARTIFICIAL INTELLIGENCE IDSIA   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ANYTIME ALGORITHM; ASYMPTOTIC CONVERGENCE; BOUNDED TREEWIDTH; GRAPHICAL MODEL; MAXIMUM A POSTERIORI; SYSTEMATIC SEARCH ALGORITHM; THEORETICAL ERRORS;

ALGORITHMS; ERROR ANALYSIS;

LEARNING SYSTEMS;

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

References (8)

1. de Campos, C.P. New complexity results for MAP in Bayesian networks. In IJCAI '11, pp. 2100-2106, 2011.
2. Jiang, J., Rai, P., and III, H. Daume. Message-passing for approximate MAP inference with latent variables. In NIPS '11, pp. 1197-1205. 2011.
3. Koller, D. and Friedman, N. Probabilistic Graphical Models: Principles and Techniques. 2009.
4. Liu, Q. and Ihler, A. Variational algorithms for marginal MAP. In UAI '11, pp. 453-462, 2011.
5. Meek, C. and Wexler, Y. Approximating max-sum-product problems using multiplicative error bounds. Bayesian Statistics, (9):439-472, 2011.
6. Park, J.D. and Darwiche, A. Solving MAP exactly using systematic search. In UAI '03, pp. 459-468, 2003.
7. Park, J.D. and Darwiche, A. Complexity results and approximation strategies for MAP explanations. JAIR, 21:101-133, 2004.
8. Yuan, C., Lu, T.-C., and Druzdzel, M. J. Annealed MAP. In UAI '04, pp. 628-635, 2004.