adaptive.metropolis.sample: Adaptive Metropolis

Description Usage Arguments Details Value References See Also


Generate a sample from a probability distribution with the Adaptive Metropolis algorithm


adaptive.metropolis.sample(target.dist, x0, sample.size,
                           tuning=0.1, beta=0.05,



Target distribution; see make.dist.


Numeric vector containing initial state.


Requested sample size.


Standard deviation of first component of proposal distribution


Weight of first component of proposal distribution

Stop adaptation after this fraction of the chain. Set this to 1.0 to obtain the behavior described by Roberts and Rosenthal (2009).


This function implements the Adaptive Metropolis algorithm as described by Roberts and Rosenthal (2009). Proposals are a mixture of a spherical Gaussian with standard deviation equal to tuning/sqrt(target.dist$ndim) (with weight beta) and a Gaussian with covariance equal to the sample covariance of the already-computed observations scaled by 2.38^2/target.dist$ndim (with weight 1-beta). The resulting Markov chain is not strictly stationary with the target distribution for the burn-in period of the chain, but is ergodic.


A list containing the elements X, evals, reject.rate, and sample.cov. This sampler follows the calling convention of compare.samplers. reject.rate contains the fraction of proposals that were rejected. sample.cov is the most recent sample covariance used to update the proposal distribution.


Roberts, G. O. and Rosenthal, J. S. (2009), “Examples of Adaptive MCMC,” Journal of Computational and Graphical Statistics 18(2):349-367.

See Also

compare.samplers, multivariate.metropolis.sample

Search within the SamplerCompare package
Search all R packages, documentation and source code

Questions? Problems? Suggestions? or email at

Please suggest features or report bugs with the GitHub issue tracker.

All documentation is copyright its authors; we didn't write any of that.