Grant: Discovery Grants Program - Individual
University of Waterloo
$34,000.00
Large-scale Application of Automatic Differentiation in Computational Finance (and beyond)
EF 2017-18
Résumé
Summary of Proposal: Large-scale Application of Automatic Differentiation in Computational Finance (and beyond) The field of Automatic Differentiation (AD) has taken great strides in recent years. Nevertheless, AD is not heavily used for large-scale problems often due to efficiency concerns. This is true in many application areas, including economics and finance. For example, large portfolios of variable annuities can take many hours to evaluate by standard methods; hedging, typically requiring the determination of derivatives, would require significantly more time. Clearly, any rapid hedging methods based on derivatives for such portfolios is problematic. This poses a serious challenge for effective risk management. Similar challenges exist for other portfolios (e.g., Credit Value Adjustment (CVAs)). We propose research to increase the efficiency and applicability of AD to large-scale structured problems. While our proposed advances are applicable to many branches of computational science and engineering, we emphasize computational finance and risk management applications. AD technology has become more efficient in recent years. We have been involved in the adaption of AD methodology to problems with structure, working under the assumption that most practical large-scale problems are structured. A general and practical definition of a structured problem is given in ([1], 4.16) . The idea is that the function can be written as a (partially ordered) sequence of steps -- each step is a nonlinear mapping in itself and is a (sub-) function of previously defined (intermediate) variables. This structure definition captures composite function computations (i.e., a sequence of chained computations), generalized partially separable functions, and (nested) Monte-Carlo functions (and many other common structures). As indicated in previous work this structure covers many applications and is often the most natural way to express the evaluation code . Given a code that exposes this structure AD can be applied in a slice-by-slice manner to gain significant efficiency (both in space and time). Generally this gain is because the Jacobians of the component functions are either sparse (i.e., hidden sparsity) or compact (with few rows), whereas the Jacobian of the overall (original objective) function is often dense. In conclusion, the determination of derivatives is a fundamental computational task in much of computational science and engineering. The ideas we propose here can have a very significant impact across these areas - certainly with respect to applied optimization problems, as well as our target class:sensitivity problems in computational finance/risk management. [1] Automatic Differentiation in MATLAB Using ADMAT with Applications. Thomas F. Coleman and Wei Xu, SIAM, 2016.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Ontario, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
RGPIN-2017-03860
Name nom
Coleman, Thomas
Department département
Combinatorics and Optimization - Combinatorics and Optimization
Organization id
33
Institution établissement
University of Waterloo
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2017
Competition year année de concours
2017
Award amount
34000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
1507
Committee name en
Computer Science
Committee name fr
Sciences informatiques
Area of application code
801
Area of application group en
Information and communication services
Area of application group fr
Services d'information et de télécommunications
Area of application en
Computer software
Area of application fr
Logiciel
Research subject code
2952
Research subject group en
Applied mathematics
Research subject group fr
Mathématiques appliquées
Research subject en
Linear and non-linear systems
Research subject fr
Systèmes linéaires et non linéaires
Partie
1
Nb partie
5
Application title
Large-scale Application of Automatic Differentiation in Computational Finance (and beyond)
Keyword
NSERC
Application summary
Summary of Proposal: Large-scale Application of Automatic Differentiation in Computational Finance (and beyond) The field of Automatic Differentiation (AD) has taken great strides in recent years. Nevertheless, AD is not heavily used for large-scale problems often due to efficiency concerns. This is true in many application areas, including economics and finance. For example, large portfolios of variable annuities can take many hours to evaluate by standard methods; hedging, typically requiring the determination of derivatives, would require significantly more time. Clearly, any rapid hedging methods based on derivatives for such portfolios is problematic. This poses a serious challenge for effective risk management. Similar challenges exist for other portfolios (e.g., Credit Value Adjustment (CVAs)). We propose research to increase the efficiency and applicability of AD to large-scale structured problems. While our proposed advances are applicable to many branches of computational science and engineering, we emphasize computational finance and risk management applications. AD technology has become more efficient in recent years. We have been involved in the adaption of AD methodology to problems with structure, working under the assumption that most practical large-scale problems are structured. A general and practical definition of a structured problem is given in ([1], 4.16) . The idea is that the function can be written as a (partially ordered) sequence of steps -- each step is a nonlinear mapping in itself and is a (sub-) function of previously defined (intermediate) variables. This structure definition captures composite function computations (i.e., a sequence of chained computations), generalized partially separable functions, and (nested) Monte-Carlo functions (and many other common structures). As indicated in previous work this structure covers many applications and is often the most natural way to express the evaluation code . Given a code that exposes this structure AD can be applied in a slice-by-slice manner to gain significant efficiency (both in space and time). Generally this gain is because the Jacobians of the component functions are either sparse (i.e., hidden sparsity) or compact (with few rows), whereas the Jacobian of the overall (original objective) function is often dense. In conclusion, the determination of derivatives is a fundamental computational task in much of computational science and engineering. The ideas we propose here can have a very significant impact across these areas - certainly with respect to applied optimization problems, as well as our target class:sensitivity problems in computational finance/risk management. [1] Automatic Differentiation in MATLAB Using ADMAT with Applications. Thomas F. Coleman and Wei Xu, SIAM, 2016.