The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Efficient implementation of Markov chain Monte Carlo when using an unbiased likelihood estimator
Open accessAbstract
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 the averages computed under this chain. Using many Monte Carlo samples will typically result in Metropolis–Hastings averages with lower asymptotic variances than the corresponding averages that use fewer samples; however, the computing time required to construct the likelihood estimator increases with the number of samples. Under the assumption that the distribution of the additive noise introduced by the loglikelihood estimator is Gaussian with variance inversely proportional to the number of samples and independent of the parameter value at which it is evaluated, we provide guidelines on the number of samples to select. We illustrate our results by considering a stochastic volatility model applied to stock index returns.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Rudin, W. (1973) · Cited by 13,740
Markov Chains for Exploring Posterior Distributions
Tierney, L. (1994) · The Annals of Statistics · doi:10.1214/aos/1176325750 · Cited by 3,452
Practical markov chain monte carlo
Geyer, C. J. (1992) · Statistical Science · doi:10.1214/ss/1177011137 · Cited by 2,045
Particle Markov Chain Monte Carlo Methods
Andrieu, C., Doucet, A., & Holenstein, R. (2010) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2009.00736.x · Cited by 1,971
Self-citationAlternative models for stock price dynamics
Chernov, M., Ronald Gallant, A., Ghysels, E., & Tauchen, G. (2003) · Journal of Econometrics · doi:10.1016/s0304-4076(03)00108-8 · Cited by 889
The Relative Contribution of Jumps to Total Price Variance
Huang, X. (2005) · Journal of Financial Econometrics · doi:10.1093/jjfinec/nbi025 · Cited by 888
Kipnis, C., & Varadhan, S. R. S. (1986) · Communications in Mathematical Physics · doi:10.1007/bf01210789 · Cited by 802
Unbounded Self-adjoint Operators on Hilbert Space
Schmüdgen, K. (2012) · Graduate Texts in Mathematics · doi:10.1007/978-94-007-4753-1 · Cited by 750
The pseudo-marginal approach for efficient Monte Carlo computations
Andrieu, C., & Roberts, G. O. (2009) · The Annals of Statistics · doi:10.1214/07-aos574 · Cited by 687
Optimum Monte-Carlo sampling using Markov chains
PESKUN, P. H. (1973) · Biometrika · doi:10.1093/biomet/60.3.607 · Cited by 531
Roberts, G. (1996) · Biometrika · doi:10.1093/biomet/83.1.95 · Cited by 417
Estimation of Population Growth or Decline in Genetically Monitored Populations
Beaumont, M. A. (2003) · Genetics · doi:10.1093/genetics/164.3.1139 · Cited by 405
A note on Metropolis-Hastings kernels for general state spaces
Tierney, L. (1998) · The Annals of Applied Probability · doi:10.1214/aoap/1027961031 · Cited by 338
On some properties of Markov chain Monte Carlo simulation methods based on the particle filter
Pitt, M. K., Silva, R. D. S., Giordani, P., & Kohn, R. (2012) · Journal of Econometrics · doi:10.1016/j.jeconom.2012.06.004 · Cited by 265
Self-citationRenewal theory and computable convergence rates for geometrically ergodic Markov chains
Baxendale, P. H. (2005) · The Annals of Applied Probability · doi:10.1214/105051604000000710 · Cited by 181
On the efficiency of pseudo-marginal random walk Metropolis algorithms
Sherlock, C., Thiery, A. H., Roberts, G. O., & Rosenthal, J. S. (2015) · The Annals of Statistics · doi:10.1214/14-aos1278 · Cited by 158
Variance Bounding Markov Chains
Roberts, G. O., & Rosenthal, J. S. (2006) · Cited by 64
On Variance Conditions for Markov Chain CLTs
Häggström, O., & Rosenthal, J. S. (2007) · Electronic Communications in Probability · doi:10.1214/ecp.v12-1336 · Cited by 36
Metadata
- Authors
- Doucet, A., Pitt, M. K., Deligiannidis, G., & Kohn, R.
- Venue
- Biometrika
- Publisher
- Oxford University Press (OUP)
- Published
- 2015-03-07
- Volume
- 102
- Issue
- 2
- Pages
- 295-313
- ISSN
- 0006-3444 (ISSN-L)
- 1464-3510
- OpenAlex
- W2123726866
- Cited by
- 265
- References
- 18
- FWCI
- 31.83
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.