Linear programming relaxations and belief propagation -- an empirical study
From MaRDI portal
Publication:3174025
zbMATH Open1222.90033MaRDI QIDQ3174025FDOQ3174025
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
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
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)
Cited In (20)
- A family of CCCP algorithms which minimize the TRW free energy
- Certifiably optimal sparse principal component analysis
- Discriminative models for multi-class object layout
- Fields of experts
- MAP Estimation Via Agreement on Trees: Message-Passing and Linear Programming
- An exact algorithm for side-chain placement in protein design
- Field of experts regularized nonlocal low rank matrix approximation for image denoising
- Image labeling based on graphical models using Wasserstein messages and geometric assignment
- Governing convergence of Max-sum on DCOPs through damping and splitting
- Train and test tightness of LP relaxations in structured prediction
- Title not available (Why is that?)
- Separate but equal: equality in belief propagation for single-cycle graphs
- Convergence and Correctness of Max-Product Belief Propagation for Linear Programming
- Relational linear programming
- Computational protein design as an optimization problem
- Belief Propagation for Weighted b-Matchings on Arbitrary Graphs and its Relation to Linear Programs with Integer Solutions
- Lifted graphical models: a survey
- Hinge-loss Markov random fields and probabilistic soft logic
- Message-passing for graph-structured linear programs: proximal methods and rounding schemes
- Leveraging cluster backbones for improving MAP inference in statistical relational models
Uses Software
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)
