Laddar...
A general construction for parallelizing Metropolis−Hastings algorithms
Markov chain Monte Carlo methods (MCMC) are essential tools for solving many modern-day statistical and computational problems; however, a major limitation is the inherently sequential nature of these algorithms. In this paper, we propose a natural generalization of the Metropolis−Hastings algorithm...
Sparad:
| I publikationen: | Proc Natl Acad Sci U S A |
|---|---|
| Huvudupphovsman: | |
| Materialtyp: | Artigo |
| Språk: | Inglês |
| Publicerad: |
National Academy of Sciences
2014
|
| Ämnen: | |
| Länkar: | https://ncbi.nlm.nih.gov/pmc/articles/PMC4267367/ https://ncbi.nlm.nih.gov/pubmed/25422442 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1073/pnas.1408184111 |
| Taggar: |
Lägg till en tagg
Inga taggar, Lägg till första taggen!
|