1.5k citations · 2.2k across the 24 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
cs.AI2013★ 7 cited
Tighter Linear Program Relaxations for High Order Graphical Models
Elad Mezuman, Daniel Tarlow, Amir Globerson +1
Graphical models with High Order Potentials (HOPs) have received considerable interest in recent years. While there are a variety of approaches to inference in these models, nearly…
cs.AI2013★ 1.5k cited
Loopy Belief Propagation for Approximate Inference: An Empirical Study
Kevin Murphy, Yair Weiss, Michael I. Jordan
Recently, researchers have demonstrated that loopy belief propagation - the use of Pearls polytree algorithm IN a Bayesian network WITH loops OF error- correcting codes.The most dr…
cs.AI2013★ 109 cited
The Factored Frontier Algorithm for Approximate Inference in DBNs
Kevin Murphy, Yair Weiss
The Factored Frontier (FF) algorithm is a simple approximate inferencealgorithm for Dynamic Bayesian Networks (DBNs). It is very similar tothe fully factorized version of the Boyen…