![]() |
![]() |
University of Birmingham > Talks@bham > Theoretical computer science seminar > Automatic differentiation in string diagrams
Automatic differentiation in string diagramsAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Dan Ghica. Reverse-mode automatic differentiation, especially in the presence of complex language features, is notoriously hard to implement correctly, and most implementations focus on differentiating straight-line imperative first-order code. Generalisations exist, however, that can tackle more advanced features; for example, the algorithm described by Pearlmutter and Siskind in their 2008 paper can differentiate higher-order functions written in a pure functional language. We show that AD algorithms can benefit enormously from being translated into the language of string diagrams in two steps: first, we describe a Pearlmutter-Siskind style AD algorithm as a set of rules for transforming hierarchical graphs; rules which can This talk is part of the Theoretical computer science seminar series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsMolecular and Medical Physics Seminar Series Dinner Table Terrorism - Achieving Food Security BritGrav 15Other talksTBA TBA Quantum Sensing in Space Life : it’s out there, but what and why ? TBA Ultrafast Spectroscopy and Microscopy as probes of Energy Materials |