Message-Passing Algorithms for Quadratic Programming Formulations of MAP Estimation
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-conve...
Saved in:
Main Authors: | KUMAR, Akshat, ZILBERSTEIN, Shlomo |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2011
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/2205 https://ink.library.smu.edu.sg/context/sis_research/article/3205/viewcontent/1202.3739.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Message Passing Algorithms for MAP Estimation using DC Programming
by: KUMAR, Akshat, et al.
Published: (2012) -
Message-Passing Algorithms for Large Structured Decentralized POMDPs
by: KUMAR, Akshat, et al.
Published: (2011) -
MAP Estimation for Graphical Models by Likelihood Maximization
by: KUMAR, Akshat, et al.
Published: (2010) -
Point-Based Backup for Decentralized POMPDs: Complexity and New Algorithms
by: KUMAR, Akshat, et al.
Published: (2010) -
Dynamic Programming Approximations for Partially Observable Stochastic Games
by: KUMAR, Akshat, et al.
Published: (2009)