An Approximate MCMC Method for Convex Hulls
Markov chain Monte Carlo (MCMC) is an extremely popular class of algorithms for computing summaries of posterior distributions. One problem for MCMC in the so-called Big Data regime is the growing computational cost of most MCMC algorithms. Most popular and basic MCMC algorithms, like Metropolis-Ha...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en |
| Published: |
Université d'Ottawa / University of Ottawa
2019
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10393/39529 http://dx.doi.org/10.20381/ruor-23772 |