Streamlining Variational Inference for Constraint Satisfaction Problems

11/24/2018
by   Aditya Grover, et al.
0

Several algorithms for solving constraint satisfaction problems are based on survey propagation, a variational inference scheme used to obtain approximate marginal probability estimates for variable assignments. These marginals correspond to how frequently each variable is set to true among satisfying assignments, and are used to inform branching decisions during search; however, marginal estimates obtained via survey propagation are approximate and can be self-contradictory. We introduce a more general branching strategy based on streamlining constraints, which sidestep hard assignments to variables. We show that streamlined solvers consistently outperform decimation-based solvers on random k-SAT instances for several problem sizes, shrinking the gap between empirical performance and theoretical limits of satisfiability by 16.3 average for k=3,4,5,6.

READ FULL TEXT
research
02/10/2020

The random 2-SAT partition function

We show that throughout the satisfiable phase the normalised number of s...
research
02/01/2014

Performance of the Survey Propagation-guided decimation algorithm for the random NAE-K-SAT problem

We show that the Survey Propagation-guided decimation algorithm fails to...
research
06/27/2014

Set Constraint Model and Automated Encoding into SAT: Application to the Social Golfer Problem

On the one hand, Constraint Satisfaction Problems allow one to declarati...
research
03/05/2019

PDP: A General Neural Framework for Learning Constraint Satisfaction Solvers

There have been recent efforts for incorporating Graph Neural Network mo...
research
10/09/2011

Confidence-based Reasoning in Stochastic Constraint Programming

In this work we introduce a novel approach, based on sampling, for findi...
research
01/15/2014

Solving #SAT and Bayesian Inference with Backtracking Search

Inference in Bayes Nets (BAYES) is an important problem with numerous ap...
research
02/16/2021

On the sampling Lovász Local Lemma for atomic constraint satisfaction problems

We study the problem of sampling an approximately uniformly random satis...

Please sign up or login with your details

Forgot password? Click here to reset