Bias Reduction for Pricing American Options by Least-Squares Monte Carlo

Abstract

We derive an approximation to the bias in regression-based Monte Carlo estimators of American option values. This derivation holds for general asset-price processes of any dimensionality and for general pay-off structures. It uses the large sample properties of least-squares regression estimators. Bias-corrected estimators result by subtracting the bias approximation from the uncorrected estimator at each exercise opportunity. Numerical results show that the bias-corrected estimator outperforms its uncorrected counterpart across all combinations of number of exercise opportunities, option moneyness and sample size. Finally, the results suggest significant computational efficiency increases can be realized through trivial parallel implementations using the corrected estimator.     

Sequential Monte Carlo Samplers: Error Bounds and Insensitivity to Initial Conditions

This article addresses finite sample stability properties of sequential Monte Carlo methods for approximating sequences of probability distributions. The results presented herein are applicable in the scenario where the start and end distributions in the sequence are fixed and the number of intermediate steps is a parameter of the algorithm. Under assumptions which hold on noncompact spaces, it is shown that the effect of the initial distribution decays exponentially fast in the number of intermediate steps and the corresponding stochastic error is stable in 𝕃 _p norm.     

On solving integral equations using Markov chain Monte Carlo methods

In this paper, we propose an original approach to the solution of Fredholm equations of the second kind. We interpret the standard Von Neumann expansion of the solution as an expectation with respect to a probability distribution defined on a union of subspaces of variable dimension. Based on this representation, it is possible to use trans-dimensional Markov chain Monte Carlo (MCMC) methods such as Reversible Jump MCMC to approximate the solution numerically. This can be an attractive alternative to standard Sequential Importance Sampling (SIS) methods routinely used in this context. To motivate our approach, we sketch an application to value function estimation for a Markov decision process. Two computational examples are also provided.     

A Practical Sequential Stopping Rule for High-Dimensional Markov Chain Monte Carlo

A current challenge for many Bayesian analyses is determining when to terminate high-dimensional Markov chain Monte Carlo simulations. To this end, we propose using an automated sequential stopping procedure that terminates the simulation when the computational uncertainty is small relative to the posterior uncertainty. Further, we show this stopping rule is equivalent to stopping when the effective sample size is sufficiently large. Such a stopping rule has previously been shown to work well in settings with posteriors of moderate dimension. In this article, we illustrate its utility in high-dimensional simulations while overcoming some current computational issues. As examples, we consider two complex Bayesian analyses on spatially and temporally correlated datasets. The first involves a dynamic space-time model on weather station data and the second a spatial variable selection model on fMRI brain imaging data. Our results show the sequential stopping rule is easy to implement, provides uncertainty estimates, and performs well in high-dimensional settings. Supplementary materials for this article are available online.     

方差Gamma过程与期权定价

研究了几何Levy过程中，具有代表性的一类过程-方差Gamma过程下的等价鞅测度类问题，并且讨论了其具有的分析性质．进一步，我们也考虑了基于该过程的普通期权的定价．     

Adaptive Sequential Monte Carlo for Multiple Changepoint Analysis

Process monitoring and control requires the detection of structural changes in a data stream in real time. This article introduces an efficient sequential Monte Carlo algorithm designed for learning unknown changepoints in continuous time. The method is intuitively simple: new changepoints for the latest window of data are proposed by conditioning only on data observed since the most recent estimated changepoint, as these observations carry most of the information about the current state of the process. The proposed method shows improved performance over the current state of the art. Another advantage of the proposed algorithm is that it can be made adaptive, varying the number of particles according to the apparent local complexity of the target changepoint probability distribution. This saves valuable computing time when changes in the changepoint distribution are negligible, and enables rebalancing of the importance weights of existing particles when a significant change in the target distribution is encountered. The plain and adaptive versions of the method are illustrated using the canonical continuous time changepoint problem of inferring the intensity of an inhomogeneous Poisson process, although the method is generally applicable to any changepoint problem. Performance is demonstrated using both conjugate and nonconjugate Bayesian models for the intensity. Appendices to the article are available online, illustrating the method on other models and applications.     

基于跳扩散模型欧式期权定价的条件二叉树方法

对股票价格的跳扩散模型进行了分析,在CRR二叉树期权定价模型的基础上考虑标的股票价格发生跳跃的情况,得出基于跳扩散过程的股票期权的条件二叉树定价模型,并且证明在极限情况下,该条件二叉树模型的期权定价公式趋于Merton的解析定价公式,数值试验证实该条件二叉树模型的有效性。     

MC方差减小技术在算术平均亚式外汇期权定价中的应用

建立了利率和汇率波动率均为随机情形下算术平均亚式外汇期权的定价模型.由于其定价问题求解十分困难,运用蒙特卡罗(Monte Carlo)方法并结合控制变量方差减小技术进行模拟,有效地减小了模拟方差,得到了期权定价问题的数值结果.     

Weighted Monte Carlo Methods for Approximate Solution of a Nonlinear Boltzmann Equation

We construct weighted modifications of statistical modeling of an ensemble of interacting particles which is connected with approximate solution of a nonlinear Boltzmann equation.     

Stochastic Approximation Algorithms for Parameter Estimation in Option Pricing with Regime Switching

Abstract

This work is concerned with option pricing. Stochastic approximation/optimization algorithms are proposed and analyzed. The underlying stock price evolves according to two geometric Brownian motions coupled by a continuous-time finite state Markov chain. Recursive stochastic approximation algorithms are developed to estimate the implied volatility. Convergence of the algorithm is proved. Rate of convergence is also ascertained. Then real market data are used to compare our algorithms with other schemes.     

基于混合规避策略的期权定价及其数值分析

考虑现实市场中红利的存在、波动率等参数随时间变化以及交易时间不连续产生的对冲风险不可忽略,研究离散时间、支付红利条件下基于混合规避策略的期权定价模型.由平均自融资-极小方差规避策略得到相应欧式看涨期权定价方程,并且分别使用偏微分方法和概率论方法得到统一的闭形解.数值分析表明,与经典的期权定价模型相比,新模型中的期权价格更接近对冲成本.     

Option Pricing for Time-Change Exponential Levy Model Under Memm

The purpose of this article is to study the rational evaluation of European options price when the underlying price process is described by a time-change Levy process. European option pricing formula is obtained under the minimal entropy martingale measure （MEMM） and applied to several examples of particular time-change Levy processes. It can be seen that the framework in this paper encompasses the Black-Scholes model and almost all of the models proposed in the subordinated market.     

Fourier Inversion Formulas in Option Pricing and Insurance

Several authors have used Fourier inversion to compute prices of puts and calls, some using Parseval’s theorem. The expected value of max (S – K, 0) also arises in excess-of-loss or stop-loss insurance, and we show that Fourier methods may be used to compute them. In this paper, we take the idea of using Parseval’s theorem further: (1) formulas requiring weaker assumptions; (2) relationship with classical inversion theorems for probability distributions; (3) formulas for payoffs which occur in insurance. Numerical examples are provided.      

基于贝叶斯MCMC算法的美式期权定价

鉴于美式期权的定价具有后向迭代搜索特征,本文结合Longstaff和Schwartz提出的美式期权定价的最小二乘模拟方法,研究基于马尔科夫链蒙特卡洛算法对回归方程系数的估计,实现对美式期权的双重模拟定价.通过对无红利美式看跌股票期权定价进行大量实证模拟,从期权价值定价误差等方面同著名的最小二乘蒙特卡洛模拟方法进行对比分析,结果表明基于MCMC回归算法给出的美式期权定价具有更高的精确度.模拟实证结果表明本文提出的对美式期权定价方法具有较好的可行性、有效性与广泛的适用性.该方法的不足之处就是类似于一般的蒙特卡洛方法,会使得求解的计算量有所加大.     

Dynamically Rescaled Hamiltonian Monte Carlo for Bayesian Hierarchical Models

Dynamically rescaled Hamiltonian Monte Carlo is introduced as a computationally fast and easily implemented method for performing full Bayesian analysis in hierarchical statistical models. The method relies on introducing a modified parameterization so that the reparameterized target distribution has close to constant scaling properties, and thus is easily sampled using standard (Euclidian metric) Hamiltonian Monte Carlo. Provided that the parameterizations of the conditional distributions specifying the hierarchical model are “constant information parameterizations” (CIPs), the relation between the modified- and original parameterization is bijective, explicitly computed, and admit exploitation of sparsity in the numerical linear algebra involved. CIPs for a large catalogue of statistical models are presented, and from the catalogue, it is clear that many CIPs are currently routinely used in statistical computing. A relation between the proposed methodology and a class of explicitly integrated Riemann manifold Hamiltonian Monte Carlo methods is discussed. The methodology is illustrated on several example models, including a model for inflation rates with multiple levels of nonlinearly dependent latent variables. Supplementary materials for this article are available online.     

基于GARCH-GH模型的上证50ETF期权定价研究

上证50ETF期权是中国推出的首支股票期权.为描述上证50ETF收益率偏态、尖峰、时变波动率等特征,结合GARCH模型和广义双曲(Generalized Hyperbolic,GH)分布两方面的优势,建立GARCH-GH模型为上证50ETF期权定价.在等价鞅测度下,利用蒙特卡罗方法估计上证50ETF欧式认购期权价格.实证表明,相比较Black-Scholes模型和GARCH-Gaussian模型,GARCH-GH模型得到的结果更接近于上证50ETF期权的实际价格,其定价误差最小.     

Multilevel Monte Carlo in approximate Bayesian computation

In the following article, we consider approximate Bayesian computation (ABC) inference. We introduce a method for numerically approximating ABC posteriors using the multilevel Monte Carlo (MLMC). A sequential Monte Carlo version of the approach is developed and it is shown under some assumptions that for a given level of mean square error, this method for ABC has a lower cost than i.i.d. sampling from the most accurate ABC approximation. Several numerical examples are given.     

Monte Carlo optimization

Monte Carlo optimization techniques for solving mathematical programming problems have been the focus of some debate. This note reviews the debate and puts these stochastic methods in their proper perspective.     

拟蒙特卡罗法在亚洲期权定价中的应用

亚洲期权是场外交易中几种最受欢迎的新型期权之一,但它的价格却没有解析表达式,到目前为止,亚洲期权的定价仍是个公开问题.本文采用拟蒙特卡罗法中的Halton序列来估计它的价格,数值结果表明当观察点的个数N13时,它比蒙特卡罗法要好.本文还利用MATLAB程序生成了随机Halton序列,并将它与控制变量法结合起来估计亚洲期权的价格,估计值标准差的比较表明它在大多情况下比相应的蒙特卡罗法的估计效果要好.     

Noisy Hamiltonian Monte Carlo for Doubly Intractable Distributions

Hamiltonian Monte Carlo (HMC) has been progressively incorporated within the statistician’s toolbox as an alternative sampling method in settings when standard Metropolis–Hastings is inefficient. HMC generates a Markov chain on an augmented state space with transitions based on a deterministic differential flow derived from Hamiltonian mechanics. In practice, the evolution of Hamiltonian systems cannot be solved analytically, requiring numerical integration schemes. Under numerical integration, the resulting approximate solution no longer preserves the measure of the target distribution, therefore an accept–reject step is used to correct the bias. For doubly intractable distributions—such as posterior distributions based on Gibbs random fields—HMC suffers from some computational difficulties: computation of gradients in the differential flow and computation of the accept–reject proposals poses difficulty. In this article, we study the behavior of HMC when these quantities are replaced by Monte Carlo estimates. Supplemental codes for implementing methods used in the article are available online.