Provably correct, asymptotically efficient, higher-order reverse-mode automatic differentiation
Published version
Peer-reviewed
Repository URI
Repository DOI
Change log
Authors
Krawiec, F
Peyton Jones, S
Krishnaswami, Neel https://orcid.org/0000-0003-2838-5865
Ellis, T
Eisenberg, RA
Abstract
jats:pIn this paper, we give a simple and efficient implementation of reverse-mode automatic differentiation, which both extends easily to higher-order functions, and has run time and memory consumption linear in the run time of the original program. In addition to a formal description of the translation, we also describe an implementation of this algorithm, and prove its correctness by means of a logical relations argument.</jats:p>
Description
Keywords
Reverse-Mode AD, Wengert List, Higher-Order Functions
Journal Title
Proceedings of the ACM on Programming Languages
Conference Name
Journal ISSN
2475-1421
2475-1421
2475-1421
Volume Title
6
Publisher
Association for Computing Machinery (ACM)