Markov Chain Monte Carlo on Asymmetric GARCH Model Using the Adaptive Construction Scheme
Tetsuya Takaishi

TL;DR
This paper introduces an adaptive construction scheme for Markov chain Monte Carlo simulations, improving Bayesian inference efficiency for the asymmetric GJR-GARCH model by adaptively tuning the proposal density.
Contribution
It presents a novel adaptive construction scheme for MCMC that enhances sampling efficiency in Bayesian GJR-GARCH model inference.
Findings
The scheme effectively samples GJR-GARCH parameters.
The adaptive method improves MCMC convergence.
The approach is validated with artificial data.
Abstract
We perform Markov chain Monte Carlo simulations for a Bayesian inference of the GJR-GARCH model which is one of asymmetric GARCH models. The adaptive construction scheme is used for the construction of the proposal density in the Metropolis-Hastings algorithm and the parameters of the proposal density are determined adaptively by using the data sampled by the Markov chain Monte Carlo simulation. We study the performance of the scheme with the artificial GJR-GARCH data. We find that the adaptive construction scheme samples GJR-GARCH parameters effectively and conclude that the Metropolis-Hastings algorithm with the adaptive construction scheme is an efficient method to the Bayesian inference of the GJR-GARCH model.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · Neural Networks and Applications
