Message-Passing Algorithms for Quadratic Programming Formulations of MAP Estimation

Details Message-Passing Algorithms for Quadratic Programming Formulations of MAP Estimation Message-Passing Algorithms for Quadratic Programming Formulations of MAP Estimation

2012-02-14

arxiv.org/abs/1202.3739v1

Computer Science

Artificial Intelligence

Scientific paper

Computing maximum a posteriori (MAP) estimation in graphical models is an important inference problem with many applications. We present message-passing algorithms for quadratic programming (QP) formulations of MAP estimation for pairwise Markov random fields. In particular, we use the concave-convex procedure (CCCP) to obtain a locally optimal algorithm for the non-convex QP formulation. A similar technique is used to derive a globally convergent algorithm for the convex QP relaxation of MAP. We also show that a recently developed expectation-maximization (EM) algorithm for the QP formulation of MAP can be derived from the CCCP perspective. Experiments on synthetic and real-world problems confirm that our new approach is competitive with max-product and its variations. Compared with CPLEX, we achieve more than an order-of-magnitude speedup in solving optimally the convex QP relaxation.

Affiliated with

Also associated with

No associations

Rating

Message-Passing Algorithms for Quadratic Programming Formulations of MAP Estimation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Message-Passing Algorithms for Quadratic Programming Formulations of MAP Estimation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Message-Passing Algorithms for Quadratic Programming Formulations of MAP Estimation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-90558