Accelerating Asymptotically Exact MCMC for Computationally Intensive Models via Local Approximations
We construct a new framework for accelerating Markov chain Monte Carlo in posterior sampling problems where standard methods are limited by the computational cost of the likelihood, or of numerical models embedded therein. Our approach introduces local approximations of these models into the Metropo...
Main Authors: | Conrad, Patrick R., Marzouk, Youssef M., Pillai, Natesh S., Smith, Aaron |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Aeronautics and Astronautics |
Format: | Article |
Language: | en_US |
Published: |
American Statistical Association
2015
|
Online Access: | http://hdl.handle.net/1721.1/99937 https://orcid.org/0000-0001-8242-3290 |
Similar Items
-
Parallel Local Approximation MCMC for Expensive Models
by: Conrad, Patrick Raymond, et al.
Published: (2019) -
Rate-optimal refinement strategies for local approximation MCMC
by: Davis, Andrew D., et al.
Published: (2022) -
Localization for MCMC: sampling high-dimensional posterior distributions with local structure
by: Morzfeld, M., et al.
Published: (2019) -
Dimension-independent likelihood-informed MCMC
by: Law, Kody J.H., et al.
Published: (2018) -
Asymptotic behaviour and optimal word size for exact and approximate word matches between random sequences
by: Kantorovitz Miriam R, et al.
Published: (2006-12-01)