奇异多资产路径依赖期权的定价需要大量的蒙特卡罗模拟。近年来,人们对拟蒙特卡罗方法重新产生了兴趣,并提出了一些结果,以提高其效率与有效维数的概念。为此,Imai和Tan引入了一种通用方差缩减技术,以最小化蒙特卡罗方法的名义维度。考虑到这些优点,我们详细研究了这种方法,以便从计算的角度来看,使其更快。事实上,我们实现了线性变换分解依赖于一个快速的ad hoc QR分解,大大减少了计算负担。从计算的观点来看,这种设置使得线性变换方法更加方便。本文利用高维(2500)拟蒙特卡罗方法结合线性变换对亚式一篮子期权进行了定价。对于高维随机样本的模拟,我们使用一个50维的乱序Sobol序列的前50个组件,由线性变换方法确定,并填补了其余的拉丁超立方采样。该数值设置的目的是通过仅对由线性变换技术选择的那些分量给出更高的收敛速度来研究估计的准确性。我们还使用标准的Cholesky和主成分分解方法与伪随机和拉丁超立方体采样生成器来启动我们的模拟实验。最后,我们比较我们的结果和计算时间,与那些在今井和谭。
英文摘要:
Pricing exotic multi-asset path-dependent options requires extensive Monte Carlo simulations. In the recent years the interest to the Quasi-monte Carlo technique has been renewed and several results have been proposed in order to improve its efficiency with the notion of effective dimension. To this aim, Imai and Tan introduced a general variance reduction technique in order to minimize the nominal dimension of the Monte Carlo method. Taking into account these advantages, we investigate this approach in detail in order to make it faster from the computational point of view. Indeed, we realize the linear transformation decomposition relying on a fast ad hoc QR decomposition that considerably reduces the computational burden. This setting makes the linear transformation method even more convenient from the computational point of view. We implement a high-dimensional (2500) Quasi-Monte Carlo simulation combined with the linear transformation in order to price Asian basket options with same set of parameters published by Imai and Tan. For the simulation of the high-dimensional random sample, we use a 50-dimensional scrambled Sobol sequence for the first 50 components, determined by the linear transformation method, and pad the remaining ones out by the Latin Hypercube Sampling. The aim of this numerical setting is to investigate the accuracy of the estimation by giving a higher convergence rate only to those components selected by the linear transformation technique. We launch our simulation experiment also using the standard Cholesky and the principal component decomposition methods with pseudo-random and Latin Hypercube sampling generators. Finally, we compare our results and computational times, with those presented in Imai and Tan.
Identifying the Optimal Integration Time in Hamiltonian Monte Carlo
通过利用光滑概率系统的自然几何结构,哈密顿蒙特卡罗产生计算效率高的马尔可夫链蒙特卡罗估计。至少在算法足够好的情况下。在本文中,我将展示如何几何基础的哈密顿蒙特卡罗隐含地确定这些参数的最佳选择,特别是积分时间。然后,我认为这些原则在现有的算法和一个新的实现称为\emph{Exhaustive Hamiltonian Monte Carlo}的实际后果,然后在一些说明性的例子证明这些想法的效用。
Some Contributions to Sequential Monte Carlo Methods for Option Pricing
期权定价是金融工程中的一个重要问题。在许多具有实际意义的场景中,与标的资产相关的金融期权价格简化为计算w.r.t.~扩散过程。一般来说,这些期望值无法通过分析计算,而近似这些数量的一种方法是通过蒙特卡罗方法;蒙特卡罗方法至少从20世纪70年代开始就被用于期权定价。在Del Moral,P.\& Shevchenko,P.V.(2014)"Valuation of barrier options using序贯蒙特卡罗"和Jasra,A. \& Del Moral,P.(2011)"期权定价的序贯蒙特卡罗",序贯蒙特卡罗(SMC)方法是应用于这种情况的自然工具,可以大大改善标准蒙特卡罗。在本文中,本着类似的精神,Del Moral,P.\& Shevchenko,P.V.(2014)"Valuation of barrier options using序贯蒙特卡罗"和Jasra,A. \& Del Moral,P.(2011)"期权定价的序贯蒙特卡罗"我们表明,通过构建一系列人工目标密度随时间的推移使用SMC方法可以实现显着收益。特别是,我们近似的最佳重要性抽样分布的SMC算法,通过使用一系列的加权函数。这是证明了两个例子,障碍期权和目标应计赎回票据(TARN的)。我们还提供了我们的SMC估计的无偏性的证明。