Name
Abstract | ||
|---|---|---|
Gibbs sampling is a Markov chain Monte Carlo technique commonly used for estimating marginal distributions. To speed up Gibbs sampling, there has recently been interest in parallelizing it by executing asynchronously. While empirical results suggest that many models can be efficiently sampled asynchronously, traditional Markov chain analysis does not apply to the asynchronous case, and thus asynchronous Gibbs sampling is poorly understood. In this paper, we derive a better understanding of the two main challenges of asynchronous Gibbs: bias and mixing time. We show experimentally that our theoretical results match practical outcomes. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.24963/ijcai.2017/672 | IJCAI |
DocType | Volume | ISSN |
Conference | 48 | 1938-7288 |
Citations | PageRank | References |
6 | 0.55 | 14 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Christopher De Sa | 1 | 6 | 0.55 |
| Kunle Olukotun | 2 | 4532 | 373.50 |
| Ré Christopher | 3 | 3422 | 192.34 |