Shepherding Distributions for parallel Markov Chain Monte Carlo

Simple item page
dc.contributor.advisorJermaine, Christopher M.en_US
dc.creatorChowdhury, Arkabandhuen_US
dc.date.accessioned2017-08-01T15:23:37Zen_US
dc.date.available2017-08-01T15:23:37Zen_US
dc.date.created2017-05en_US
dc.date.issued2017-04-07en_US
dc.date.submittedMay 2017en_US
dc.date.updated2017-08-01T15:23:37Zen_US
dc.description.abstractOne of the major concerns for Markov Chain Monte Carlo (MCMC) algorithms is that they can take a long time to converge to the desired stationary distribution. In practice, MCMC algorithms may take to millions of iterations to converge to the target distribution, requiring a wall clock time measured in months. This thesis presents a general algorithmic framework for running MCMC algorithms in a parallel/distributed environment, that can result in faster burn-in leading to convergence to the target distribution. Our framework, which we call the method of "shepherding distributions", relies on the introduction of an auxiliary distribution called a shepherding distribution (SD) that uses several MCMC chains running in parallel. These chains collectively explore the space of samples, communicating via the shepherding distribution, to reach high likelihood regions faster. We consider various scenarios where shepherding distributions can be used, including the case where several machines or CPU cores work on the same data in parallel (the so-called transition parallel application of the framework) and the case where a large data set itself can be partitioned across several machines or CPU cores and various chains work on subsets of the data (the so-called data parallel application of the framework). This latter application is particularly useful in solving "big data" Machine Learning problems. Experiments under both scenarios illustrate the effectiveness of our shepherding approach to MCMC parallelization.en_US
dc.format.mimetypeapplication/pdfen_US
dc.identifier.citationChowdhury, Arkabandhu. "Shepherding Distributions for parallel Markov Chain Monte Carlo." (2017) Master’s Thesis, Rice University. <a href="https://hdl.handle.net/1911/95965">https://hdl.handle.net/1911/95965</a>.en_US
dc.identifier.urihttps://hdl.handle.net/1911/95965en_US
dc.language.isoengen_US
dc.rightsCopyright is held by the author, unless otherwise indicated. Permission to reuse, publish, or reproduce the work beyond the bounds of fair use or other exemptions to copyright law must be obtained from the copyright holder.en_US
dc.subjectMarkov Chain Monte Carloen_US
dc.subjectShepherdingen_US
dc.subjectParallel MCMCen_US
dc.subjectBurn-inen_US
dc.subjectBayesianen_US
dc.subjectLikelihooden_US
dc.titleShepherding Distributions for parallel Markov Chain Monte Carloen_US
dc.typeThesisen_US
dc.type.materialTexten_US
thesis.degree.departmentComputer Scienceen_US
thesis.degree.disciplineEngineeringen_US
thesis.degree.grantorRice Universityen_US
thesis.degree.levelMastersen_US
thesis.degree.nameMaster of Scienceen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
CHOWDHURY-DOCUMENT-2017.pdf
Size:
1.59 MB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 2 of 2
No Thumbnail Available
Name:
PROQUEST_LICENSE.txt
Size:
5.85 KB
Format:
Plain Text
Description:
Download
No Thumbnail Available
Name:
LICENSE.txt
Size:
2.61 KB
Format:
Plain Text
Description:
Download
Collections
Rice University Theses and Dissertations