Algorithmic Differentiation: Adjoint Greeks Made Easy

12 Pages Posted: 4 Apr 2011

See all articles by Luca Capriotti

Luca Capriotti

University College London; NYU Polytechnic School of Engineering - Department of Finance and Risk Engineering

Michael B. Giles

University of Oxford - Oxford-Man Institute of Quantitative Finance

Date Written: April 2, 2011

Abstract

We show how algorithmic differentiation can be used as a design paradigm to implement the adjoint calculation of sensitivities in Monte Carlo in full generality and with minimal analytical effort. With several examples we 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.

Keywords: Algorithmic Differentiation, Monte Carlo Simulations, Derivatives Pricing

Suggested Citation

Capriotti, Luca and Giles, Michael B., Algorithmic Differentiation: Adjoint Greeks Made Easy (April 2, 2011). Available at SSRN: https://ssrn.com/abstract=1801522 or http://dx.doi.org/10.2139/ssrn.1801522

Luca Capriotti (Contact Author)

University College London ( email )

Gower Street
London, WC1E 6BT
United Kingdom

NYU Polytechnic School of Engineering - Department of Finance and Risk Engineering ( email )

Brooklyn, NY 11201
United States

Michael B. Giles

University of Oxford - Oxford-Man Institute of Quantitative Finance ( email )

Eagle House
Walton Well Road
Oxford, Oxfordshire OX2 6ED
United Kingdom

Register to save articles to
your library

Register

Paper statistics

Downloads
2,262
Abstract Views
7,233
rank
5,860
PlumX Metrics