Adjoint Greeks made easy

Luca Capriotti and Michael Giles show how algorithmic differentiation can be used to systematically implement the adjoint calculation of sensitivities in Monte Carlo for general path-dependent and multi-asset options, with minimal analytical effort. With several examples, they illustrate the workings of this technique and demonstrate how it can be straightforwardly implemented to reduce the time required for the computation of the risk of any portfolio by orders of magnitude


The renewed emphasis of the financial industry on quantitatively sound risk management practices comes with formidable computational challenges. Computationally intensive Monte Carlo simulations are often the only practical tool available, and standard approaches for the calculation of risk require repeated simulation of a portfolio’s profit and loss.

Adjoint Greeks made easy

Only users who have a paid subscription or are part of a corporate subscription are able to print or copy content.

To access these options, along with all other subscription benefits, please contact or view our subscription options here:

You are currently unable to copy this content. Please contact to find out more.

Sorry, our subscription options are not loading right now

Please try again later. Get in touch with our customer services team if this issue persists.

New to View our subscription options

You need to sign in to use this feature. If you don’t have a account, please register for a trial.

Sign in
You are currently on corporate access.

To use this feature you will need an individual account. If you have one already please sign in.

Sign in.

Alternatively you can request an individual account here