Perturbation confusion in forward automatic differentiation of higher-order functions. (2019)

• Record Type: Journal Article
• Authors: MANZYUK, OLEKSANDR; PEARLMUTTER, BARAK A.; RADUL, ALEXEY ANDREYEVICH; RUSH, DAVID R.; SISKIND, JEFFREY MARK
• Is Part Of: Journal of functional programming. Volume 29(2019)
• Publication Date: 2019
• Subjects: Functional programming (Computer science) -- Periodicals
• DOI: 10.1017/S095679681900008X
• Languages: English
• ISSNs: 0956-7968

Abstract

Abstract: Automatic differentiation (AD) is a technique for augmenting computer programs to compute derivatives. The essence of AD in its forward accumulation mode is to attach perturbations to each number, and propagate these through the computation by overloading the arithmetic operators. When derivatives are nested, the distinct derivative calculations, and their associated perturbations, must be distinguished. This is typically accomplished by creating a unique tag for each derivative calculation and tagging the perturbations. We exhibit a subtle bug, present in fielded implementations which support derivatives of higher-order functions, in which perturbations are confused despite the tagging machinery, leading to incorrect results. The essence of the bug is as follows: a unique tag is needed for each derivative calculation, but in existing implementations unique tags are created when taking the derivative of a function at a point. When taking derivatives of higher-order functions, these need not correspond! We exhibit a simple example: a higher-order function f whose derivative at a point x, namely f ′( x ), is itself a function which calculates a derivative. This situation arises naturally when taking derivatives of curried functions. Two potential solutions are presented, and their deficiencies discussed. One uses eta expansion to delay the creation of fresh tags in order to put them into one-to-one correspondence with derivative calculations. The other wraps outputs of derivative operators with tag substitution machinery. Both solutions seem very difficult to implement without violating the desirable complexity guarantees of forward AD.