Principles and Techniques of Automatic Differentiation

Add to your list(s) Download to your calendar using vCal

• Laurent Hascoët, INRIA
• Friday 06 December 2013, 10:00-11:00
• Auditorium, Microsoft Research Ltd, 21 Station Road, Cambridge, CB1 2FB.

If you have a question about this talk, please contact Microsoft Research Cambridge Talks Admins.

This event may be recorded and made available internally or externally via http://research.microsoft.com. Microsoft will own the copyright of any recordings made. If you do not wish to have your image/voice recorded please consider this before attending

Computing accurate derivatives of a numerical model is a crucial task in many domains of Scientific Computing, in particular for gradient-based optimization and inverse problems. Automatic Differentiation (AD) is a software technique to obtain derivatives of functions provided as programs. Given a numerical model F implemented as a program P, AD adapts or transforms P into a new program that computes derivatives of F. We show the mathematical formalization that both justifies AD and explains its limitations. We shortly describe the software analyses that allow AD tools to produce more efficient code. We focus on the adjoint mode of AD, arguably the only way to obtain gradients at a reasonable cost, and show two real Scientific Computing applications. We give a brief panorama of current AD tools and conclude on research directions.

This talk is part of the Microsoft Research Cambridge, public talks series.

This talk is included in these lists:

• All Talks (aka the CURE list)
• Auditorium, Microsoft Research Ltd, 21 Station Road, Cambridge, CB1 2FB
• Cambridge Centre for Data-Driven Discovery (C2D3)
• Cambridge talks
• Chris Davis' list
• Guy Emerson's list
• Interested Talks
• Microsoft Research Cambridge, public talks
• Optics for the Cloud
• PMRFPS's
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31
• ndk22's list
• personal list
• rp587

Note that ex-directory lists are not shown.