Effective dimensionality reduction for Greeks computation using Randomized QMC
Global sensitivity analysis is employed to evaluate the effective dimension reduction achieved through Chebyshev interpolation and the conditional pathwise method for Greek estimation of discretely monitored barrier options and arithmetic average Asian options. We compare results from finite difference and Monte Carlo methods with those obtained by using randomized Quasi Monte Carlo combined with Brownian bridge discretization. Additionally, we investigate the benefits of incorporating importance sampling with either the finite difference or Chebyshev interpolation methods. Our findings demonstrate that the reduced effective dimensionality identified through global sensitivity analysis explains the performance advantages of one approach over another. Specifically, the increased smoothness provided by Chebyshev or conditional pathwise methods enhances the convergence rate of randomized Quasi Monte Carlo integration, leading to the significant increase of accuracy and reduced computational costs.
Code (0)
등록된 구현이 없습니다.
Tasks
Dimensionality ReductionSensitivitySimilar Papers 제목 키워드 기반
Randomized ICA and LDA Dimensionality Reduction Methods for Hyperspectral Image Classification
Dimensionality reduction is an important step in processing the hyperspectral images (HSI) to overcome the curse of dimensionality problem. Linear dimensionality reduction methods such as Independent component analysis (…
Dimensionality ReductionGeneral ClassificationHyperspectral Image Classificationimage-classification+1Quasi-Monte Carlo methods for calculating derivatives sensitivities on the GPU
The calculation of option Greeks is vital for risk management. Traditional pathwise and finite-difference methods work poorly for higher-order Greeks and options with discontinuous payoff functions. The Quasi-Monte Carlo…
CPUGPUManagementChebyshev Greeks: Smoothing Gamma without Bias
The computation of Greeks is a fundamental task for risk managing of financial instruments. The standard approach to their numerical evaluation is via finite differences. Most exotic derivatives are priced via Monte Carl…
Randomized Dimensionality Reduction for Euclidean Maximization and Diversity Measures
Randomized dimensionality reduction is a widely-used algorithmic technique for speeding up large-scale Euclidean optimization problems. In this paper, we study dimension reduction for a variety of maximization problems, …
Dimensionality ReductionDiversityComputation of first-order Greeks for barrier options using chain rules for Wiener path integrals
This paper presents a new methodology to compute first-order Greeks for barrier options under the framework of path-dependent payoff functions with European, Lookback, or Asian type and with time-dependent trigger levels…