Partition Function Estimation: A Quantitative Study

05/24/2021
by   Durgesh Agrawal, et al.
0

Probabilistic graphical models have emerged as a powerful modeling tool for several real-world scenarios where one needs to reason under uncertainty. A graphical model's partition function is a central quantity of interest, and its computation is key to several probabilistic reasoning tasks. Given the #P-hardness of computing the partition function, several techniques have been proposed over the years with varying guarantees on the quality of estimates and their runtime behavior. This paper seeks to present a survey of 18 techniques and a rigorous empirical study of their behavior across an extensive set of benchmarks. Our empirical study draws up a surprising observation: exact techniques are as efficient as the approximate ones, and therefore, we conclude with an optimistic view of opportunities for the design of approximate techniques with enhanced scalability. Motivated by the observation of an order of magnitude difference between the Virtual Best Solver and the best performing tool, we envision an exciting line of research focused on the development of portfolio solvers.

READ FULL TEXT
research
03/14/2018

Bucket Renormalization for Approximate Inference

Probabilistic graphical models are a key tool in machine learning applic...
research
12/04/2020

Efficient semidefinite-programming-based inference for binary and multi-class MRFs

Probabilistic inference in pairwise Markov Random Fields (MRFs), i.e. co...
research
05/27/2019

Intervention in undirected Ising graphs and the partition function

Undirected graphical models have many applications in such areas as mach...
research
10/13/2018

Computing the partition function of the Sherrington-Kirkpatrick model is hard on average

We consider the algorithmic problem of computing the partition function ...
research
10/27/2020

Fast Stochastic Quadrature for Approximate Maximum-Likelihood Estimation

Recent stochastic quadrature techniques for undirected graphical models...
research
11/24/2015

Approximate Probabilistic Inference via Word-Level Counting

Hashing-based model counting has emerged as a promising approach for lar...

Please sign up or login with your details

Forgot password? Click here to reset