5 search results - page 1 / 1 » Complete Convergence of Message Passing Algorithms for Some ... |
APPROX
2006
Springer
13 years 9 months ago
2006
Springer
NIPS
2007
13 years 6 months ago
2007
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 ...
JMLR
2012
11 years 7 months ago
2012
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...
ICML
2008
IEEE
14 years 6 months ago
2008
IEEE
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 ...
JMLR
2010
13 years 4 days ago
2010
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...