English

Efficient implementation of Markov chain Monte Carlo when using an unbiased likelihood estimator

Methodology 2014-09-16 v4

Abstract

When an unbiased estimator of the likelihood is used within a Metropolis--Hastings chain, it is necessary to trade off the number of Monte Carlo samples used to construct this estimator against the asymptotic variances of averages computed under this chain. Many Monte Carlo samples will typically result in Metropolis--Hastings averages with lower asymptotic variances than the corresponding Metropolis--Hastings averages using fewer samples. However, the computing time required to construct the likelihood estimator increases with the number of Monte Carlo samples. Under the assumption that the distribution of the additive noise introduced by the log-likelihood estimator is Gaussian with variance inversely proportional to the number of Monte Carlo samples and independent of the parameter value at which it is evaluated, we provide guidelines on the number of samples to select. We demonstrate our results by considering a stochastic volatility model applied to stock index returns.

Keywords

Cite

@article{arxiv.1210.1871,
  title  = {Efficient implementation of Markov chain Monte Carlo when using an unbiased likelihood estimator},
  author = {Arnaud Doucet and Michael Pitt and George Deligiannidis and Robert Kohn},
  journal= {arXiv preprint arXiv:1210.1871},
  year   = {2014}
}

Comments

34 pages, 9 figures, 3 tables

R2 v1 2026-06-21T22:17:12.674Z