On Coordinate Minimization of Convex Piecewise-Affine Functions

09/14/2017
by   Tomas Werner, et al.
0

A popular class of algorithms to optimize the dual LP relaxation of the discrete energy minimization problem (a.k.a. MAP inference in graphical models or valued constraint satisfaction) are convergent message-passing algorithms, such as max-sum diffusion, TRW-S, MPLP and SRMP. These algorithms are successful in practice, despite the fact that they are a version of coordinate minimization applied to a convex piecewise-affine function, which is not guaranteed to converge to a global minimizer. These algorithms converge only to a local minimizer, characterized by local consistency known from constraint programming. We generalize max-sum diffusion to a version of coordinate minimization applicable to an arbitrary convex piecewise-affine function, which converges to a local consistency condition. This condition can be seen as the sign relaxation of the global optimality condition.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/21/2019

Relative Interior Rule in Block-Coordinate Minimization

(Block-)coordinate minimization is an iterative optimization method whic...
research
11/24/2021

Efficient semidefinite bounds for multi-label discrete graphical models

By concisely representing a joint function of many variables as the comb...
research
07/03/2020

The combined basic LP and affine IP relaxation for promise VCSPs on infinite domains

Convex relaxations have been instrumental in solvability of constraint s...
research
01/28/2020

A Class of Linear Programs Solvable by Coordinate-wise Minimization

Coordinate-wise minimization is a simple popular method for large-scale ...
research
07/01/2020

Accelerated Message Passing for Entropy-Regularized MAP Inference

Maximum a posteriori (MAP) inference in discrete-valued Markov random fi...
research
01/17/2022

Parametrized Convex Universal Approximators for Decision-Making Problems

Parametrized max-affine (PMA) and parametrized log-sum-exp (PLSE) networ...
research
05/04/2015

Higher Order Maximum Persistency and Comparison Theorems

We address combinatorial problems that can be formulated as minimization...

Please sign up or login with your details

Forgot password? Click here to reset