Message Passing Algorithms for MAP Estimation using DC Programming

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 difference of convex functions (DC) programming, and use the concave-convex procedure (CCCP) to develop efficient message-...

Full description

Saved in:
Bibliographic Details
Main Authors: KUMAR, Akshat, ZILBERSTEIN, Shlomo, TOUSSAINT, Marc
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2012
Subjects:
Artificial Intelligence and Robotics
Operations Research, Systems Engineering and Industrial Engineering
Online Access:https://ink.library.smu.edu.sg/sis_research/2203
https://ink.library.smu.edu.sg/context/sis_research/article/3203/viewcontent/Message_Passing_Algorithms_for_MAP_Estimation_Using_DC_Programming.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English

Internet

https://ink.library.smu.edu.sg/sis_research/2203
https://ink.library.smu.edu.sg/context/sis_research/article/3203/viewcontent/Message_Passing_Algorithms_for_MAP_Estimation_Using_DC_Programming.pdf

Similar Items