Reference. Provably correct, asymptotically efficient, higher-order reverse-mode automatic differentiation

In 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.

Cite

Cite as @krawiec-2022-provably (helia, typst) · \cite{krawiec-2022-provably} (LaTeX)
BibTeX
bibtex · 1 line
@article{krawiec-2022-provably, title={Provably correct, asymptotically efficient, higher-order reverse-mode automatic differentiation}, volume={6}, ISSN={2475-1421}, url={http://dx.doi.org/10.1145/3498710}, DOI={10.1145/3498710}, number={POPL}, journal={Proceedings of the ACM on Programming Languages}, publisher={Association for Computing Machinery (ACM)}, author={Krawiec, Faustyna and Peyton Jones, Simon and Krishnaswami, Neel and Ellis, Tom and Eisenberg, Richard A. and Fitzgibbon, Andrew}, year={2022}, month=Jan, pages={1–30} }
hayagriva YAML (typst)
yaml · 22 lines
krawiec-2022-provably:
  type: article
  title: Provably correct, asymptotically efficient, higher-order reverse-mode automatic differentiation
  author:
  - Krawiec, Faustyna
  - Peyton Jones, Simon
  - Krishnaswami, Neel
  - Ellis, Tom
  - Eisenberg, Richard A.
  - Fitzgibbon, Andrew
  date: 2022-01
  page-range: 1-30
  url: http://dx.doi.org/10.1145/3498710
  serial-number:
    doi: 10.1145/3498710
    issn: 2475-1421
  parent:
    type: periodical
    title: Proceedings of the ACM on Programming Languages
    publisher: Association for Computing Machinery (ACM)
    issue: POPL
    volume: 6
krawiec-2022-provably reference entries/refs/krawiec-2022-provably/krawiec-2022-provably.hel