اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدImprove Orthogonal GARCH with Hidden Markov Model
72
0
0.0
(
0
)
تأليف
Yufan Li
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Orthogonal Generalized Autoregressive Conditional Heteroskedasticity model (OGARCH) is widely used in finance industry to produce volatility and correlation forecasts. We show that the classic OGARCH model, nevertheless, tends to be too slow in reflecting sudden changes in market condition due to excessive persistence of the integral univariate GARCH processes. To obtain more flexibility to accommodate abrupt market changes, e.g. financial crisis, we extend classic OGARCH model by incorporating a two-state Markov regime-switching GARCH process. This novel construction allows us to capture recurrent systemic regime shifts. Empirical results show that this generalization resolves the problem of excessive persistency effectively and greatly enhances OGARCHs ability to adapt to sudden market breaks while preserving OGARCHs most attractive features such as dimension reduction and multi-step ahead forecasting. By constructing a global minimum variance portfolio (GMVP), we are able to demonstrate significant outperformance of the extended model over the classic OGARCH model and the commonly used Exponentially Weighted Moving Average (EWMA) model. In addition, we show that the extended model is superior to OGARCH and EWMA in terms of predictive accuracy.
قيم البحث
اقرأ أيضاً
We develop a Bayesian inference method for diffusions observed discretely and with noise, which is free of discretisation bias. Unlike existing unbiased inference methods, our method does not rely on exact simulation techniques. Instead, our method u
ses standard time-discretised approximations of diffusions, such as the Euler--Maruyama scheme. Our approach is based on particle marginal Metropolis--Hastings, a particle filter, randomised multilevel Monte Carlo, and importance sampling type correction of approximate Markov chain Monte Carlo. The resulting estimator leads to inference without a bias from the time-discretisation as the number of Markov chain iterations increases. We give convergence results and recommend allocations for algorithm inputs. Our method admits a straightforward parallelisation, and can be computationally efficient. The user-friendly approach is illustrated on three examples, where the underlying diffusion is an Ornstein--Uhlenbeck process, a geometric Brownian motion, and a 2d non-reversible Langevin equation.
We consider the problem of flexible modeling of higher order hidden Markov models when the number of latent states and the nature of the serial dependence, including the true order, are unknown. We propose Bayesian nonparametric methodology based on
tensor factorization techniques that can characterize any transition probability with a specified maximal order, allowing automated selection of the important lags and capturing higher order interactions among the lags. Theoretical results provide insights into identifiability of the emission distributions and asymptotic behavior of the posterior. We design efficient Markov chain Monte Carlo algorithms for posterior computation. In simulation experiments, the method vastly outperformed its first and higher order competitors not just in higher order settings, but, remarkably, also in first order cases. Practical utility is illustrated using real world applications.
This paper gives a method for computing distributions associated with patterns in the state sequence of a hidden Markov model, conditional on observing all or part of the observation sequence. Probabilities are computed for very general classes of pa
tterns (competing patterns and generalized later patterns), and thus, the theory includes as special cases results for a large class of problems that have wide application. The unobserved state sequence is assumed to be Markovian with a general order of dependence. An auxiliary Markov chain is associated with the state sequence and is used to simplify the computations. Two examples are given to illustrate the use of the methodology. Whereas the first application is more to illustrate the basic steps in applying the theory, the second is a more detailed application to DNA sequences, and shows that the methods can be adapted to include restrictions related to biological knowledge.
We develop clustering procedures for longitudinal trajectories based on a continuous-time hidden Markov model (CTHMM) and a generalized linear observation model. Specifically in this paper, we carry out finite and infinite mixture model-based cluster
ing for a CTHMM and achieve inference using Markov chain Monte Carlo (MCMC). For a finite mixture model with prior on the number of components, we implement reversible-jump MCMC to facilitate the trans-dimensional move between different number of clusters. For a Dirichlet process mixture model, we utilize restricted Gibbs sampling split-merge proposals to expedite the MCMC algorithm. We employ proposed algorithms to the simulated data as well as a real data example, and the results demonstrate the desired performance of the new sampler.
Pulsar timing experiments typically generate a phase-connected timing solution from a sequence of times-of-arrival (TOAs) by absolute pulse numbering, i.e. by fitting an integer number of pulses between TOAs in order to minimize the residuals with re
spect to a parametrized phase model. In this observing mode, rotational glitches are discovered, when the residuals of the no-glitch phase model diverge after some epoch, and glitch parameters are refined by Bayesian follow-up. Here an alternative, complementary approach is presented which tracks the pulse frequency $f$ and its time derivative $df/dt$ with a hidden Markov model (HMM), whose dynamics include stochastic spin wandering (timing noise) and impulsive jumps in $f$ and $df/dt$ (glitches). The HMM tracks spin wandering explicitly, as a specific realization of a discrete-time Markov chain. It discovers glitches by comparing the Bayes factor for glitch and no-glitch models. It ingests standard TOAs for convenience and, being fully automated, allows performance bounds to be calculated quickly via Monte Carlo simulations. Practical, user-oriented plots are presented of the false alarm probability and detection threshold (e.g. minimum resolvable glitch size) versus observational scheduling parameters (e.g. TOA uncertainty, mean delay between TOAs) and glitch parameters (e.g. transient and permanent jump sizes, exponential recovery time-scale). The HMM is also applied to $sim 1$ yr of real data bracketing the 2016 December 12 glitch in PSR J0835-4510 as a proof of principle. It detects the known glitch and confirms that no other glitch exists in the same data with size $> 10^{-7} f$.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
