Skip to content
conftrace_

linear programming relaxation

45 papers

LP RELAXATION

Papers

A Graphical Transformation for Belief Propagation: Maximum Weight Matchings and Odd-Sized Cycles NeurIPS 2013 Exact Rule Learning via Boolean Compressed Sensing ICML 2013 Global MAP-Optimality by Shrinking the Combinatorial Search Area with Convex Relaxation NeurIPS 2013 Linear Approximation to ADMM for MAP inference ACML 2013 Universality of the Local Marginal Polytope CVPR 2013 Convergence Rate Analysis of MAP Coordinate Minimization Algorithms NeurIPS 2012 Globally Convergent Dual MAP LP Relaxation Solvers using Fenchel-Young Margins NeurIPS 2012 Higher-Order Correlation Clustering for Image Segmentation NeurIPS 2011 Tighter Relaxations for MAP-MRF Inference: A Local Primal-Dual Gap based Separation Algorithm AISTATS 2011 Learning Bayesian Network Structure using LP Relaxations AISTATS 2010 MAP Estimation for Graphical Models by Likelihood Maximization NeurIPS 2010 MAP estimation in Binary MRFs via Bipartite Multi-cuts NeurIPS 2010 An Analysis of Convex Relaxations for MAP Estimation of Discrete MRFs JMLR 2009 An LP View of the M-best MAP problem NeurIPS 2009 Clusters and Coarse Partitions in LP Relaxations NeurIPS 2008 Improved Moves for Truncated Convex Models NeurIPS 2008 An Analysis of Convex Relaxations for MAP Estimation NeurIPS 2007 Linear programming analysis of loopy belief propagation for weighted matching NeurIPS 2007 Message Passing for Max-weight Independent Set NeurIPS 2007 Linear Programming Relaxations and Belief Propagation -- An Empirical Study JMLR 2006