Reparameterization based consistent graph-structured linear programs

Hongbo Zhou, Qiang Cheng, Zhikun She

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


A class of Maximum A Posteriori(MAP) formulations built on various graph models are of great interests for both theoretical and practical applications. Recent advances in this field have extended the connections between the linear program (LP) relaxation and various tree-reweighted message passing algorithms. At both sides, many algorithms and their optimality certificates are proved, provided no conflict exists between the node marginal maximum and the corresponding edge marginal maximum. However, these conflicts are usually inevitable for general non-trivial Markov random fields (MRFs). Our work is aimed at reducing such conflicts by reparameterizing the original energy distributions in pairwise Markov random field. All node potentials will be decomposed and attached to local edges according to their local graph structures. And thus, only edge marginals are needed in our linear program relaxation, and the node marginals are only used to exchange information among different parts of the graph. We incorporated this consistent graph-structured reparameterization into some latest LP optimality guaranteed proximal solvers, and the resulted algorithms outperform the original ones in convergence rate and also have a better behavior to converge to MAP optimality monotonously even for some highly noisy MRFs.

Original languageEnglish
Title of host publicationAPPLIED COMPUTING 2010 - The 25th Annual ACM Symposium on Applied Computing
Number of pages5
StatePublished - 2010
Event25th Annual ACM Symposium on Applied Computing, SAC 2010 - Sierre, Switzerland
Duration: Mar 22 2010Mar 26 2010

Publication series

NameProceedings of the ACM Symposium on Applied Computing


Conference25th Annual ACM Symposium on Applied Computing, SAC 2010


  • MAP optimality
  • Markov random field
  • linear program

ASJC Scopus subject areas

  • Software


Dive into the research topics of 'Reparameterization based consistent graph-structured linear programs'. Together they form a unique fingerprint.

Cite this