Home > Research > Publications & Outputs > Optimal metropolis algorithms for product measu...
View graph of relations

Optimal metropolis algorithms for product measures on the vertices of a hypercube.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published

Standard

Optimal metropolis algorithms for product measures on the vertices of a hypercube. / Roberts, G. O.
In: Stochastics, Vol. 62, No. 3 & 4, 1997, p. 275-284.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Harvard

APA

Vancouver

Roberts GO. Optimal metropolis algorithms for product measures on the vertices of a hypercube. Stochastics. 1997;62(3 & 4):275-284. doi: 10.1080/17442509808834136

Author

Roberts, G. O. / Optimal metropolis algorithms for product measures on the vertices of a hypercube. In: Stochastics. 1997 ; Vol. 62, No. 3 & 4. pp. 275-284.

Bibtex

@article{3d766cee6c7347c28aa0647cb2123e75,
title = "Optimal metropolis algorithms for product measures on the vertices of a hypercube.",
abstract = "Optimal scaling problems for high dimensional Metropolis-Hastings algorithms can often be solved by means of diffusion approximation results. These solutions are particularly appealing since they can often be characterised in terms of a simple, observable property of the Markov chain sample path, namely the overall proportion of accepted iterations for the chain. For discrete state space problems, analogous scaling problems can be defined, though due to discrete effects, a simple characterisation of the asymptotically optimal solution is not available. This paper considers the simplest possible (and most discrete) example of such a problem, demonstrating that, at least for sufficiently 'smooth' distributions in high dimensional problems,the Metropolis algorithm behaves similarly to its counterpart on the continuous state space",
keywords = "Metropolis-Hastings algorithm, scaling problem, weak convergence, Mathematics Subject Classification 1991, Primary, 60F05, Secondary, 65U05",
author = "Roberts, {G. O.}",
year = "1997",
doi = "10.1080/17442509808834136",
language = "English",
volume = "62",
pages = "275--284",
journal = "Stochastics",
issn = "1744-2516",
publisher = "Gordon and Breach Science Publishers",
number = "3 & 4",

}

RIS

TY - JOUR

T1 - Optimal metropolis algorithms for product measures on the vertices of a hypercube.

AU - Roberts, G. O.

PY - 1997

Y1 - 1997

N2 - Optimal scaling problems for high dimensional Metropolis-Hastings algorithms can often be solved by means of diffusion approximation results. These solutions are particularly appealing since they can often be characterised in terms of a simple, observable property of the Markov chain sample path, namely the overall proportion of accepted iterations for the chain. For discrete state space problems, analogous scaling problems can be defined, though due to discrete effects, a simple characterisation of the asymptotically optimal solution is not available. This paper considers the simplest possible (and most discrete) example of such a problem, demonstrating that, at least for sufficiently 'smooth' distributions in high dimensional problems,the Metropolis algorithm behaves similarly to its counterpart on the continuous state space

AB - Optimal scaling problems for high dimensional Metropolis-Hastings algorithms can often be solved by means of diffusion approximation results. These solutions are particularly appealing since they can often be characterised in terms of a simple, observable property of the Markov chain sample path, namely the overall proportion of accepted iterations for the chain. For discrete state space problems, analogous scaling problems can be defined, though due to discrete effects, a simple characterisation of the asymptotically optimal solution is not available. This paper considers the simplest possible (and most discrete) example of such a problem, demonstrating that, at least for sufficiently 'smooth' distributions in high dimensional problems,the Metropolis algorithm behaves similarly to its counterpart on the continuous state space

KW - Metropolis-Hastings algorithm

KW - scaling problem

KW - weak convergence

KW - Mathematics Subject Classification 1991

KW - Primary

KW - 60F05

KW - Secondary

KW - 65U05

U2 - 10.1080/17442509808834136

DO - 10.1080/17442509808834136

M3 - Journal article

VL - 62

SP - 275

EP - 284

JO - Stochastics

JF - Stochastics

SN - 1744-2516

IS - 3 & 4

ER -