Markov Chains on Orbits of Permutation Groups

08/09/2014
by   Mathias Niepert, et al.
0

We present a novel approach to detecting and utilizing symmetries in probabilistic graphical models with two main contributions. First, we present a scalable approach to computing generating sets of permutation groups representing the symmetries of graphical models. Second, we introduce orbital Markov chains, a novel family of Markov chains leveraging model symmetries to reduce mixing times. We establish an insightful connection between model symmetries and rapid mixing of orbital Markov chains. Thus, we present the first lifted MCMC algorithm for probabilistic graphical models. Both analytical and empirical results demonstrate the effectiveness and efficiency of the approach.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/29/2021

On some mixing properties of copula-based Markov chains

This paper brings some insights of ψ'-mixing, ψ^*-mixing and ψ-mixing fo...
research
10/29/2011

Bayesian Optimization for Adaptive MCMC

This paper proposes a new randomized strategy for adaptive MCMC using Ba...
research
01/14/2020

FunMC: A functional API for building Markov Chains

Constant-memory algorithms, also loosely called Markov chains, power the...
research
08/12/2021

Longitudinal network models and permutation-uniform Markov chains

We offer a general approach to modeling longitudinal network data, inclu...
research
06/18/2021

Systemic Infinitesimal Over-dispersion on General Stochastic Graphical Models

Stochastic models of interacting populations have crucial roles in scien...
research
02/17/2020

The Probabilistic Model Checker Storm

We present the probabilistic model checker Storm. Storm supports the ana...
research
06/14/2007

Getting started in probabilistic graphical models

Probabilistic graphical models (PGMs) have become a popular tool for com...

Please sign up or login with your details

Forgot password? Click here to reset