Divide-and-conquer checkpointing for arbitrary programs with no user annotation

DOI10.1080/10556788.2018.1459621zbMath1455.65037arXiv1708.06799OpenAlexW3100141945MaRDI QIDQ4685610

Barak A. Pearlmutter, Jeffrey Mark Siskind

Publication date: 9 October 2018

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1708.06799

zbMATH Keywords

lambda calculusprogramming language theorycompiler theorybinomial checkpointingreverse-mode automatic differentiationtreeverse

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Numerical differentiation (65D25)

Related Items (2)

Mini-symposium on automatic differentiation and its applications in the financial industry ⋮ Unnamed Item

Uses Software

• FADBAD++
• TAPENADE

Cites Work

• Nesting forward-mode AD in a functional framework
• Automatic computation of derivatives with the use of the multilevel differentiating technique. I: Algorithmic basis
• The Data-Flow Equations of Checkpointing in Reverse Automatic Differentiation
• Unnamed Item
• Unnamed Item

This page was built for publication: Divide-and-conquer checkpointing for arbitrary programs with no user annotation