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...
Asıl Yazarlar: | Belloni, Alexandre, Chernozhukov, Victor V. |
---|---|
Diğer Yazarlar: | Massachusetts Institute of Technology. Department of Economics |
Materyal Türü: | Makale |
Dil: | en_US |
Baskı/Yayın Bilgisi: |
Institute of Mathematical Statistics
2013
|
Online Erişim: | http://hdl.handle.net/1721.1/81193 https://orcid.org/0000-0002-3250-6714 |
Benzer Materyaller
-
On the computational complexity of MCMC-based estimators in large samples
Yazar:: Belloni, Alexandre, ve diğerleri
Baskı/Yayın Bilgisi: (2011) -
An MCMC approach to classical estimation
Yazar:: Chernozhukov, Victor, ve diğerleri
Baskı/Yayın Bilgisi: (2011) -
Post-[script l]\2081-penalized estimators in high-dimensional linear regression models
Yazar:: Belloni, Alexandre, ve diğerleri
Baskı/Yayın Bilgisi: (2011) -
Pivotal estimation via square-root Lasso in nonparametric regression
Yazar:: Belloni, Alexandre, ve diğerleri
Baskı/Yayın Bilgisi: (2015) -
Fast MCMC sampling for Markov jump processes and extensions
Yazar:: Rao, V, ve diğerleri
Baskı/Yayın Bilgisi: (2013)