Tightening LP Relaxations for MAP using Message Passing

13 June 2012

Papers citing "Tightening LP Relaxations for MAP using Message Passing"

30 / 80 papers shown

Title
On Sampling from the Gibbs Distribution with Random Maximum A-Posteriori Perturbations Tamir Hazan Subhransu Maji Tommi Jaakkola 76 56 0 29 Sep 2013
On MAP Inference by MWSS on Perfect Graphs Adrian Weller Tony Jebara 56 10 0 26 Sep 2013
Tighter Linear Program Relaxations for High Order Graphical Models Elad Mezuman Daniel Tarlow Amir Globerson Yair Weiss 97 14 0 26 Sep 2013
Optimization With Parity Constraints: From Binary Codes to Discrete Integration Stefano Ermon Carla P. Gomes Ashish Sabharwal B. Selman 80 36 0 26 Sep 2013
A new look at reweighted message passing V. Kolmogorov 76 54 0 22 Sep 2013
Higher-order Segmentation via Multicuts Jörg H. Kappes M. Speth Gerhard Reinelt Christoph Schnörr 109 47 0 28 May 2013
Simplifying Energy Optimization using Partial Enumeration Carl Olsson J. Ulén Yuri Boykov Vladimir Kolmogorov 64 1 0 07 Mar 2013
Taming the Curse of Dimensionality: Discrete Integration by Hashing and Optimization Stefano Ermon Carla P. Gomes Ashish Sabharwal B. Selman 72 131 0 27 Feb 2013
Alternating Directions Dual Decomposition Andre F. T. Martins Mário A. T. Figueiredo P. Aguiar Noah A. Smith Eric Xing 57 9 0 28 Dec 2012
Efficiently Searching for Frustrated Cycles in MAP Inference David Sontag Do Kook Choe Yitao Li 129 87 0 16 Oct 2012
Tightening Fractional Covering Upper Bounds on the Partition Function for High-Order Region Graphs Tamir Hazan Jian-wei Peng Amnon Shashua 98 16 0 16 Oct 2012
Join-graph based cost-shifting schemes Alexander Ihler N. Flerova R. Dechter L. Otten 102 49 0 16 Oct 2012
An Efficient Message-Passing Algorithm for the M-Best MAP Problem Dhruv Batra 97 29 0 16 Oct 2012
Getting Feasible Variable Estimates From Infeasible Ones: MRF Local Polytope Study Bogdan Savchynskyy S. Schmidt 98 9 0 15 Oct 2012
Blending Learning and Inference in Structured Prediction Tamir Hazan Alex Schwing David A. McAllester R. Urtasun 3DV 68 0 0 08 Oct 2012
Fast Planar Correlation Clustering for Image Segmentation Julian Yarkony Alexander Ihler Charless C. Fowlkes 85 75 0 02 Aug 2012
The OS* Algorithm: a Joint Approach to Exact Optimization and Sampling Marc Dymetman Guillaume Bouchard Simon Carter 71 13 0 03 Jul 2012
On the Partition Function and Random Maximum A-Posteriori Perturbations Tamir Hazan Tommi Jaakkola 125 93 0 27 Jun 2012
LPQP for MAP: Putting LP Solvers to Better Use Patrick A. Pletscher Sharon Wulff 47 5 0 18 Jun 2012
Generalized sequential tree-reweighted message passing V. Kolmogorov T. Schoenemann 102 22 0 29 May 2012
MAP Estimation of Semi-Metric MRFs via Hierarchical Graph Cuts M. P. Kumar D. Koller 85 39 0 09 May 2012
Exact and Approximate Inference in Associative Hierarchical Networks using Graph Cuts Chris Russell Lubor Ladicky Pushmeet Kohli Philip Torr BDL 52 24 0 15 Mar 2012
Message-Passing Algorithms for Quadratic Programming Formulations of MAP Estimation Akshat Kumar S. Zilberstein TPM 83 18 0 14 Feb 2012
Tightening MRF Relaxations with Planar Subproblems Julian Yarkony R. Morshed Alexander Ihler Charless C. Fowlkes 60 11 0 14 Feb 2012
Distributed Anytime MAP Inference J. V. D. Ven F. Ramos 41 2 0 14 Feb 2012
Planar Cycle Covering Graphs Julian Yarkony Alexander Ihler Charless C. Fowlkes 69 6 0 06 Apr 2011
Submodular Decomposition Framework for Inference in Associative Markov Networks with Global Constraints A. Osokin Dmitry Vetrov V. Kolmogorov 92 15 0 05 Mar 2011
Scalable Probabilistic Databases with Factor Graphs and MCMC Michael L. Wick Andrew McCallum G. Miklau 121 92 0 11 May 2010
Faster Algorithms for Max-Product Message-Passing Julian McAuley T. Caetano TPM 84 27 0 17 Oct 2009
Norm-Product Belief Propagation: Primal-Dual Message-Passing for Approximate Inference Tamir Hazan Amnon Shashua TPM 250 123 0 18 Mar 2009