Block-Value Symmetries in Probabilistic Graphical Models

07/02/2018
by   Gagan Madan, et al.
0

Several lifted inference algorithms for probabilistic graphical models first merge symmetric states into a single cluster (orbit) and then use these for downstream inference, via variations of orbital MCMC [Niepert, 2012]. These orbits are represented compactly using permutations over variables, and variable-value (VV) pairs, but these can miss several state symmetries in a domain. We define the notion of permutations over block-value (BV) pairs, where a block is a set of variables. BV strictly generalizes VV symmetries, and can compute many more symmetries for increasing block sizes. To operationalize use of BV permutations in lifted inference, we describe 1) an algorithm to compute BV permutations given a block partition of the variables, 2) BV-MCMC, an extension of orbital MCMC that can sample from BV orbits, and 3) a heuristic to suggest good block partitions. Our experiments show that BV-MCMC can mix much faster compared to vanilla MCMC and orbital MCMC over VV permutations.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/30/2016

Contextual Symmetries in Probabilistic Graphical Models

An important approach for efficient inference in probabilistic graphical...
research
07/27/2017

Non-Count Symmetries in Boolean & Multi-Valued Prob. Graphical Models

Lifted inference algorithms commonly exploit symmetries in a probabilist...
research
04/20/2015

Partition MCMC for inference on acyclic digraphs

Acyclic digraphs are the underlying representation of Bayesian networks,...
research
12/01/2014

Lifted Probabilistic Inference for Asymmetric Graphical Models

Lifted probabilistic inference algorithms have been successfully applied...
research
07/20/2020

Automating Involutive MCMC using Probabilistic and Differentiable Programming

Involutive MCMC is a unifying mathematical construction for MCMC kernels...
research
02/25/2022

Incremental Inference on Higher-Order Probabilistic Graphical Models Applied to Constraint Satisfaction Problems

Probabilistic graphical models (PGMs) are tools for solving complex prob...
research
11/14/2022

The Best Path Algorithm automatic variables selection via High Dimensional Graphical Models

This paper proposes a new algorithm for an automatic variable selection ...

Please sign up or login with your details

Forgot password? Click here to reset