Bayesian Estimation and Prediction of Stochastic Volatility Models via INLA

In this article, we assess Bayesian estimation and prediction using integrated Laplace approximation (INLA) on a stochastic volatility (SV) model. This was performed through a Monte Carlo study with 1,000 simulated time series. To evaluate the estimation method, two criteria were considered: the bias and square root of the mean square error (smse). The criteria used for prediction are the one step ahead forecast of volatility and the one day Value at Risk (VaR). The main findings are that the INLA approximations are fairly accurate and relatively robust to the choice of prior distribution on the persistence parameter. Additionally, VaR estimates are computed and compared for three financial time series returns indexes.     

Maximizing generalized linear mixed model likelihoods with an automated Monte Carlo EM algorithm

Two new implementations of the EM algorithm are proposed for maximum likelihood fitting of generalized linear mixed models. Both methods use random (independent and identically distributed) sampling to construct Monte Carlo approximations at the E-step. One approach involves generating random samples from the exact conditional distribution of the random effects (given the data) by rejection sampling, using the marginal distribution as a candidate. The second method uses a multivariate t importance sampling approximation. In many applications the two methods are complementary. Rejection sampling is more efficient when sample sizes are small, whereas importance sampling is better with larger sample sizes. Monte Carlo approximation using random samples allows the Monte Carlo error at each iteration to be assessed by using standard central limit theory combined with Taylor series methods. Specifically, we construct a sandwich variance estimate for the maximizer at each approximate E-step. This suggests a rule for automatically increasing the Monte Carlo sample size after iterations in which the true EM step is swamped by Monte Carlo error. In contrast, techniques for assessing Monte Carlo error have not been developed for use with alternative implementations of Monte Carlo EM algorithms utilizing Markov chain Monte Carlo E-step approximations. Three different data sets, including the infamous salamander data of McCullagh and Nelder, are used to illustrate the techniques and to compare them with the alternatives. The results show that the methods proposed can be considerably more efficient than those based on Markov chain Monte Carlo algorithms. However, the methods proposed may break down when the intractable integrals in the likelihood function are of high dimension.     

应用Bootstrap模拟技术的VaR计算与分析研究

比较估计VaR的方差一协方差方法、历史模拟法和MonteCarlo模拟方法，提出估计VaR的新模型和新方法。新模型把随机收益率分解成刻画收益率二阶矩特征的部分和刻画随机均值的正态部分。新方法使用Bootstrap模拟技术和MonteCarlo模拟技术计算VaR。实证分析表明，新方法计算的VaR在传统方法计算的VaR参考范围内。     

Tolerance regions in multivariate linear regression

The construction of tolerance regions is investigated for a multivariate linear regression model under the multivariate normality assumption. In the context of such a model, a tolerance region is a region that will contain, with a certain confidence, at least a specified proportion of the population distribution, for a fixed value of the independent variable in the regression model. The necessary framework is developed for the Monte Carlo estimation of the tolerance factor. Some approximations are developed for the tolerance factor, and the accuracy of the approximations is numerically investigated. The approximations provide tolerance factors that are quite easy to compute, and the numerical results indicate the situations where the approximations are satisfactory. The computations are illustrated using an example.     

Asymptotic tests and monte carlo studies associated with the multiplicative interaction model

Several authors have proposed approximations to percentage points required for testing certain hypotheses associated with the multiplicative interaction model. Alternative approximations based on the asymptotic joint distribution of the characteristic roots of a noncentral Wishart matrix are proposed in this paper. The type I error rates of the resulting tests and the existing procedures are then compared using Monte Carlo methods.     

Implementation of saddlepoint approximations in resampling problems

In many situations saddlepoint approximations can replace the Monte Carlo simulation typically used to find the bootstrap distribution of a statistic. We explain how bootstrap and permutation distributions can be expressed as conditional distributions and how methods for linear programming and for fitting generalized linear models can be used to find saddlepoint approximations to these distributions. The ideas are illustrated using an example from insurance.     

HEAVY-TAILED-DISTRIBUTED THRESHOLD STOCHASTIC VOLATILITY MODELS IN FINANCIAL TIME SERIES

To capture mean and variance asymmetries and time‐varying volatility in financial time series, we generalize the threshold stochastic volatility (THSV) model and incorporate a heavy‐tailed error distribution. Unlike existing stochastic volatility models, this model simultaneously accounts for uncertainty in the unobserved threshold value and in the time‐delay parameter. Self‐exciting and exogenous threshold variables are considered to investigate the impact of a number of market news variables on volatility changes. Adopting a Bayesian approach, we use Markov chain Monte Carlo methods to estimate all unknown parameters and latent variables. A simulation experiment demonstrates good estimation performance for reasonable sample sizes. In a study of two international financial market indices, we consider two variants of the generalized THSV model, with US market news as the threshold variable. Finally, we compare models using Bayesian forecasting in a value‐at‐risk (VaR) study. The results show that our proposed model can generate more accurate VaR forecasts than can standard models.     

Quasi-random resampling for the bootstrap

Quasi-random sequences are known to give efficient numerical integration rules in many Bayesian statistical problems where the posterior distribution can be transformed into periodic functions on then-dimensional hypercube. From this idea we develop a quasi-random approach to the generation of resamples used for Monte Carlo approximations to bootstrap estimates of bias, variance and distribution functions. We demonstrate a major difference between quasi-random bootstrap resamples, which are generated by deterministic algorithms and have no true randomness, and the usual pseudo-random bootstrap resamples generated by the classical bootstrap approach. Various quasi-random approaches are considered and are shown via a simulation study to result in approximants that are competitive in terms of efficiency when compared with other bootstrap Monte Carlo procedures such as balanced and antithetic resampling.     

New approximations to the exact distribution of the kruskal-wallis test statistic

Several approximations to the exact distribution of the Kruskal-Wallis test' statistic presently exist. There approximations can roughly be grouped into two classes: (i) computationally difficult with good accuracy, and (ii) easy to compute but not as accurate as the first class. The purpose of this paper is to introduce two nev approximations (one in the latter class and one which is computationally more involved)y and to compare these with other popular approximations. These comparisons use exact probabilities where available and Monte Carlo simulation otherwise.     

Estimation of the Distribution Function of a Standardized Statistic

For estimating the distribution of a standardized statistic, the bootstrap estimate is known to be local asymptotic minimax. Various computational techniques have been developed to improve on the simulation efficiency of uniform resampling, the standard Monte Carlo approach to approximating the bootstrap estimate. Two new approaches are proposed which give accurate yet simple approximations to the bootstrap estimate. The second of the approaches even improves the convergence rate of the simulation error. A simulation study examines the performance of these two approaches in comparison with other modified bootstrap estimates.     

All pairwise comparisons of exponential location parameters under type i censoring — equal scale parameter case

In this paper, procedures for all pairwise comparisons of location parameters of negative exponential populations are developed when the common scale parameter is known or unknown using large sample distributional approximations of the relevant random variables. The small sample performance of these procedures are then examined using Monte Carlo simulation.     

Approximate estimation in nonlinear panel data models

This paper is concerned with the estimation of a general class of nonlinear panel data models in which the conditional distribution of the dependent variable and the distribution of the heterogeneity factors are arbitrary. In general, exact analytical results for this problem do not exist. Here, Laplace and small-sigma appriximations for the marginal likelihood are presented. The computation of the MLE from both approximations is straightforward. It is shown that the accuracy of the Laplace approximation depends on both the sample size and the variance of the individual effects, whereas the accuracy of the small-sigma approximation is 0(1) with respect to the sample size. The results are applied to count, duration and probit panel data models. The accuracy of the approximations is evaluated through a Monte Carlo simulation experiment. The approximations are also applied in an analysis of youth unemployment in Australia.     

Value at risk estimation under stochastic volatility models using adaptive PMCMC methods

In this paper, we propose a value-at-risk (VaR) estimation technique based on a new stochastic volatility model with leverage effect, nonconstant conditional mean and jump. In order to estimate the model parameters and latent state variables, we integrate the particle filter and adaptive Markov Chain Monte Carlo (MCMC) algorithms to develop a novel adaptive particle MCMC (A-PMCMC) algorithm. Comprehensive simulation experiments based on three stock indices and two foreign exchange time series show effectiveness of the proposed A-PMCMC algorithm and the VaR estimation technique.     

Confidence bands for Brownian motion and applications to Monte Carlo simulation

Minimal area regions are constructed for Brownian paths and perturbed Brownian paths. While the theoretical optimal region cannot be obtained in closed form, we provide practical confidence regions based on numerical approximations and local time arguments. These regions are used to provide informal convergence assessments for both Monte Carlo and Markov Chain Monte Carlo experiments, via the Brownian asymptotic approximation of cumulative sums.     

More Efficient Approximation of Multiple Integrals using Steady State Ranked Simulated Sampling

This article extends the concept of using the steady state ranked simulated sampling approach (SRSIS) by Al-Saleh and Samawi (2000) for improving Monte Carlo methods for single integration problem to multiple integration problems. We demonstrate that this approach provides unbiased estimators and substantially improves the performance of some Monte Carlo methods for bivariate integral approximations, which can be extended to multiple integrals’ approximations. This results in a significant reduction in costs and time required to attain a certain level of accuracy. In order to compare the performance of our method with the Samawi and Al-Saleh (2007) method, we use the same two illustrations for the bivariate case.     

log-logistic survival estimation based on failure-censored data

Approximations of the Bayesian estimators of the survival function based on the censored data of the log-logistic distribution are obtained under squared-error and log-odds squared-error loss functions. A numerical example is presented. Through a Monte Carlo simulation study, the behavior of the approximations found by Tierney & Kadane and Lindley are compared with a method suggested by Weiss & Howlader.     

Monte Carlo Based Ensemble Forecasting

Ensemble forecasting involves the use of several integrations of a numerical model. Even if this model is assumed to be known, ensembles are needed due to uncertainty in initial conditions. The ideas discussed in this paper incorporate aspects of both analytic model approximations and Monte Carlo arguments to gain some efficiency in the generation and use of ensembles. Efficiency is gained through the use of importance sampling Monte Carlo. Once ensemble members are generated, suggestions for their use, involving both approximation and statistical notions such as kernel density estimation and mixture modeling are discussed. Fully deterministic procedures derived from the Monte Carlo analysis are also described. Examples using the three-dimensional Lorenz system are described.     

An approach for finding fully Bayesian optimal designs using normal-based approximations to loss functions

The generation of decision-theoretic Bayesian optimal designs is complicated by the significant computational challenge of minimising an analytically intractable expected loss function over a, potentially, high-dimensional design space. A new general approach for approximately finding Bayesian optimal designs is proposed which uses computationally efficient normal-based approximations to posterior summaries to aid in approximating the expected loss. This new approach is demonstrated on illustrative, yet challenging, examples including hierarchical models for blocked experiments, and experimental aims of parameter estimation and model discrimination. Where possible, the results of the proposed methodology are compared, both in terms of performance and computing time, to results from using computationally more expensive, but potentially more accurate, Monte Carlo approximations. Moreover, the methodology is also applied to problems where the use of Monte Carlo approximations is computationally infeasible.     

Bayesian inference for generalized extreme value distributions via Hamiltonian Monte Carlo

In this article, we propose to evaluate and compare Markov chain Monte Carlo (MCMC) methods to estimate the parameters in a generalized extreme value model. We employed the Bayesian approach using traditional Metropolis-Hastings methods, Hamiltonian Monte Carlo (HMC), and Riemann manifold HMC (RMHMC) methods to obtain the approximations to the posterior marginal distributions of interest. Applications to real datasets and simulation studies provide evidence that the extra analytical work involved in Hamiltonian Monte Carlo algorithms is compensated by a more efficient exploration of the parameter space.     

基于Pearson Ⅳ分布的VaR与CVaR估计

基于GARCH模型,用Pearson Ⅳ分布拟合标准残差,给出一种更为精确的VaR和CVaR计算方法.重点研究在Norm-GARCH、t-GARCH与GED-GARCH模型下,用原分布和Pearson Ⅳ分布计算VaR的比较,结果表明,用Pearson Ⅳ分布计算VaR都能得到比原分布更小的失败率,且在三种模型之下用Pearson Ⅳ分布计算VaR结果很接近,都能通过检验,所以选择最简单的Norm-GARCH模型就可以;基于此,研究在Norm-GARCH模型下,用正态分布和Pearson Ⅳ分布计算CVaR,并与VaR进行比较,结果表明,用Pearson Ⅳ分布计算VaR和CVaR的失败率都远远小于由正态分布所得到的失败率,特别在VaR估计失效的交易日里,用Pearson Ⅳ分布得到的CVaR均值与实际损失均值非常接近.因此,Pearson Ⅳ分布能很好地刻画金融数据的特征,相对其他分布而言是一个很好的选择.