Linear programming relaxations and belief propagation -- an empirical study

MaRDI QIDQ3174025zbMATH OpenFDO

Authors Chen Yanover, Talya Meltzer, Yair Weiss

Publication date 12 October 2011

Full work available at URL http://www.jmlr.org/papers/v7/yanover06a.html

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Machine vision and scene understanding (68T45)

Recommendations

• Convergence and Correctness of Max-Product Belief Propagation for Linear Programming
• MAP Estimation Via Agreement on Trees: Message-Passing and Linear Programming
• Message-passing for graph-structured linear programs: proximal methods and rounding schemes
• An analysis of convex relaxations for MAP estimation of discrete MRFs
• Belief Propagation for Weighted b-Matchings on Arbitrary Graphs and its Relation to Linear Programs with Integer Solutions

Cited in

(21)

• Field of experts regularized nonlocal low rank matrix approximation for image denoising
• An exact algorithm for side-chain placement in protein design
• scientific article; zbMATH DE number 5885078 (Why is no real title available?)
• Message-passing for graph-structured linear programs: proximal methods and rounding schemes
• MAP Estimation Via Agreement on Trees: Message-Passing and Linear Programming
• Hinge-loss Markov random fields and probabilistic soft logic
• Convergence and Correctness of Max-Product Belief Propagation for Linear Programming
• Image labeling based on graphical models using Wasserstein messages and geometric assignment
• MAP inference via \(\ell_2\)-sphere linear program reformulation
• Leveraging cluster backbones for improving MAP inference in statistical relational models
• Discriminative models for multi-class object layout
• Fields of experts
• Belief Propagation for Weighted b-Matchings on Arbitrary Graphs and its Relation to Linear Programs with Integer Solutions
• Lifted graphical models: a survey
• A family of CCCP algorithms which minimize the TRW free energy
• Relational linear programming
• Computational protein design as an optimization problem
• Train and test tightness of LP relaxations in structured prediction
• Certifiably optimal sparse principal component analysis
• Separate but equal: equality in belief propagation for single-cycle graphs
• Governing convergence of Max-sum on DCOPs through damping and splitting

Describes a project that uses

Uses Software

• CPLEX
• BNT

This page was built for publication: Linear programming relaxations and belief propagation -- an empirical study

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174025)