The University of Southampton
University of Southampton Institutional Repository

On Markov chain Monte Carlo acceleration

On Markov chain Monte Carlo acceleration
On Markov chain Monte Carlo acceleration
Markov chain Monte Carlo (MCMC) methods are currently enjoying a surge of interest within the statistical community. The goal of this work is to formalize and support two distinct adaptive strategies which typically accelerate the convergence of a MCMC algorithm. One approach is through resampling; the other incorporates adaptive switching of the transition kernel. Support is both by analytic arguments and simulation study. Application is envisioned in low dimensional but non-trivial problems. Two pathological illustrations are presented. Connections with reparametrization are discussed as well as possible difficulties with infinitely often adaptation
statistics and probability, Monte Carlo Method, Markov processes, algotiyhms, simulation, probability, density functions, convergence, adaptation, switching, transitions, kernel fucntions, strategy, numerical analysis, MCMC (Markov Chain Monte Carlo), Gibbs sampler
1061-8600
261-276
Gelfand, Alan E.
1dc59cf1-5e5f-4001-b1f9-92b0a8e2f64f
Sahu, Sujit K.
33f1386d-6d73-4b60-a796-d626721f72bf
Gelfand, Alan E.
1dc59cf1-5e5f-4001-b1f9-92b0a8e2f64f
Sahu, Sujit K.
33f1386d-6d73-4b60-a796-d626721f72bf

Gelfand, Alan E. and Sahu, Sujit K. (1994) On Markov chain Monte Carlo acceleration. Journal of Computational and Graphical Statistics, 3 (3), 261-276.

Record type: Article

Abstract

Markov chain Monte Carlo (MCMC) methods are currently enjoying a surge of interest within the statistical community. The goal of this work is to formalize and support two distinct adaptive strategies which typically accelerate the convergence of a MCMC algorithm. One approach is through resampling; the other incorporates adaptive switching of the transition kernel. Support is both by analytic arguments and simulation study. Application is envisioned in low dimensional but non-trivial problems. Two pathological illustrations are presented. Connections with reparametrization are discussed as well as possible difficulties with infinitely often adaptation

This record has no associated files available for download.

More information

Published date: September 1994
Keywords: statistics and probability, Monte Carlo Method, Markov processes, algotiyhms, simulation, probability, density functions, convergence, adaptation, switching, transitions, kernel fucntions, strategy, numerical analysis, MCMC (Markov Chain Monte Carlo), Gibbs sampler
Organisations: Statistics

Identifiers

Local EPrints ID: 54072
URI: http://eprints.soton.ac.uk/id/eprint/54072
ISSN: 1061-8600
PURE UUID: d6c426ab-c555-4420-bc39-329ab6b9535e
ORCID for Sujit K. Sahu: ORCID iD orcid.org/0000-0003-2315-3598

Catalogue record

Date deposited: 05 Aug 2008
Last modified: 12 Dec 2021 03:11

Export record

Contributors

Author: Alan E. Gelfand
Author: Sujit K. Sahu ORCID iD

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×