Sciweavers

48 search results - page 1 / 10
» Message-Passing Algorithms for MAP Estimation Using DC Progr...
Sort
View
JMLR
2012
11 years 6 months ago
Message-Passing Algorithms for MAP Estimation Using DC Programming
We address the problem of finding the most likely assignment or MAP estimation in a Markov random field. We analyze the linear programming formulation of MAP through the lens of...
Akshat Kumar, Shlomo Zilberstein, Marc Toussaint
NIPS
2007
13 years 5 months ago
Fixing Max-Product: Convergent Message Passing Algorithms for MAP LP-Relaxations
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
Amir Globerson, Tommi Jaakkola
UAI
2008
13 years 5 months ago
Tightening LP Relaxations for MAP using Message Passing
Linear Programming (LP) relaxations have become powerful tools for finding the most probable (MAP) configuration in graphical models. These relaxations can be solved efficiently u...
David Sontag, Talya Meltzer, Amir Globerson, Tommi...
AUTOMATICA
2008
102views more  AUTOMATICA 2008»
13 years 3 months ago
A set-membership state estimation algorithm based on DC programming
This paper presents a new approach to guaranteed state estimation for nonlinear discrete-time systems with a bounded description of noise and parameters. The sets of states that a...
T. Alamo, J. M. Bravo, M. J. Redondo, Eduardo F. C...
ICML
2008
IEEE
14 years 4 months ago
Efficiently solving convex relaxations for MAP estimation
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
M. Pawan Kumar, Philip H. S. Torr