Model counting with error-correcting codes

Achlioptas, Dimitris; Theodoropoulos, Panos

doi:10.1007/s10601-018-9296-3

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2019

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…one that cannot be completed to form a satisfying assignment) is made. Longer branching predicates, defined over multiple variables, have lower variance and are more eective both in theory and practice [1,2,14,18,19,36].…”

Section: Introductionmentioning

confidence: 99%

Streamlining variational inference for constraint satisfaction problems

Grover¹,

Achim²,

Ermon³

2019

J. Stat. Mech.

View full text Add to dashboard Cite

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% on average for k = 3, 4, 5, 6.

show abstract