Parallel markov chain Monte Carlo
Guardado en:
| Udgivet i: | ProQuest Dissertations and Theses (2011) |
|---|---|
| Hovedforfatter: | |
| Udgivet: |
ProQuest Dissertations & Theses
|
| Fag: | |
| Online adgang: | Citation/Abstract Full Text - PDF |
| Tags: |
Ingen Tags, Vær først til at tagge denne postø!
|
MARC
| LEADER | 00000nab a2200000uu 4500 | ||
|---|---|---|---|
| 001 | 1464355317 | ||
| 003 | UK-CbPIL | ||
| 020 | |a 978-1-303-55207-6 | ||
| 035 | |a 1464355317 | ||
| 045 | 0 | |b d20110101 | |
| 084 | |a 66569 |2 nlm | ||
| 100 | 1 | |a Tibbits, Matthew M. | |
| 245 | 1 | |a Parallel markov chain Monte Carlo | |
| 260 | |b ProQuest Dissertations & Theses |c 2011 | ||
| 513 | |a Dissertation/Thesis | ||
| 520 | 3 | |a Markov chain Monte Carlo (MCMC) sampling has garnered wide acceptance as a very general approach for approximating integrals (expectations) with respect to a wide range of distributions. As the complexity of statistical models has increased and datasets have grown in size, it is critical to design computationally efficient MCMC sampling algorithms. Further, as MCMC algorithms are, by design, serial in nature, the efficient use of modern, parallel computing hardware is non-trivial. It is also important to develop 'off-the-shelf' or automated MCMC algorithms that require minimal user intervention to allow a more general user access to these methods without extensive knowledge of the optimal tuning parameters for either the MCMC algorithm or its implementation within a parallelized environment. These driving forces necessitate the development of efficient MCMC sampling techniques which can be decomposed and distributed across parallel architectures irrespective of the statistical model in question. Methods for parallelizing MCMC algorithms tend to focus on either parallelizing the evolution of a single Markov chain, or when these computations are not easily decomposed, employ multiple chains in a cooperative fashion. In this dissertation, we investigate three parallel sampling approaches. The first is an extension to the parallel multivariate slice sampler where sampling occurs in a transformed space to simultaneously reduce posterior autocorrelation in successive draws and facilitate an automated tuning procedure. The second approach is a parallelized single-chain Langevin-Hastings sampler where the gradient vector and Hessian matrix are simultaneously approximated when analytically intractable. The third approach is a parallelized multi-chain method of constructing an efficient interpolator for an expensive likelihood computation which can then be efficiently sampled using a single chain. These parallel samplers are then compared on the bases of sampling and computational efficiency within the context of several examples including linear and generalized-linear spatial models. | |
| 653 | |a Statistics | ||
| 653 | |a Computer science | ||
| 773 | 0 | |t ProQuest Dissertations and Theses |g (2011) | |
| 786 | 0 | |d ProQuest |t ProQuest Dissertations & Theses Global | |
| 856 | 4 | 1 | |3 Citation/Abstract |u https://www.proquest.com/docview/1464355317/abstract/embedded/7BTGNMKEMPT1V9Z2?source=fedsrch |
| 856 | 4 | 0 | |3 Full Text - PDF |u https://www.proquest.com/docview/1464355317/fulltextPDF/embedded/7BTGNMKEMPT1V9Z2?source=fedsrch |