Optimization With Parity Constraints: From Binary Codes to Discrete Integration

09/26/2013
by   Stefano Ermon, et al.
0

Many probabilistic inference tasks involve summations over exponentially large sets. Recently, it has been shown that these problems can be reduced to solving a polynomial number of MAP inference queries for a model augmented with randomly generated parity constraints. By exploiting a connection with max-likelihood decoding of binary codes, we show that these optimizations are computationally hard. Inspired by iterative message passing decoding algorithms, we propose an Integer Linear Programming (ILP) formulation for the problem, enhanced with new sparsification techniques to improve decoding performance. By solving the ILP through a sequence of LP relaxations, we get both lower and upper bounds on the partition function, which hold with high probability and are much tighter than those obtained with variational methods.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/06/2019

Symbol Message Passing Decoding of Nonbinary Low-Density Parity-Check Codes

We present a novel decoding algorithm for q-ary low-density parity-check...
research
08/28/2019

Efficient Decoding of Interleaved Low-Rank Parity-Check Codes

An efficient decoding algorithm for horizontally u-interleaved LRPC code...
research
01/23/2019

Minimum-Polytope-Based Linear Programming Decoder for LDPC Codes via ADMM Approach

In this letter, we develop an efficient linear programming (LP) decoding...
research
02/27/2013

Taming the Curse of Dimensionality: Discrete Integration by Hashing and Optimization

Integration is affected by the curse of dimensionality and quickly becom...
research
10/16/2012

An Efficient Message-Passing Algorithm for the M-Best MAP Problem

Much effort has been directed at algorithms for obtaining the highest pr...
research
01/10/2019

A Reduced-Complexity Projection Algorithm for ADMM-based LP Decoding

The Alternating Direction Method of Multipliers has recently been adapte...
research
12/01/2010

Counting in Graph Covers: A Combinatorial Characterization of the Bethe Entropy Function

We present a combinatorial characterization of the Bethe entropy functio...

Please sign up or login with your details

Forgot password? Click here to reset