Sequential Monte Carlo With Model Tempering
Modern macroeconometrics often relies on time series models for which it is time-consuming to evaluate the likelihood function. We demonstrate how Bayesian computations for such models can be drastically accelerated by reweighting and mutating posterior draws from an approximating model that allows for fast likelihood evaluations, into posterior draws from the model of interest, using a sequential Monte Carlo (SMC) algorithm. We apply the technique to the estimation of a vector autoregression with stochastic volatility and a nonlinear dynamic stochastic general equilibrium model. The runtime reductions we obtain range from 27% to 88%.
Code (0)
등록된 구현이 없습니다.
Tasks
modelTime SeriesTime Series AnalysisSimilar Papers 제목 키워드 기반
On the performance of machine-learning-assisted Monte Carlo in sampling from simple statistical physics models
Recent years have seen a rise in the application of machine learning techniques to aid the simulation of hard-to-sample systems that cannot be studied using traditional methods. Despite the introduction of many different…
A connection between Tempering and Entropic Mirror Descent
This paper explores the connections between tempering (for Sequential Monte Carlo; SMC) and entropic mirror descent to sample from a target probability distribution whose unnormalized density is known. We establish that …
Marginal sequential Monte Carlo for doubly intractable models
Bayesian inference for models that have an intractable partition function is known as a doubly intractable problem, where standard Monte Carlo methods are not applicable. The past decade has seen the development of auxil…
Bayesian InferenceSampling from high-dimensional, multimodal distributions using automatically tuned, tempered Hamiltonian Monte Carlo
Hamiltonian Monte Carlo (HMC) is widely used for sampling from high-dimensional target distributions with probability density known up to proportionality. While HMC possesses favorable dimension scaling properties, it en…
On the Sampling Problem for Kernel Quadrature
The standard Kernel Quadrature method for numerical integration with random point sets (also called Bayesian Monte Carlo) is known to converge in root mean square error at a rate determined by the ratio $s/d$, where $s$ …
Numerical Integration