Corpus ID: 3257886

Faster Algorithms for Max-Product Message-Passing

@article{McAuley2011FasterAF,
  title={Faster Algorithms for Max-Product Message-Passing},
  author={Julian McAuley and T. Caetano},
  journal={J. Mach. Learn. Res.},
  year={2011},
  volume={12},
  pages={1349-1388}
}

Julian McAuley, T. Caetano

Published 2011

Computer Science, Mathematics

J. Mach. Learn. Res.

Maximum A Posteriori inference in graphical models is often solved via message-passing algorithms, such as the junction-tree algorithm or loopy belief-propagation. The exact solution to this problem is well-known to be exponential in the size of the maximal cliques of the triangulated model, while approximate inference is typically exponential in the size of the model's factors. In this paper, we take advantage of the fact that many models have maximal cliques that are larger than their… CONTINUE READING

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed