Jacquier-Polson-Rossi (1994) Bayesian Analysis of Stochastic Volatility Models

stochastic-volatilitybayesianmcmcmetropolis-hastingsdata-augmentationlatent-variablekalman-filterquasi-maximum-likelihoodsimulation

Summary

Introduces the first practical Markov chain Monte Carlo (MCMC) estimator for the discrete-time AR(1) log-variance stochastic volatility (SV) model. The latent variance path {ht}t=1T\{h_t\}_{t=1}^T is treated as augmented data and sampled element-by-element via a cyclic independence Metropolis chain; parameters are drawn jointly from conjugate posteriors conditional on the full path. Monte Carlo experiments demonstrate that Bayesian root mean squared error (RMSE) for the persistence parameter is 3.7–4.1× smaller than method of moments (MM) and quasi-maximum likelihood (QML), and that the Bayesian smoother for latent variances dominates the approximate Kalman filter even when the Kalman filter is given the true parameters.

Key Claims

Concepts Introduced or Extended

Entities Mentioned

Quotes

"We propose a new Bayesian approach to the estimation of stochastic variance models... Our approach is exact in the sense that it does not require any approximation beyond the usual Monte Carlo error."

"It is remarkable that the Bayes smoothing solution dominates not only approximate Kalman filtering based on the MM and QML estimates but also the approximate Kalman-filtering solution using the true parameters."

My Take

JPR 1994 is the founding paper for MCMC estimation of SV models. The single-move Metropolis step is clever but slow to mix when volatility is persistent. Kim, Shephard, and Chib (1998) later improved mixing via multi-move sampling using a mixture-of-normals approximation to the log-chi-squared noise, but JPR's data-augmentation framing and the dominance result over approximate Kalman filtering remain the conceptual anchors for the field.