A New Approach to Importance Sampling in Taylor’s Stochastic Volatility Model

This article presents the general analysis of finite high-dimensional integrals using the Importance Sampling (IS) in aim to the parameter estimation of Taylor’s stochastic volatility (SV) model. After we proceed to make an alternative derivation for Sequential Importance Sampling (SIS) in previous literatures, we propose a new approach to select the optimal parameters of sampler, which is called as Universal Importance Sampling (UIS). UIS minimizes the Monte Carlo variance and numerically performs at least the same accurately as the SIS algorithm, but the computational efficiency get greatly improved. We apply both methods and investigate the SV model on the data, then make comparisons of the results.     

The Gibbs sampler with particle efficient importance sampling for state-space models*

We consider Particle Gibbs (PG) for Bayesian analysis of non-linear non-Gaussian state-space models. As a Monte Carlo (MC) approximation of the Gibbs procedure, PG uses sequential MC (SMC) importance sampling inside the Gibbs to update the latent states. We propose to combine PG with the Particle Efficient Importance Sampling (PEIS). By using SMC sampling densities which are approximately globally fully adapted to the targeted density of the states, PEIS can substantially improve the simulation efficiency of the PG relative to existing PG implementations. The efficiency gains are illustrated in PG applications to a non-linear local-level model and stochastic volatility models.     

期权定价的蒙特卡罗模拟方差缩减技术研究

蒙特卡罗模拟的方差缩减技术作为模拟效率改进的重要途径,在金融衍生证券的定价分析中得到了广泛的应用和发展,特别是在控制变量、对偶变量、分层抽样、拉丁超立方抽样、矩匹配和重要性抽样技术方面。从方差缩减的效率来看,所有的蒙特卡罗模拟方差缩减技术都能显著地提高期权定价的模拟效率,其中基于最优漂移率的重要性抽样技术与沿着最优分层抽样方向进行的分层抽样技术的组合,要比普通的蒙特卡罗模拟具有极其明显的效率提高效果。     

Some contributions to sequential Monte Carlo methods for option pricing

Pricing options is an important problem in financial engineering. In many scenarios of practical interest, financial option prices associated with an underlying asset reduces to computing an expectation w.r.t. a diffusion process. In general, these expectations cannot be calculated analytically, and one way to approximate these quantities is via the Monte Carlo (MC) method; MC methods have been used to price options since at least the 1970s. It has been seen in Del Moral P, Shevchenko PV. [Valuation of barrier options using sequential Monte Carlo. 2014. arXiv preprint] and Jasra A, Del Moral P. [Sequential Monte Carlo methods for option pricing. Stoch Anal Appl. 2011;29:292–316] that Sequential Monte Carlo (SMC) methods are a natural tool to apply in this context and can vastly improve over standard MC. In this article, in a similar spirit to Del Moral and Shevchenko (2014) and Jasra and Del Moral (2011), we show that one can achieve significant gains by using SMC methods by constructing a sequence of artificial target densities over time. In particular, we approximate the optimal importance sampling distribution in the SMC algorithm by using a sequence of weighting functions. This is demonstrated on two examples, barrier options and target accrual redemption notes (TARNs). We also provide a proof of unbiasedness of our SMC estimate.     

Performance of coefficient of variation estimators in ranked set sampling

In this paper, we propose and evaluate the performance of different parametric and nonparametric estimators for the population coefficient of variation considering Ranked Set Sampling (RSS) under normal distribution. The performance of the proposed estimators was assessed based on the bias and relative efficiency provided by a Monte Carlo simulation study. An application in anthropometric measurements data from a human population is also presented. The results showed that the proposed estimators via RSS present an expressively lower mean squared error when compared to the usual estimator, obtained via Simple Random Sampling. Also, it was verified the superiority of the maximum likelihood estimator, given the necessary assumptions of normality and perfect ranking are met.     

New sequential Monte Carlo methods for nonlinear dynamic systems

In this paper we present several new sequential Monte Carlo (SMC) algorithms for online estimation (filtering) of nonlinear dynamic systems. SMC has been shown to be a powerful tool for dealing with complex dynamic systems. It sequentially generates Monte Carlo samples from a proposal distribution, adjusted by a set of importance weight with respect to a target distribution, to facilitate statistical inferences on the characteristic (state) of the system. The key to a successful implementation of SMC in complex problems is the design of an efficient proposal distribution from which the Monte Carlo samples are generated. We propose several such proposal distributions that are efficient yet easy to generate samples from. They are efficient because they tend to utilize both the information in the state process and the observations. They are all Gaussian distributions hence are easy to sample from. The central ideas of the conventional nonlinear filters, such as extended Kalman filter, unscented Kalman filter and the Gaussian quadrature filter, are used to construct these proposal distributions. The effectiveness of the proposed algorithms are demonstrated through two applications—real time target tracking and the multiuser parameter tracking in CDMA communication systems.This work was supported in part by the U.S. National Science Foundation (NSF) under grants CCR-9875314, CCR-9980599, DMS-9982846, DMS-0073651 and DMS-0073601.     

Particle learning for Bayesian semi-parametric stochastic volatility model

This article designs a Sequential Monte Carlo (SMC) algorithm for estimation of Bayesian semi-parametric Stochastic Volatility model for financial data. In particular, it makes use of one of the most recent particle filters called Particle Learning (PL). SMC methods are especially well suited for state-space models and can be seen as a cost-efficient alternative to Markov Chain Monte Carlo (MCMC), since they allow for online type inference. The posterior distributions are updated as new data is observed, which is exceedingly costly using MCMC. Also, PL allows for consistent online model comparison using sequential predictive log Bayes factors. A simulated data is used in order to compare the posterior outputs for the PL and MCMC schemes, which are shown to be almost identical. Finally, a short real data application is included.     

Quantile regression estimation of partially linear additive models

In this paper, we consider the estimation of partially linear additive quantile regression models where the conditional quantile function comprises a linear parametric component and a nonparametric additive component. We propose a two-step estimation approach: in the first step, we approximate the conditional quantile function using a series estimation method. In the second step, the nonparametric additive component is recovered using either a local polynomial estimator or a weighted Nadaraya–Watson estimator. Both consistency and asymptotic normality of the proposed estimators are established. Particularly, we show that the first-stage estimator for the finite-dimensional parameters attains the semiparametric efficiency bound under homoskedasticity, and that the second-stage estimators for the nonparametric additive component have an oracle efficiency property. Monte Carlo experiments are conducted to assess the finite sample performance of the proposed estimators. An application to a real data set is also illustrated.     

Notes on Interval Estimation of Odds Ratio in Matched Pairs under Stratified Sampling

We develop four asymptotic interval estimators and one exact interval estimator for the odds ratio (OR) under stratified random sampling with matched pairs. We apply Monte Carlo simulation to evaluate the performance of these five interval estimators. We note that the conditional score test-based interval estimator with a monotonic transformation and the interval estimator based on the Mantel–Haenszel (MH) type point estimator with the logarithmic transformation are generally preferable to the others considered here. We also note that the conditional exact confidence interval can be of use when the total number of matched pairs with discordant responses is small.     

贷款组合信用风险VaR仿真计算的一种优化方法

This paper presents the principle of Monte Carlo optimize calculation of credit risk VaR for loanportfolio using Importance Sampling technique. Based on Matlab language, simulation experiments arecarried out and the result shows this approach can effectively reduce the numher of simulation runs andimprove the precision of parameter estimation.     

Importance sampling type estimators based on approximate marginal Markov chain Monte Carlo

We consider importance sampling (IS) type weighted estimators based on Markov chain Monte Carlo (MCMC) targeting an approximate marginal of the target distribution. In the context of Bayesian latent variable models, the MCMC typically operates on the hyperparameters, and the subsequent weighting may be based on IS or sequential Monte Carlo (SMC), but allows for multilevel techniques as well. The IS approach provides a natural alternative to delayed acceptance (DA) pseudo-marginal/particle MCMC, and has many advantages over DA, including a straightforward parallelization and additional flexibility in MCMC implementation. We detail minimal conditions which ensure strong consistency of the suggested estimators, and provide central limit theorems with expressions for asymptotic variances. We demonstrate how our method can make use of SMC in the state space models context, using Laplace approximations and time-discretized diffusions. Our experimental results are promising and show that the IS-type approach can provide substantial gains relative to an analogous DA scheme, and is often competitive even without parallelization.     

Estimation of odds ratios under order restrictions

A new method for estimating a set of odds ratios under an order restriction based on estimating equations is proposed. The method is applied to those of the conditional maximum likelihood estimators and the Mantel-Haenszel estimators. The estimators derived from the conditional likelihood estimating equations are shown to maximize the conditional likelihoods. It is also seen that the restricted estimators converge almost surely to the respective odds ratios when the respective sample sizes become large regularly. The restricted estimators are compared with the unrestricted maximum likelihood estimators by a Monte Carlo simulation. The simulation studies show that the restricted estimates improve the mean squared errors remarkably, while the Mantel-Haenszel type estimates are competitive with the conditional maximum likelihood estimates, being slightly worse.     

Variance reduction of estimators arising from Metropolis–Hastings algorithms

The Metropolis–Hastings algorithm is one of the most basic and well-studied Markov chain Monte Carlo methods. It generates a Markov chain which has as limit distribution the target distribution by simulating observations from a different proposal distribution. A proposed value is accepted with some particular probability otherwise the previous value is repeated. As a consequence, the accepted values are repeated a positive number of times and thus any resulting ergodic mean is, in fact, a weighted average. It turns out that this weighted average is an importance sampling-type estimator with random weights. By the standard theory of importance sampling, replacement of these random weights by their (conditional) expectations leads to more efficient estimators. In this paper we study the estimator arising by replacing the random weights with certain estimators of their conditional expectations. We illustrate by simulations that it is often more efficient than the original estimator while in the case of the independence Metropolis–Hastings and for distributions with finite support we formally prove that it is even better than the “optimal” importance sampling estimator.     

Adaptive Multiple Importance Sampling

Abstract. The Adaptive Multiple Importance Sampling algorithm is aimed at an optimal recycling of past simulations in an iterated importance sampling (IS) scheme. The difference with earlier adaptive IS implementations like Population Monte Carlo is that the importance weights of all simulated values, past as well as present, are recomputed at each iteration, following the technique of the deterministic multiple mixture estimator of Owen & Zhou (J. Amer. Statist. Assoc., 95, 2000, 135). Although the convergence properties of the algorithm cannot be investigated, we demonstrate through a challenging banana shape target distribution and a population genetics example that the improvement brought by this technique is substantial.     

Count Data Models with Correlated Unobserved Heterogeneity

Abstract. As previously argued, the correlation between included and omitted regressors generally causes inconsistency of standard estimators for count data models. Non‐linear instrumental variables estimation of an exponential model under conditional moment restrictions is one of the proposed remedies. This approach is extended here by fully exploiting the model assumptions and thereby improving efficiency of the resulting estimator. Empirical likelihood in particular has favourable properties in this setting compared with the two‐step generalized method of moments, as demonstrated in a Monte Carlo experiment. The proposed method is applied to the estimation of a cigarette demand function.     

Regenerative Markov Chain Importance Sampling

We introduce Markov Chain Importance Sampling (MCIS), which combines importance sampling (IS) and Markov Chain Monte Carlo (MCMC) to estimate some characteristics of a non-normalized multi-dimensional distribution. Especially, we introduce some importance functions whose variates are regeneratively generated by MCMC; these variates then are used to estimate the quantity of interest through IS. Because MCIS is regenerative, it overcomes the burn-in problem associated with MCMC. It could also speed up the mixing rate in MCMC.     

Nonparametric estimation of the conditional mean residual life function with censored data

The conditional mean residual life (MRL) function is the expected remaining lifetime of a system given survival past a particular time point and the values of a set of predictor variables. This function is a valuable tool in reliability and actuarial studies when the right tail of the distribution is of interest, and can be more informative than the survivor function. In this paper, we identify theoretical limitations of some semi-parametric conditional MRL models, and propose two nonparametric methods of estimating the conditional MRL function. Asymptotic properties such as consistency and normality of our proposed estimators are established. We investigate via simulation study the empirical properties of the proposed estimators, including bootstrap pointwise confidence intervals. Using Monte Carlo simulations we compare the proposed nonparametric estimators to two popular semi-parametric methods of analysis, for varying types of data. The proposed estimators are demonstrated on the Veteran’s Administration lung cancer trial.     

Modified moment and maximum likelihood estimators for parameters of the three-parameter gamma distribution

This article is concerned with modifications of both maximum likelihood and moment estimators for parameters of the three-parameter gamma distribution. Modifications employed here are essentially the same as those previously considered by the authors (1980, 1981) in connection with the lognormal distribution. Sampling behavior of the estimates is indicated by a Monte Carlo simulation. For certain combinations of parameter values, these new estimators appear better than both maximum likelihood and moment estimators with respect to bias, variance and/or ease of calculation.     

Optimal estimators for the importance sampling method

The Monte Carlo method gives some estimators to evaluate the expectation [ILM0001] based on samples from either the true density f or from some instrumental density. In this paper, we show that the Riemann estimators introduced by Philippe (1997) can be improved by using the importance sampling method. This approach produces a class of Monte Carlo estimators such that the variance is of order O(n ^?2). The choice of an optimal estimator among this class is discussed. Some simulations illustrate the improvement brought by this method. Moreover, we give a criterion to assess the convergence of our optimal estimator to the integral of interest.     

Almost Consistent Estimation of Panel Probit Models with “Small” Fixed Effects

We propose four different GMM estimators that allow almost consistent estimation of the structural parameters of panel probit models with fixed effects for the case of small Tand large N. The moments used are derived for each period from a first order approximation of the mean of the dependent variable conditional on explanatory variables and on the fixed effect. The estimators differ w.r.t. the choice of instruments and whether they use trimming to reduce the bias or not. In a Monte Carlo study, we compare these estimators with pooled probit and conditional logit estimators for different data generating processes. The results show that the proposed estimators outperform these competitors in several situations.