Papers › Demystifying Differentiable Programming: Shift/Reset the Penultimate Backpropagator

Demystifying Differentiable Programming: Shift/Reset the Penultimate Backpropagator

27 Mar 2018arXiv:1803.10228archive 2025-07-28

Fei Wang, Daniel Zheng, James Decker, Xilun Wu, Grégory M. Essertel, Tiark Rompf

Deep learning has seen tremendous success over the past decade in computer vision, machine translation, and gameplay. This success rests in crucial ways on gradient-descent optimization and the ability to learn parameters of a neural network by backpropagating observed errors. However, neural network architectures are growing increasingly sophisticated and diverse, which motivates an emerging quest for even more general forms of differentiable programming, where arbitrary parameterized computations can be trained by gradient descent. In this paper, we take a fresh look at automatic differentiation (AD) techniques, and especially aim to demystify the reverse-mode form of AD that generalizes backpropagation in neural networks. We uncover a tight connection between reverse-mode AD and delimited continuations, which permits implementing reverse-mode AD purely via operator overloading and without any auxiliary data structures. We further show how this formulation of AD can be fruitfully combined with multi-stage programming (staging), leading to a highly efficient implementation that combines the performance benefits of deep learning frameworks based on explicit reified computation graphs (e.g., TensorFlow) with the expressiveness of pure library approaches (e.g., PyTorch).

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="1803.10228")

Code

Syntology Ran 0 of 14 code samples harvested from 1 repository linked to this paper; 14 have no recorded run.

By repository: official repository: 14 samples from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

feiwang3311/Lantern officialmentioned in papertfBSD-3-Clause report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

14 samples harvested; 0 ran; 0 honoured the contract we drafted; 14 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

14unverified

Licence: 0 of the 14 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from feiwang3311/Lantern. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

filter_small_glove feiwang3311/Lantern/src/out/ICFP18evaluation/evaluationTreeLSTM/Lantern/preprocess_data.py official repository unverified BSD-3-Clause (permissive) · ea65f139d640ffed · report
getAllwordsFromOneData feiwang3311/Lantern/src/out/ICFP18evaluation/evaluationTreeLSTM/Lantern/preprocess_data.py official repository unverified BSD-3-Clause (permissive) · babfc77723831db5 · report
getColor feiwang3311/Lantern/src/out/ICFP18evaluation/plot.py official repository unverified BSD-3-Clause (permissive) · 52ac662e317d65b8 · report
getColor feiwang3311/Lantern/src/out/NIPS18evaluation/plot.py official repository unverified BSD-3-Clause (permissive) · be9c87b24a9182f3 · report
getColor feiwang3311/Lantern/src/out/PLDI19evaluation/plot.py official repository unverified BSD-3-Clause (permissive) · 0c1be32e92254749 · report
getColor feiwang3311/Lantern/src/out/PLDI19evaluation/plot_stats.py official repository unverified BSD-3-Clause (permissive) · 92bc0ed9e17fef8c · report
getLabelFromFileName feiwang3311/Lantern/src/out/ICFP18evaluation/plot.py official repository unverified BSD-3-Clause (permissive) · 21eaf8f6a9acd245 · report
get_data feiwang3311/Lantern/src/out/ICFP18evaluation/plot.py official repository unverified BSD-3-Clause (permissive) · 62511a53a1185d79 · report
maybe_download feiwang3311/Lantern/src/out/PLDI19evaluation/generate_cifar10_data.py official repository unverified BSD-3-Clause (permissive) · eb68e8019c421bbe · report
parseOneSample feiwang3311/Lantern/src/out/ICFP18evaluation/evaluationTreeLSTM/Lantern/preprocess_data.py official repository unverified BSD-3-Clause (permissive) · 95b48c195f605686 · report
read_pickle_from_file feiwang3311/Lantern/src/out/PLDI19evaluation/generate_cifar10_data.py official repository unverified BSD-3-Clause (permissive) · 7137e8ae47a966ce · report
run feiwang3311/Lantern/src/out/ICFP18evaluation/evaluationLSTM/min-char-lstm-pytorch.py official repository unverified BSD-3-Clause (permissive) · 682d40949a8522c7 · report
run feiwang3311/Lantern/src/out/ICFP18evaluation/evaluationRNN/min-char-rnn-pytorch.py official repository unverified BSD-3-Clause (permissive) · 4b1b4b1c0f2129b2 · report
run feiwang3311/Lantern/src/out/ICFP18evaluation/evaluationRNN/min-char-rnn.py official repository unverified BSD-3-Clause (permissive) · b16f24abf700b5c4 · report

Tasks

Machine TranslationTranslation

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections