Efficient algorithms for Bayesian Nearest Neighbor Gaussian Processes

We consider alternate formulations of recently proposed hierarchical Nearest Neighbor Gaussian Process (NNGP) models (Datta et al., 2016a) for improved convergence, faster computing time, and more robust and reproducible Bayesian inference. Algorithms are defined that improve CPU memory management a...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:J Comput Graph Stat
Hlavní autoři: Finley, Andrew O., Datta, Abhirup, Cook, Bruce C., Morton, Douglas C., Andersen, Hans E., Banerjee, Sudipto
Médium: Artigo
Jazyk:Inglês
Vydáno: 2019
Témata:
Article
On-line přístup:https://ncbi.nlm.nih.gov/pmc/articles/PMC6753955/
https://ncbi.nlm.nih.gov/pubmed/31543693
https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1080/10618600.2018.1537924
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!

Podobné jednotky