Unifying Local Consistency and MAX SAT Relaxations for Scalable Inference with Rounding Guarantees

No abstract is available for this paper.

• Publication year

  2015

• Venue

  International Conference on Artificial Intelligence and Statistics

• Publication date

  2015-02-21

• Fields of study

  Mathematics, Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Minimization Methods For Non Differentiable Functions

  2016cited by this paper
• Minima of Functions of Several Variables with Inequalities as Side Conditions

  2014cited by this paper
• Hinge-loss Markov Random Fields: Convex Inference for Structured Prediction

  2013cited by this paper
• Tighter Linear Program Relaxations for High Order Graphical Models

  2013cited by this paper
• Globally Convergent Dual MAP LP Relaxation Solvers using Fenchel-Young Margins

  2012cited by this paper
• Efficiently Searching for Frustrated Cycles in MAP Inference

  2012influential reference
• Revisiting MAP Estimation, Message Passing and Perfect Graphs

  2011cited by this paper
• MRF Energy Minimization and Beyond via Dual Decomposition

  2011cited by this paper
• Introduction to dual composition for inference

  2011cited by this paper
• An Augmented Lagrangian Approach to Constrained MAP Inference

  2011cited by this paper
• An Alternating Direction Method for Dual MAP LP Relaxation

  2011cited by this paper
• Message-passing for Graph-structured Linear Programs: Proximal Methods and Rounding Schemes

  2010cited by this paper
• Accelerated dual decomposition for MAP inference

  2010cited by this paper
• A Scalable Framework for Modeling Competitive Diffusion in Social Networks

  2010cited by this paper
• 1 Introduction to Dual Decomposition for Inference

  2010cited by this paper
• Online Max-Margin Weight Learning with Markov Logic Networks

  2010cited by this paper
• Two “well-known” properties of subgradient optimization

  2009cited by this paper
• MAP Estimation, Message Passing, and Perfect Graphs

  2009cited by this paper
• Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods

  2008cited by this paper
• Tightening LP Relaxations for MAP using Message Passing

  2008influential reference
• Graphical Models, Exponential Families, and Variational Inference

  2008influential reference
• Fixing Max-Product: Convergent Message Passing Algorithms for MAP LP-Relaxations

  2007cited by this paper
• Linear Programming Relaxations and Belief Propagation - An Empirical Study

  2006cited by this paper
• Quadratic programming relaxations for metric labeling and Markov random field MAP estimation

  2006cited by this paper
• Convergent Tree-Reweighted Message Passing for Energy Minimization

  2006cited by this paper
• Markov logic networks

  2006cited by this paper
• Solving Markov Random Fields using Second Order Cone Programming Relaxations

  2006cited by this paper
• Using linear programming to Decode Binary linear codes

  2005cited by this paper
• An LP Formulation and Approximation Algorithms for the Metric Labeling Problem

  2004cited by this paper
• Combinatorial optimization. Polyhedra and efficiency.

  2003cited by this paper
• MAP Complexity Results and Approximation Methods

  2002cited by this paper
• Using weighted MAX-SAT engines to solve MPE

  2002cited by this paper
• The Probablistic Method

  2000cited by this paper
• Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields

  1999cited by this paper
• The Probabilistic Method

  1998cited by this paper
• Approximating MAPs for Belief Networks is NP-Hard and Other Theorems

  1998cited by this paper
• Nonlinear Programming

  1995cited by this paper
• New 3/4-Approximation Algorithms for the Maximum Satisfiability Problem

  1994influential reference
• Finding MAPs for Belief Networks is NP-Hard

  1994influential reference
• Some Simplified NP-Complete Graph Problems

  1976cited by this paper

• Tractable Probabilistic Reasoning Through Effective Grounding

  2019cites this paper
• Exploits in Concurrency for Boolean Satisfiability

  2018cites this paper
• Leveraging Neighbor Attributes for Classification in Sparsely Labeled Networks

  2016cites this paper
• On the Semantic Relationship between Probabilistic Soft Logic and Markov Logic

  2016influential citation
• Guaranteed Parameter Estimation of Discrete Energy Minimization for 3 D Scene Parsing

  2016cites this paper
• Complexity of Discrete Energy Minimization Problems

  2016cites this paper
• Collective Graph Identification

  2016cites this paper
• Hinge-Loss Markov Random Fields and Probabilistic Soft Logic: A Scalable Approach to Structured Prediction

  2015influential citation
• Maximum persistency via iterative relaxed inference with graphical models

  2015cites this paper
• Hinge-Loss Markov Random Fields and Probabilistic Soft Logic

  2015influential citation
• Conditional Random Fields for Pattern Recognition Applied to Structured Data

  2015cites this paper