Chebyshev 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 Carlo simulation: in these cases, it is hard to find a fast and accurate approximation of Greeks, mainly because of the need of a tradeoff between bias and variance. Recent improvements in Greeks computation, such as Adjoint Algorithmic Differentiation, are unfortunately uneffective on second order Greeks (such as Gamma), which are plagued by the most significant instabilities, so that a viable alternative to standard finite differences is still lacking. We apply Chebyshev interpolation techniques to the computation of spot Greeks, showing how to improve the stability of finite difference Greeks of arbitrary order, in a simple and general way. The increased performance of the proposed technique is analyzed for a number of real payoffs commonly traded by financial institutions.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Failure of Fourier pricing techniques to approximate the Greeks
The Greeks Delta and Gamma of plain vanilla options play a fundamental role in finance, e.g., in hedging or risk management. These Greeks are approximated in many models such as the widely used Variance Gamma model by Fo…
ManagementQuasi-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…
CPUGPUManagementEffective 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 opti…
Dimensionality ReductionSensitivityFaster Principal Component Regression and Stable Matrix Chebyshev Approximation
We solve principal component regression (PCR), up to a multiplicative accuracy $1+\gamma$, by reducing the problem to $\tilde{O}(\gamma^{-1})$ black-box calls of ridge regression. Therefore, our algorithm does not requir…
regressionNumerical Smoothing with Hierarchical Adaptive Sparse Grids and Quasi-Monte Carlo Methods for Efficient Option Pricing
When approximating the expectations of a functional of a solution to a stochastic differential equation, the numerical performance of deterministic quadrature methods, such as sparse grid quadrature and quasi-Monte Carlo…
Numerical Integration