In this article we propose a Monte Carlo algorithm for sequential parameter learning for a stochastic volatility model with leverage, nonconstant conditional mean and jumps. We are interested in estimating the time invariant parameters and the nonobservable dynamics involved in the model. Our simple but effective idea relies on the auxiliary particle filter algorithm mixed together with the Markov Chain Monte Carlo (MCMC) methodology. Adding an MCMC step to the auxiliary particle filter prevents numerical degeneracies in the sequential algorithm and allows sequential evaluation of the fixed parameters and the latent processes. Empirical evaluation on simulated and real data is presented to assess the performance of the algorithm. A numerical comparison with a full MCMC procedure is also provided. We also extend our methodology to superposition models in which volatility is obtained by a linear combination of independent processes.
Volatility, Jumps, and Predictability of Returns: A Sequential Analysis
BORDIGNON, SILVANO
2011
Abstract
In this article we propose a Monte Carlo algorithm for sequential parameter learning for a stochastic volatility model with leverage, nonconstant conditional mean and jumps. We are interested in estimating the time invariant parameters and the nonobservable dynamics involved in the model. Our simple but effective idea relies on the auxiliary particle filter algorithm mixed together with the Markov Chain Monte Carlo (MCMC) methodology. Adding an MCMC step to the auxiliary particle filter prevents numerical degeneracies in the sequential algorithm and allows sequential evaluation of the fixed parameters and the latent processes. Empirical evaluation on simulated and real data is presented to assess the performance of the algorithm. A numerical comparison with a full MCMC procedure is also provided. We also extend our methodology to superposition models in which volatility is obtained by a linear combination of independent processes.Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.