1.5k citations · 2.2k across the 24 of their papers we have counts for
5 papers · 1 filter
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…
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…
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…
MAP Estimation, Linear Programming and Belief Propagation with Convex Free Energies
Yair Weiss, Chen Yanover, Talya Meltzer
Finding the most probable assignment (MAP) in a general graphical model is known to be NP hard but good approximations have been attained with max-product belief propagation (BP) a…
Convergent message passing algorithms - a unifying view
Talya Meltzer, Amir Globerson, Yair Weiss
Message-passing algorithms have emerged as powerful techniques for approximate inference in graphical models. When these algorithms converge, they can be shown to find local (or so…