~/talk

Automatic Differentiation in PCF

Talkat POPL 2021 · 2021-01-17..01-22· [machine-learning]
links:none on file
links:none on file
slides:none on file

Proves that automatic differentiation on PCF with reals (higher-order, Turing-complete) is correct except on a Lebesgue-measure-zero set: forward and reverse AD compute true gradients forward and reverse mode. Builds a functorial program transformation D and shows errors lie among unstable points, characterized as a countable union of zero sets (more generally a quasi-variety) under the hypothesis that primitives form an admissible clone. Gives the ReLU-if counterexample (wrong at 0) and a constructive proof using logical predicates and an extrusion lemma.

AI-written summary · about

  1. 0:00Introduction
  2. 2:38Notation
  3. 5:15Part I
  4. 14:18Soundness
  5. 16:44Hidden Mistake
  6. 19:16Our Contribution
  7. 19:45Main Result
  8. 22:34Proof
  9. 23:16Stable and Unstable Points
  10. 25:17Proof by Contraposition
  11. 26:40Proof by logical predicate
  12. 27:34Literature review
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.