No Free Lunch for Approximate MCMC
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2020
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913588800651264 |
|---|---|
| author | Johndrow, James E. Pillai, Natesh S. Smith, Aaron |
| author_facet | Johndrow, James E. Pillai, Natesh S. Smith, Aaron |
| contents | It is widely known that the performance of Markov chain Monte Carlo (MCMC) can degrade quickly when targeting computationally expensive posterior distributions, such as when the sample size is large. This has motivated the search for MCMC variants that scale well to large datasets. One popular general approach has been to look at only a subsample of the data at every step. In this note, we point out that well-known MCMC convergence results often imply that these ``subsampling'' MCMC algorithms cannot greatly improve performance. We apply these abstract results to realistic statistical problems and proposed algorithms, and also discuss some design principles suggested by the results. Finally, we develop estimates for the singular values of random matrices bounds that may be of independent interest. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2010_12514 |
| institution | arXiv |
| publishDate | 2020 |
| record_format | arxiv |
| spellingShingle | No Free Lunch for Approximate MCMC Johndrow, James E. Pillai, Natesh S. Smith, Aaron Computation Statistics Theory It is widely known that the performance of Markov chain Monte Carlo (MCMC) can degrade quickly when targeting computationally expensive posterior distributions, such as when the sample size is large. This has motivated the search for MCMC variants that scale well to large datasets. One popular general approach has been to look at only a subsample of the data at every step. In this note, we point out that well-known MCMC convergence results often imply that these ``subsampling'' MCMC algorithms cannot greatly improve performance. We apply these abstract results to realistic statistical problems and proposed algorithms, and also discuss some design principles suggested by the results. Finally, we develop estimates for the singular values of random matrices bounds that may be of independent interest. |
| title | No Free Lunch for Approximate MCMC |
| topic | Computation Statistics Theory |
| url | https://arxiv.org/abs/2010.12514 |