Monitoring and Improving Markov Chain Monte Carlo Convergence by Partitioning

Loading...
Thumbnail Image

Date

2015

Authors

VanDerwerken, Douglas

Advisors

Schmidler, Scott C

Journal Title

Journal ISSN

Volume Title

Repository Usage Stats

484
views
594
downloads

Abstract

Since Bayes' Theorem was first published in 1762, many have argued for the Bayesian paradigm on purely philosophical grounds. For much of this time, however, practical implementation of Bayesian methods was limited to a relatively small class of "conjugate" or otherwise computationally tractable problems. With the development of Markov chain Monte Carlo (MCMC) and improvements in computers over the last few decades, the number of problems amenable to Bayesian analysis has increased dramatically. The ensuing spread of Bayesian modeling has led to new computational challenges as models become more complex and higher-dimensional, and both parameter sets and data sets become orders of magnitude larger. This dissertation introduces methodological improvements to deal with these challenges. These include methods for enhanced convergence assessment, for parallelization of MCMC, for estimation of the convergence rate, and for estimation of normalizing constants. A recurring theme across these methods is the utilization of one or more chain-dependent partitions of the state space.

Description

Provenance

Citation

Citation

VanDerwerken, Douglas (2015). Monitoring and Improving Markov Chain Monte Carlo Convergence by Partitioning. Dissertation, Duke University. Retrieved from https://hdl.handle.net/10161/9876.

Collections


Dukes student scholarship is made available to the public using a Creative Commons Attribution / Non-commercial / No derivative (CC-BY-NC-ND) license.