Globally Convergent Dual MAP LP Relaxation Solvers using Fenchel-Young Margins

No abstract is available for this paper.

• Publication year

  2012

• Venue

  Neural Information Processing Systems

• Publication date

  2012-12-03

• 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.

• Probabilistic Graphical Models

  2014cited by this paper
• Tightening Fractional Covering Upper Bounds on the Partition Function for High-Order Region Graphs

  2012cited by this paper
• A bundle approach to efficient MAP-inference by Lagrangian relaxation

  2012cited by this paper
• Convergent message passing algorithms - a unifying view

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

  2011influential reference
• An Augmented Lagrangian Approach to Constrained MAP Inference

  2011cited by this paper
• Distributed message passing for large scale graphical models

  2011cited by this paper
• Dynamic Tree Block Coordinate Ascent

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

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

  2010cited by this paper
• Dual Decomposition for Parsing with Non-Projective Head Automata

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

  2010cited by this paper
• Revisiting the Linear Programming Relaxation Approach to Gibbs Energy Minimization and Weighted Constraint Satisfaction

  2010influential reference
• Norm-Product Belief Propagation: Primal-Dual Message-Passing for Approximate Inference

  2009influential reference
• Tree Block Coordinate Descent for MAP in Graphical Models

  2009influential reference
• Convex relaxation methods for graphical models: Lagrangian and maximum entropy approaches

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

  2008cited by this paper
• Fixing Max-Product: Convergent Message Passing Algorithms for MAP LP-Relaxations

  2007cited by this paper
• MAP Estimation, Linear Programming and Belief Propagation with Convex Free Energies

  2007cited by this paper
• Convex Analysis and Optimization

  2006influential reference
• Convergent Tree-Reweighted Message Passing for Energy Minimization

  2006cited by this paper
• Constructing free-energy approximations and generalized belief propagation algorithms

  2005cited by this paper
• MAP estimation via agreement on trees: message-passing and linear programming

  2005cited by this paper
• Interior Gradient and Epsilon-Subgradient Descent Methods for Constrained Convex Minimization

  2004cited by this paper
• The partial constraint satisfaction problem: Facets and lifting theorems

  1998cited by this paper
• Human Information Processing

  1977cited by this paper
• A METHOD OF CONJUGATE SUBGRADIENTS FOR

  1975cited by this paper
• Note on a method of conjugate subgradients for minimizing nondifferentiable functions

  1974cited by this paper
• An Algorithm for Minimizing Convex Functions

  1974cited by this paper

• One-sided Frank-Wolfe algorithms for saddle problems

  2021cites this paper
• Solving Relaxations of MAP-MRF Problems: Combinatorial in-Face Frank-Wolfe Directions

  2020cites this paper
• MAP Inference via (cid:96) 2 -Sphere Linear Program Reformulation

  2020cites this paper
• Can We Learn Heuristics for Graphical Model Inference Using Reinforcement Learning?

  2020cites this paper
• Can We Learn Heuristics For Graphical Model Inference Using Reinforcement Learning?

  2020cites this paper
• MAP Inference Via ℓ2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\ell _2$$\end{document}-Sphere Linear Program Refo

  2019cites this paper
• Graph Structured Prediction Energy Net Algorithms

  2019cites this paper
• MAP Inference via (cid:96) 2 -Sphere Linear Program Reformulation

  2019cites this paper
• Approximate Sherali-Adams Relaxations for MAP Inference via Entropy Regularization

  2019cites this paper
• Graph Structured Prediction Energy Networks

  2019cites this paper
• Convergence Rates of Smooth Message Passing with Rounding in Entropy-Regularized MAP Inference

  2019cites this paper
• Deep Structured Prediction with Nonlinear Output Transformations

  2018cites this paper
• Structural Consistency and Controllability for Diverse Colorization

  2018cites this paper
• Creativity: Generating Diverse Questions Using Variational Autoencoders

  2017cites this paper
• Asynchronous Parallel Coordinate Minimization for MAP Inference

  2017cites this paper
• Solving Constrained Combinatorial Optimisation Problems via MAP Inference without High-Order Penalties

  2017cites this paper
• Generative Adversarial Structured Networks

  2016cites this paper
• Constraints Based Convex Belief Propagation

  2016cites this paper
• AD3: alternating directions dual decomposition for MAP inference in graphical models

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

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

  2015influential citation
• Smooth and Strong: MAP Inference with Linear Convergence

  2015cites this paper
• Distributed Algorithms for Large Scale Learning and Inference in Graphical Models

  2015cites this paper
• Conditional Random Fields for Pattern Recognition Applied to Structured Data

  2015cites this paper
• Unifying Local Consistency and MAX SAT Relaxations for Scalable Inference with Rounding Guarantees

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

  2015cites this paper
• Rounding Guarantees for Message-Passing MAP Inference with Logical Dependencies

  2014cites this paper
• Message Passing for Soft Constraint Dual Decomposition

  2014cites this paper
• Globally Convergent Parallel MAP LP Relaxation Solver using the Frank-Wolfe Algorithm

  2014influential citation
• Inference and learning algorithms with applications to 3D indoor scene understanding

  2013cites this paper
• Energy distribution view for monotonic dual decomposition

  2013cites this paper
• Constraint Reduction using Marginal Polytope Diagrams for MAP LP Relaxations

  2013cites this paper
• A new criterion for choosing planar subproblems in MAP-MRF inference

  2013cites this paper
• Compact Relaxations for MAP Inference in Pairwise MRFs with Piecewise Linear Priors

  2013cites this paper