arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1707.09467cs.LO
收藏

具有短异或的概率模型计数

Probabilistic Model Counting with Short XORs

Dimitris Achlioptas, Panos Theodoropoulos

摘要:

通过添加随机奇偶约束来计算公式的满足真值分配(模型)的数量的想法可以追溯到Valiant和Vazirani的开创性工作,表明NP和检测唯一解一样容易。虽然理论上是合理的,但这种构造中的随机奇偶约束有以下缺点:平均而言,每个约束涉及所有变量的一半。因此,与搜索同样满足奇偶约束的模型相关的分支因子很快就会失控。在这项工作中,我们证明,可以与更短的奇偶校验约束,仍然得到严格的数学保证,特别是当模型的数量很大,使许多约束需要添加。我们的工作是基于实现的奇偶约束随机系统的基本特征是有用的概率模型计数的几何形状的解决方案类似于一个纠错码。

英文摘要:

The idea of counting the number of satisfying truth assignments (models) of a formula by adding random parity constraints can be traced back to the seminal work of Valiant and Vazirani, showing that NP is as easy as detecting unique solutions. While theoretically sound, the random parity constraints in that construction have the following drawback: each constraint, on average, involves half of all variables. As a result, the branching factor associated with searching for models that also satisfy the parity constraints quickly gets out of hand. In this work we prove that one can work with much shorter parity constraints and still get rigorous mathematical guarantees, especially when the number of models is large so that many constraints need to be added. Our work is based on the realization that the essential feature for random systems of parity constraints to be useful in probabilistic model counting is that the geometry of their set of solutions resembles an error-correcting code.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑