Demystifying differentiable programming: shift/reset the penultimate backpropagator

Citations Over TimeTop 10% of 2019 papers

Abstract

Deep learning has seen tremendous success over the past decade in computer vision, machine translation, and gameplay. This success rests crucially 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 managing any auxiliary data structures. We further show how this formulation of AD can be fruitfully combined with multi-stage programming (staging), leading to an 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).

Related Papers

• → Exponentiated backpropagation algorithm for multilayer feedforward neural networks(2004)23 cited
• → On proto-differentiability of generalized perturbation maps(2006)24 cited
• → Analisis Penurunan Gradien dengan Kombinasi Fungsi Aktivasi pada Algoritma JST untuk Pencarian Akurasi Terbaik(2020)7 cited
• → Training Artificial Neural Networks: Backpropagation via Nonlinear Optimization(2001)6 cited
• → A New Backpropagation Algorithm without Gradient Descent(2018)9 cited