Parallel Markov Chain Monte Carlo
Duration: 35 mins 10 secs
Share this media item:
Embed this media item:
Embed this media item:
About this item
| Description: |
Schmidler, S (Duke University)
Thursday 24 April 2014, 14:55-15:30 |
|---|
| Created: | 2014-04-28 17:27 |
|---|---|
| Collection: | Advanced Monte Carlo Methods for Complex Inference Problems |
| Publisher: | Isaac Newton Institute |
| Copyright: | Schmidler, S |
| Language: | eng (English) |
| Abstract: | Co-author: Doug VanDerwerken (Duke University)
Markov chain Monte Carlo is an inherently serial algorithm. Although the likelihood calculations for individual steps can sometimes be parallelized, the serial evolution of the process is widely viewed as incompatible with parallization, offering no speedup for sampling algorithms which require large numbers of iterations to converge to equilibrium. We provide a methodology for parallelizing Markov chain Monte Carlo across large numbers of independent, asynchronous processors. The method is originally motivated by sampling multimodal target distributions, where we see an exponential speed-up in running time. However we show that the approach is general purpose and applicable to all Markov chain Monte Carlo simulations, and demonstrate speed-ups proportional to the number of available processors on slowly mixing chains with unimodal target distributions. The approach is simple and easy to implement, and suggests additional directions for further research. |
|---|---|
Available Formats
| Format | Quality | Bitrate | Size | |||
|---|---|---|---|---|---|---|
| MPEG-4 Video | 640x360 | 1.94 Mbits/sec | 512.09 MB | View | Download | |
| WebM | 640x360 | 529.0 kbits/sec | 136.32 MB | View | Download | |
| iPod Video | 480x270 | 522.06 kbits/sec | 134.47 MB | View | Download | |
| MP3 | 44100 Hz | 249.79 kbits/sec | 64.40 MB | Listen | Download | |
| Auto * | (Allows browser to choose a format it supports) | |||||