Regime-switching stochastic volatility model: estimation and calibration to VIX options

We develop and implement a method for maximum likelihood estimation of a regime-switching stochastic volatility model. Our model uses a continuous time stochastic process for the stock dynamics with the instantaneous variance driven by a Cox–Ingersoll–Ross process and each parameter modulated by a hidden Markov chain. We propose an extension of the EM algorithm through the Baum–Welch implementation to estimate our model and filter the hidden state of the Markov chain while using the VIX index to invert the latent volatility state. Using Monte Carlo simulations, we test the convergence of our algorithm and compare it with an approximate likelihood procedure where the volatility state is replaced by the VIX index. We found that our method is more accurate than the approximate procedure. Then, we apply Fourier methods to derive a semi-analytical expression of S&P500 and VIX option prices, which we calibrate to market data. We show that the model is sufficiently rich to encapsulate important features of the joint dynamics of the stock and the volatility and to consistently fit option market prices.     

Estimating structural credit risk models when market prices are contaminated with noise

In this paper, sequential estimation on hidden asset value and model parameter estimation is implemented under the Black–Cox model. To capture short‐term autocorrelation in the stock market, we assume that market noise follows a mean reverting process. For estimation, Bayesian methods are applied in this paper: the particle filter algorithm for sequential estimation of asset value and the generalized Gibbs and multivariate adapted Metropolis methods for model parameters estimation. The first simulation study shows that sequential hidden asset value estimation using both option price and equity price is more efficient than estimation using equity price alone. The second simulation study shows that, by applying the generalized Gibbs sampling and multivariate adapted Metropolis methods, model parameters can be estimated successfully. In an empirical analysis, the stock market noise for firms with more liquid stock is estimated as having smaller volatility. Copyright © 2015 John Wiley & Sons, Ltd.     

Estimating Hidden Semi-Markov Chains From Discrete Sequences

This article addresses the estimation of hidden semi-Markov chains from nonstationary discrete sequences. Hidden semi-Markov chains are particularly useful to model the succession of homogeneous zones or segments along sequences. A discrete hidden semi-Markov chain is composed of a nonobservable state process, which is a semi-Markov chain, and a discrete output process. Hidden semi-Markov chains generalize hidden Markov chains and enable the modeling of various durational structures. From an algorithmic point of view, a new forward-backward algorithm is proposed whose complexity is similar to that of the Viterbi algorithm in terms of sequence length (quadratic in the worst case in time and linear in space). This opens the way to the maximum likelihood estimation of hidden semi-Markov chains from long sequences. This statistical modeling approach is illustrated by the analysis of branching and flowering patterns in plants.     

Backfitting neural networks

Summary  Regression and classification problems can be viewed as special cases of the problem of function estimation. It is rather well known that a two-layer perceptron with sigmoidal transformation functions can approximate any continuous function on the compact subsets ofRP if there are sufficient number of hidden nodes. In this paper, we present an algorithm for fitting perceptron models, which is quite different from the usual backpropagation or Levenberg-Marquardt algorithm. This new algorithm based on backfitting ensures a better convergence than backpropagation. We have also used resampling techniques to select an ideal number of hidden nodes automatically using the training data itself. This resampling technique helps to avoid the problem of overfitting that one faces for the usual perceptron learning algorithms without any model selection scheme. Case studies and simulation results are presented to illustrate the performance of this proposed algorithm.     

Dynamic modeling of mean-reverting spreads for statistical arbitrage

Statistical arbitrage strategies, such as pairs trading and its generalizations rely on the construction of mean-reverting spreads enjoying a certain degree of predictability. Gaussian linear state-space processes have recently been proposed as a model for such spreads under the assumption that the observed process is a noisy realization of some hidden states. Real-time estimation of the unobserved spread process can reveal temporary market inefficiencies which can then be exploited to generate excess returns. We embrace the state-space framework for modeling spread processes and extend this methodology along three different directions. First, we introduce time-dependency in the model parameters, which allows for quick adaptation to changes in the data generating process. Second, we provide an on-line estimation algorithm that can be constantly run in real-time. Being computationally fast, the algorithm is particularly suitable for building aggressive trading strategies based on high-frequency data and may be used as a monitoring device for mean- reversion. Finally, our framework naturally provides informative uncertainty measures of all the estimated parameters. Experimental results based on Monte Carlo simulations and historical equity data are discussed, including a co-integration relationship involving two exchange-traded funds.     

A model for real-time failure prognosis based on hidden Markov model and belief rule base

As one of most important aspects of condition-based maintenance (CBM), failure prognosis has attracted an increasing attention with the growing demand for higher operational efficiency and safety in industrial systems. Currently there are no effective methods which can predict a hidden failure of a system real-time when there exist influences from the changes of environmental factors and there is no such an accurate mathematical model for the system prognosis due to its intrinsic complexity and operating in potentially uncertain environment. Therefore, this paper focuses on developing a new hidden Markov model (HMM) based method which can deal with the problem. Although an accurate model between environmental factors and a failure process is difficult to obtain, some expert knowledge can be collected and represented by a belief rule base (BRB) which is an expert system in fact. As such, combining the HMM with the BRB, a new prognosis model is proposed to predict the hidden failure real-time even when there are influences from the changes of environmental factors. In the proposed model, the HMM is used to capture the relationships between the hidden failure and monitored observations of a system. The BRB is used to model the relationships between the environmental factors and the transition probabilities among the hidden states of the system including the hidden failure, which is the main contribution of this paper. Moreover, a recursive algorithm for online updating the prognosis model is developed. An experimental case study is examined to demonstrate the implementation and potential applications of the proposed real-time failure prognosis method.     

Basic problems and solution methods for two-dimensional continuous 3 × 3 order hidden Markov model

A novel model referred to as two-dimensional continuous 3 × 3 order hidden Markov model is put forward to avoid the disadvantages of the classical hypothesis of two-dimensional continuous hidden Markov model. This paper presents three equivalent definitions of the model, in which the state transition probability relies on not only immediate horizontal and vertical states but also immediate diagonal state, and in which the probability density of the observation relies on not only current state but also immediate horizontal and vertical states. The paper focuses on the three basic problems of the model, namely probability density calculation, parameters estimation and path backtracking. Some algorithms solving the questions are theoretically derived, by exploiting the idea that the sequences of states on rows or columns of the model can be viewed as states of a one-dimensional continuous 1 × 2 order hidden Markov model. Simulation results further demonstrate the performance of the algorithms. Because there are more statistical characteristics in the structure of the proposed new model, it can more accurately describe some practical problems, as compared to two-dimensional continuous hidden Markov model.     

Interactive hidden Markov models and their applications

^** Email: wching{at}hkusua.hku.hk In this paper, we propose an Interactive hidden Markov model(IHMM). In a traditional HMM, the observable states are affecteddirectly by the hidden states, but not vice versa. In the proposedIHMM, the transitions of hidden states depend on the observablestates. We also develop an efficient estimation method for themodel parameters. Numerical examples on the sales demand dataand economic data are given to demonstrate the applicabilityof the model.     

基于EM算法隐Markov模型参数估计

描述最大似然参数估计问题,介绍如何用EM算法求解最大似然参数估计.首先给出EM算法的抽象形式,然后介绍EM算法的一个应用:求隐Markov模型中的参数估计.用EM算法推导出隐Markov模型中参数的迭代公式.     

多机制半参数平滑转换回归模型——兼论我国宏观经济运行周期

本文结合多机制平滑转换回归模型和半参数平滑转换回归模型,提出多机制半参数平滑转换回归模型。对模型转换函数中的未知光滑有界函数采用级数估计,并给出了结合Back-fitting算法和非线性最小二乘法估计模型参数的具体执行步骤,随机模拟结果说明了本文模型和估计算法的可行性和灵活性。应用本文模型和估计算法对我国宏观经济运行周期的实证研究表明,我国经济增长的非线性结构可以分为四个显著不同的增长机制:扩张阶段、衰退阶段、收缩阶段、恢复阶段,并且宏观经济政策的作用有三到四个季度的迟滞效应。     

Strategic Asset Allocation Under a Fractional Hidden Markov Model

Strategic asset allocation is discussed in a discrete-time economy, where the rates of return from asset classes are explained in terms of some observable and hidden factors. We extend the existing models by incorporating long-term memory in the rates of return and observable economic factors, which have been documented in the empirical literature. Hidden factors are described by a discrete-time, finite-state, hidden Markov chain noisily observed in a fractional Gaussian process. The strategic asset allocation problem is discussed in a mean-variance utility framework. Filtering and parameter estimation are also considered in the hybrid model.     

New approach for the identification of power system economic dispatch parameters

It is well known that the coefficients of the input-output characteristics of the thermal steam-turbine model as well as the network model parameters have a great effect on the optimal economic operation of all thermal-electric power systems. Until today, these coefficients, the loss formula coefficients, theB-coefficients, and the active-reactive power loss models have been estimated using the well-known least-square estimation algorithm.In this paper, we present a new algorithm to estimate the power system parameters for economic dispatch calculation (EDC); this algorithm is based on the least absolute-value approximation (LAV)l ₁-norm. We compare the results obtained using the proposed algorithms with those obtained using the least-square error algorithm (LS). Optimal costs as well as overall network performance resulting from the implementation of each technique provide the basis of our conclusion.This work was supported by the Natural Science and Engineering Research Council of Canada, Grant No. A4146.     

Parameter estimation in a condition-based maintenance model

A parameter estimation problem for a condition-based maintenance model is considered. We model a failing system that can be in a healthy or unhealthy operational state, or in a failure state. System deterioration is assumed to follow a hidden, three-state continuous time Markov process. Vector autoregressive data are obtained through condition monitoring at discrete time points, which gives partial information about the unobservable system state. Two kinds of data histories are considered: histories that end with observable system failure and histories that end when the system is suspended from operation but has not failed. Maximum likelihood estimates of the model parameters are obtained using the EM algorithm and a closed form expression for the pseudo-likelihood function is derived. Numerical results are provided which illustrate the estimation procedure.     

A multi-modal approach to the location of a rapid transit line

The location of a rapid transit line (RTL) represents a very complex decision problem because of the large number of decision makers, unquantifiable criteria and uncertain data. In this context Operational Research can help in the design process by providing tools to generate and assess alternative solutions. For this purpose two bicriterion mathematical programming models — the Maximum Coverage Shortest Path model and the Median Shortest Path model — have been developed in the past. In this paper a new bicriterion model, which can evaluate in a more realistic way the attractivity of an RTL is introduced. To calculate an estimation of the non-inferior solution set of the problem, a procedure based on a k-shortest path algorithm was developed. This approach was applied to a well-known sample problem and the results are discussed and compared with those obtained using a Median Shortest Path model.     

ESTIMATION OF THE MIXED AR AND HIDDEN PERIODIC MODEL

ThisresearchissupportedbytheNationalNaturalScienceFoundationofChina.1.IntroductionGeneralizedhiddenperiodicmodelhasthefollowingformwhereacisthesetofallpositiveintegers,('~{((t);tEac}isastationarysequencewithzeromeanandcontinuousspectraldensity,i=n,qisanonnegativeinteger,'f=0,X=(Al,Az,',A,)isarealvectorwith--T相似文献   

关于回归模型的参数估计效率

本文讨论回归模型的参数估计效率。本文说明了现有线性回归模型的参数估计效率的下界与真实的参数估计效率在很多情况下相差较大,而且这种下界对于实测数据处理很难得到精确值。本文给出了估算参数估计效率的仿真方法。理论分析表明,该方法给出的参数估计效率的估计较现有的下界估计更合理;仿真和实算结果表明,对于一大类线性和非线性回归模型,该方法给出的回归模型的参数估计效率的估计更接近模型参数估计效率的真值。     

一种改进的密度核估计算法

密度核估计是解决统计问题中样本分布密度函数拟合的一类非参数统计方法,在经济、金融等领域有着重要的应用价值.密度核估计重点在于研究它的算法,使其估计值相对精确.本文提出了一种密度核估计的迭代方法,并通过算例与原有的密度核估计方法进行统计模拟比较,得出迭代后的值具有较好的拟合程度,充分验证了迭代方法的可行性与优越性.     

Conditionally heteroscedastic factorial HMMs for time series in finance

In this article, we develop a new approach within the framework of asset pricing models that incorporates two key features of the latent volatility: co‐movement among conditionally heteroscedastic financial returns and switching between different unobservable regimes. By combining latent factor models with hidden Markov chain models we derive a dynamical local model for segmentation and prediction of multivariate conditionally heteroscedastic financial time series. We concentrate more precisely on situations where the factor variances are modelled by univariate generalized quadratic autoregressive conditionally heteroscedastic processes. The expectation maximization algorithm that we have developed for the maximum likelihood estimation is based on a quasi‐optimal switching Kalman filter approach combined with a generalized pseudo‐Bayesian approximation, which yield inferences about the unobservable path of the common factors, their variances and the latent variable of the state process. Extensive Monte Carlo simulations and preliminary experiments obtained with daily foreign exchange rate returns of eight currencies show promising results. Copyright © 2007 John Wiley & Sons, Ltd.     

The Alive Particle Filter and Its Use in Particle Markov Chain Monte Carlo

In the following article, we investigate a particle filter for approximating Feynman–Kac models with indicator potentials and we use this algorithm within Markov chain Monte Carlo (MCMC) to learn static parameters of the model. Examples of such models include approximate Bayesian computation (ABC) posteriors associated with hidden Markov models (HMMs) or rare-event problems. Such models require the use of advanced particle filter or MCMC algorithms to perform estimation. One of the drawbacks of existing particle filters is that they may “collapse,” in that the algorithm may terminate early, due to the indicator potentials. In this article, using a newly developed special case of the locally adaptive particle filter, we use an algorithm that can deal with this latter problem, while introducing a random cost per-time step. In particular, we show how this algorithm can be used within MCMC, using particle MCMC. It is established that, when not taking into account computational time, when the new MCMC algorithm is applied to a simplified model it has a lower asymptotic variance in comparison to a standard particle MCMC algorithm. Numerical examples are presented for ABC approximations of HMMs.     

On Adjusted Viterbi Training

The EM algorithm is a principal tool for parameter estimation in the hidden Markov models, where its efficient implementation is known as the Baum–Welch algorithm. This paper is however motivated by applications where EM is replaced by Viterbi training, or extraction (VT), also known as the Baum–Viterbi algorithm. VT is computationally less intensive and more stable, and has more of an intuitive appeal. However, VT estimators are also biased and inconsistent. Recently, we have proposed elsewhere the adjusted Viterbi training (VA), a new method to alleviate the above imprecision of the VT estimators while preserving the computational advantages of the baseline VT algorithm. The key difference between VA and VT is that asymptotically, the true parameter values are a fixed point of VA (and EM), but not of VT. We have previously studied VA for a special case of Gaussian mixtures, including simulations to illustrate its improved performance. The present work proves the asymptotic fixed point property of VA for general hidden Markov models. J. Lember is supported by Estonian Science Foundation Grant 5694.