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
    25 Citations
    MAP Inference in Chains using Column Generation
    • 6
    • PDF
    Stochastic Belief Propagation: A Low-Complexity Alternative to the Sum-Product Algorithm
    • 40
    • PDF
    Stochastic belief propagation: Low-complexity message-passing with guarantees
    • Nima Noorshams, M. Wainwright
    • Mathematics, Computer Science
    • 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
    • 2011
    • 10
    • PDF
    Tensor Belief Propagation
    • 7
    • PDF
    Exploiting Data-Independence for Fast Belief-Propagation
    • 12
    • PDF
    Tutorial on Exact Belief Propagation in Bayesian Networks: from Messages to Algorithms
    • 2
    • PDF
    Low-complexity stochastic Generalized Belief Propagation
    • 2
    • PDF
    Improved max-sum algorithm for DCOP with n-ary constraints
    • 12
    • PDF

    References

    SHOWING 1-10 OF 51 REFERENCES
    Residual Belief Propagation: Informed Scheduling for Asynchronous Message Passing
    • 276
    • PDF
    Factor graphs and the sum-product algorithm
    • 3,576
    • PDF
    Counting Belief Propagation
    • 166
    • PDF
    Exploiting Data-Independence for Fast Belief-Propagation
    • 12
    • PDF
    Tightening LP Relaxations for MAP using Message Passing
    • 296
    • Highly Influential
    • PDF
    Graph Rigidity, Cyclic Belief Propagation, and Point Pattern Matching
    • 29
    • PDF
    Efficient Belief Propagation for Early Vision
    • Pedro F. Felzenszwalb, D. Huttenlocher
    • Mathematics, Computer Science
    • Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004.
    • 2004
    • 981
    • PDF
    Exploiting Within-Clique Factorizations in Junction-Tree Algorithms
    • 11
    • PDF
    Correctness of Local Probability Propagation in Graphical Models with Loops
    • Yair Weiss
    • Mathematics, Computer Science
    • Neural Computation
    • 2000
    • 506
    Inference in Bayesian Networks Using Nested Junction Trees
    • Uffe Kjærulff
    • Mathematics, Computer Science
    • Learning in Graphical Models
    • 1998
    • 18