249 citations · 367 across the 4 of their papers we have counts for
4 papers
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…
Tightening LP Relaxations for MAP using Message Passing
David Sontag, Talya Meltzer, Amir Globerson +2
Linear Programming (LP) relaxations have become powerful tools for finding the most probable (MAP) configuration in graphical models. These relaxations can be solved efficiently us…
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…
A Hike in the Phases of the 1-in-3 Satisfiability
Elitza Maneva, Talya Meltzer, Jack Raymond +2
We summarise our results for the random --1-in-3 satisfiability problem, where is a probability of negation of the variable. We employ both rigorous and heuristic methods to…