Dissociation-Based Oblivious Bounds for Weighted Model Counting

We consider the weighted model counting task which includes important tasks in graphical models, such as computing the partition function and probability of evidence as special cases. We propose a novel partition-based bounding algorithm that exploits logical structure and gives rise to a set of inequalities from which upper (or lower) bounds can be derived efficiently. The bounds come with optimality guarantees under certain conditions and are oblivious in that they require only limited observations of the structure and parameters of the problem. We experimentally compare our bounds with the mini-bucket scheme (which is also oblivious) and show that our new bounds are often superior and never worse on a wide variety of benchmark networks.

[1]  Nir Friedman,et al.  Probabilistic Graphical Models - Principles and Techniques , 2009 .

[2]  Vibhav Gogate,et al.  Approximate Counting by Sampling the Backtrack-free Search Space , 2007, AAAI.

[3]  Vibhav Gogate,et al.  SampleSearch: Importance sampling in presence of determinism , 2011, Artif. Intell..

[4]  Floris Geerts,et al.  A General Framework for Anytime Approximation in Probabilistic Databases , 2018, ArXiv.

[5]  Pedro M. Domingos,et al.  Formula-Based Probabilistic Inference , 2010, UAI.

[6]  Qiang Liu,et al.  Reasoning and Decisions in Probabilistic Graphical Models - A Unified Framework , 2014 .

[7]  Adnan Darwiche,et al.  Relax then compensate: on max-product belief propagation and more , 2009, NIPS 2009.

[8]  Wei Ping,et al.  Decomposition Bounds for Marginal MAP , 2015, NIPS.

[9]  Rina Dechter,et al.  Bucket elimination: A unifying framework for probabilistic inference , 1996, UAI.

[10]  Adnan Darwiche,et al.  On probabilistic inference by weighted model counting , 2008, Artif. Intell..

[11]  Qiang Liu,et al.  Bounding the Partition Function using Holder's Inequality , 2011, ICML.

[12]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[13]  Rina Dechter,et al.  Beyond Static Mini-Bucket: Towards Integrating with Iterative Cost-Shifting Based Dynamic Heuristics , 2014, SOCS.

[14]  Dan Suciu,et al.  Dissociation and propagation for approximate lifted inference with standard relational database management systems , 2013, The VLDB Journal.

[15]  Bart Selman,et al.  Embed and Project: Discrete Sampling with Universal Hashing , 2013, NIPS.

[16]  Adnan Darwiche,et al.  Node Splitting: A Scheme for Generating Upper Bounds in Bayesian Networks , 2007, UAI.

[17]  Nevin L. Zhang,et al.  A simple approach to Bayesian network computations , 1994 .

[18]  Sharad Malik,et al.  The Quest for Efficient Boolean Satisfiability Solvers , 2002, CAV.

[19]  Rina Dechter,et al.  Mini-buckets: A general scheme for bounded inference , 2003, JACM.

[20]  Dan Suciu,et al.  Oblivious bounds on the probability of boolean functions , 2014, ACM Trans. Database Syst..

[21]  Pedro M. Domingos,et al.  Structured Message Passing , 2013, UAI.

[22]  Lars Otten,et al.  Join-graph based cost-shifting schemes , 2012, UAI.

[23]  Henry A. Kautz,et al.  Performing Bayesian Inference by Weighted Model Counting , 2005, AAAI.

[24]  Pedro M. Domingos,et al.  Probabilistic theorem proving , 2011, UAI.

[25]  Pedro M. Domingos,et al.  Approximation by Quantization , 2011, UAI.