Skip to yearly menu bar Skip to main content


Constraints Based Convex Belief Propagation

Yaniv Tenzer · Alex Schwing · Kevin Gimpel · Tamir Hazan

Area 5+6+7+8 #85

Keywords: [ Structured Prediction ] [ Graphical Models ] [ Variational Inference ] [ Convex Optimization ]


Inference in Markov random fields subject to consistency structure is a fundamental problem that arises in many real-life applications. In order to enforce consistency, classical approaches utilize consistency potentials or encode constraints over feasible instances. Unfortunately this comes at the price of a serious computational bottleneck. In this paper we suggest to tackle consistency by incorporating constraints on beliefs. This permits derivation of a closed-form message-passing algorithm which we refer to as the Constraints Based Convex Belief Propagation (CBCBP). Experiments show that CBCBP outperforms the standard approach while being at least an order of magnitude faster.

Live content is unavailable. Log in and register to view live content