{"id":{"repo_id":"cape-town","oai_identifier":"oai:open.uct.ac.za:11427/25412"},"canonical_url":"https://search.dev.ndltd.org/etd/cape-town/oai:open.uct.ac.za:11427/25412","repository":{"repo_id":"cape-town","name":"University of Cape Town","base_url":"https://open.uct.ac.za/oai/request"},"display":{"title":"Adjoint Venture: Fast Greeks with Adjoint Algorithmic Differentiation","abstract":"This dissertation seeks to discuss the adjoint approach to solving affine recursion problems (ARPs) in the context of computing sensitivities of financial instruments. It is shown how, by moving from an intuitive 'forward' approach to solving a recursion to an 'adjoint' approach, one might dramatically increase the computational efficiency of algorithms employed to compute sensitivities via the pathwise derivatives approach in a Monte Carlo setting. Examples are illustrated within the context of the Libor Market Model. Furthermore, these ideas are extended to the paradigm of Adjoint Algorithmic Differentiation, and it is illustrated how the use of sophisticated techniques within this space can further improve the ease of use and efficiency of sensitivity calculations.","abstract_html":"This dissertation seeks to discuss the adjoint approach to solving affine recursion problems (ARPs) in the context of computing sensitivities of financial instruments. It is shown how, by moving from an intuitive 'forward' approach to solving a recursion to an 'adjoint' approach, one might dramatically increase the computational efficiency of algorithms employed to compute sensitivities via the pathwise derivatives approach in a Monte Carlo setting. Examples are illustrated within the context of the Libor Market Model. Furthermore, these ideas are extended to the paradigm of Adjoint Algorithmic Differentiation, and it is illustrated how the use of sophisticated techniques within this space can further improve the ease of use and efficiency of sensitivity calculations.","abstract_has_math":false,"creators":["McPetrie, Christopher Lindsay"],"institution":"Division of Actuarial Science","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":["McWalter, Thomas"],"committee_chairs":[],"committee_members":[],"year":2017,"date_issued":"2017","date_published":"2017","updated_at":"2026-07-22T22:23:31Z","subjects":[],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/11427/25412","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["McWalter, Thomas"]},{"key":"dc:creator","label":"Author","values":["McPetrie, Christopher Lindsay"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2017-09-26T14:57:45Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2017-09-26T14:57:45Z"]},{"key":"dc:date.issued","label":"Date","values":["2017"]},{"key":"dc:publisher.department","label":"Dc Publisher Department","values":["Division of Actuarial Science"]},{"key":"dc:publisher.institution","label":"Dc Publisher Institution","values":["University of Cape Town"]},{"key":"dc:type","label":"Dc Type","values":["Master Thesis"]},{"key":"dc:type.qualificationlevel","label":"Dc Type Qualificationlevel","values":["Masters"]},{"key":"dc:type.qualificationname","label":"Dc Type Qualificationname","values":["MPhil"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/11427/25412"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["This dissertation seeks to discuss the adjoint approach to solving affine recursion problems (ARPs) in the context of computing sensitivities of financial instruments. It is shown how, by moving from an intuitive 'forward' approach to solving a recursion to an 'adjoint' approach, one might dramatically increase the computational efficiency of algorithms employed to compute sensitivities via the pathwise derivatives approach in a Monte Carlo setting. Examples are illustrated within the context of the Libor Market Model. Furthermore, these ideas are extended to the paradigm of Adjoint Algorithmic Differentiation, and it is illustrated how the use of sophisticated techniques within this space can further improve the ease of use and efficiency of sensitivity calculations."]},{"key":"dc:title","label":"Title","values":["Adjoint Venture: Fast Greeks with Adjoint Algorithmic Differentiation"]}]}],"canonical_facts":{"dc:contributor.advisor":["McWalter, Thomas"],"dc:creator":["McPetrie, Christopher Lindsay"],"dc:date.accessioned":["2017-09-26T14:57:45Z"],"dc:date.available":["2017-09-26T14:57:45Z"],"dc:date.issued":["2017"],"dc:description.abstract":["This dissertation seeks to discuss the adjoint approach to solving affine recursion problems (ARPs) in the context of computing sensitivities of financial instruments. It is shown how, by moving from an intuitive 'forward' approach to solving a recursion to an 'adjoint' approach, one might dramatically increase the computational efficiency of algorithms employed to compute sensitivities via the pathwise derivatives approach in a Monte Carlo setting. Examples are illustrated within the context of the Libor Market Model. Furthermore, these ideas are extended to the paradigm of Adjoint Algorithmic Differentiation, and it is illustrated how the use of sophisticated techniques within this space can further improve the ease of use and efficiency of sensitivity calculations."],"dc:identifier.uri":["http://hdl.handle.net/11427/25412"],"dc:language.iso":["eng"],"dc:publisher.department":["Division of Actuarial Science"],"dc:publisher.institution":["University of Cape Town"],"dc:title":["Adjoint Venture: Fast Greeks with Adjoint Algorithmic Differentiation"],"dc:type":["Master Thesis"],"dc:type.qualificationlevel":["Masters"],"dc:type.qualificationname":["MPhil"]},"updated_at":"2026-07-22T22:23:31Z"}