UC BERKELEY
EECS technical reports
TECHNICAL REPORTS


EECS-2016-39.pdf
Conditions of Use

Archive Home Page

Fast Parallel SAME Gibbs Sampling on General Discrete Bayesian Networks and Factor Graphs

Authors:
Chen, Haoyu
Canny, John F.
Technical Report Identifier: EECS-2016-39
May 3, 2016
EECS-2016-39.pdf

Abstract: A fundamental task in machine learning and related fields is to perform inference on probabilistic graphical models. Since exact inference takes exponential time in general, a variety of approximate methods are used. Gibbs sampling is one of the most accurate approaches and provides unbiased samples from the posterior but it has historically been too expensive for large models. In this paper, we present an optimized, parallel Gibbs sampler augmented with state replication (SAME or State Augmented Marginal Estimation) to decrease convergence time. We find that SAME can improve the quality of parameter estimates while accelerating convergence. Experiments on both synthetic and real data show that our Gibbs sampler is substantially faster than the state of the art sampler, JAGS, without sacrificing accuracy. Our ultimate objective is to introduce the Gibbs sampler to researchers in many fields to expand their range of feasible inference problems.