On the computational complexity of MCMC-based estimators in large samples
In this paper we examine the implications of the statistical large sample theory for the computational complexity of Bayesian and quasi-Bayesian estimation carried out using Metropolis random walks. Our analysis is motivated by the Laplace-Bernstein-Von Mises central limit theorem, which states that in large samples the posterior or quasi-posterior approaches a normal density. Using this observation, we establish polynomial bounds on the computational complexity of general Metropolis random walks methods in large samples. Our analysis covers cases, where the underlying log-likelihood or extremum criterion function is possibly nonconcave, discontinuous, and of increasing dimension. However, the central limit theorem restricts the deviations from continuity and log-concavity of the log-likelihood or extremum criterion function in a very specific manner.
|Date of creation:||29 May 2007|
|Date of revision:|
|Contact details of provider:|| Postal: The Institute for Fiscal Studies 7 Ridgmount Street LONDON WC1E 7AE|
Phone: (+44) 020 7291 4800
Fax: (+44) 020 7323 4780
Web page: http://cemmap.ifs.org.uk
More information through EDIRC
|Order Information:|| Postal: The Institute for Fiscal Studies 7 Ridgmount Street LONDON WC1E 7AE|
When requesting a correction, please mention this item's handle: RePEc:ifs:cemmap:12/07. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Emma Hyman)
If references are entirely missing, you can add them using this form.