pith. sign in

arxiv: 1004.1855 · v1 · submitted 2010-04-11 · 💱 q-fin.CP

Fast Correlation Greeks by Adjoint Algorithmic Differentiation

classification 💱 q-fin.CP
keywords computationaloptionadjointalgorithmicassetscarlocorrelationcost
0
0 comments X
read the original abstract

We show how Adjoint Algorithmic Differentiation (AAD) allows an extremely efficient calculation of correlation Risk of option prices computed with Monte Carlo simulations. A key point in the construction is the use of binning to simultaneously achieve computational efficiency and accurate confidence intervals. We illustrate the method for a copula-based Monte Carlo computation of claims written on a basket of underlying assets, and we test it numerically for Portfolio Default Options. For any number of underlying assets or names in a portfolio, the sensitivities of the option price with respect to all the pairwise correlations is obtained at a computational cost which is at most 4 times the cost of calculating the option value itself. For typical applications, this results in computational savings of several order of magnitudes with respect to standard methods.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.