HOGWILD!-Gibbs can be PanAccurate

11/26/2018
by   Constantinos Daskalakis, et al.
0

Asynchronous Gibbs sampling has been recently shown to be fast-mixing and an accurate method for estimating probabilities of events on a small number of variables of a graphical model satisfying Dobrushin's condition DeSaOR16. We investigate whether it can be used to accurately estimate expectations of functions of all the variables of the model. Under the same condition, we show that the synchronous (sequential) and asynchronous Gibbs samplers can be coupled so that the expected Hamming distance between their (multivariate) samples remains bounded by O(τ n), where n is the number of variables in the graphical model, and τ is a measure of the asynchronicity. A similar bound holds for any constant power of the Hamming distance. Hence, the expectation of any function that is Lipschitz with respect to a power of the Hamming distance, can be estimated with a bias that grows logarithmically in n. Going beyond Lipschitz functions, we consider the bias arising from asynchronicity in estimating the expectation of polynomial functions of all variables in the model. Using recent concentration of measure results, we show that the bias introduced by the asynchronicity is of smaller order than the standard deviation of the function value already present in the true model. We perform experiments on a multi-processor machine to empirically illustrate our theoretical findings.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/16/2019

On q-ary Bent and Plateaued Functions

We obtain the following results. For any prime q the minimal Hamming dis...
research
10/03/2019

A Fast Exponential Time Algorithm for Max Hamming Distance X3SAT

X3SAT is the problem of whether one can satisfy a given set of clauses w...
research
11/21/2016

Probabilistic Duality for Parallel Gibbs Sampling without Graph Coloring

We present a new notion of probabilistic duality for random variables in...
research
08/23/2018

TAP free energy, spin glasses, and variational inference

We consider the Sherrington-Kirkpatrick model of spin glasses with ferro...
research
07/19/2018

Approximate Collapsed Gibbs Clustering with Expectation Propagation

We develop a framework for approximating collapsed Gibbs sampling in gen...
research
03/07/2017

Global optimization of Lipschitz functions

The goal of the paper is to design sequential strategies which lead to e...
research
04/01/2019

Fully-Asynchronous Distributed Metropolis Sampler with Optimal Speedup

The Metropolis-Hastings algorithm is a fundamental Markov chain Monte Ca...

Please sign up or login with your details

Forgot password? Click here to reset