MAP inference via Block-Coordinate Frank-Wolfe Algorithm

06/13/2018
by   Paul Swoboda, et al.
0

We present a new proximal bundle method for Maximum-A-Posteriori (MAP) inference in structured energy minimization problems. The method optimizes a Lagrangean relaxation of the original energy minimization problem using a multi plane block-coordinate Frank-Wolfe method that takes advantage of the specific structure of the Lagrangean decomposition. We show empirically that our method outperforms state-of-the-art Lagrangean decomposition based algorithms on some challenging Markov Random Field, multi-label discrete tomography and graph matching problems.

READ FULL TEXT
research
10/21/2019

Relative Interior Rule in Block-Coordinate Minimization

(Block-)coordinate minimization is an iterative optimization method whic...
research
04/16/2020

Taxonomy of Dual Block-Coordinate Ascent Methods for Discrete Energy Minimization

We consider the maximum-a-posteriori inference problem in discrete graph...
research
03/05/2011

Submodular Decomposition Framework for Inference in Associative Markov Networks with Global Constraints

In the paper we address the problem of finding the most probable state o...
research
02/21/2018

Continuous Relaxation of MAP Inference: A Nonconvex Perspective

In this paper, we study a nonconvex continuous relaxation of MAP inferen...
research
04/16/2013

RockIt: Exploiting Parallelism and Symmetry for MAP Inference in Statistical Relational Models

RockIt is a maximum a-posteriori (MAP) query engine for statistical rela...
research
11/29/2016

Efficient Linear Programming for Dense CRFs

The fully connected conditional random field (CRF) with Gaussian pairwis...
research
07/30/2013

Multi-dimensional Parametric Mincuts for Constrained MAP Inference

In this paper, we propose novel algorithms for inferring the Maximum a P...

Please sign up or login with your details

Forgot password? Click here to reset