Automatic differentiation explained

In mathematics and computer algebra, automatic differentiation (auto-differentiation, autodiff, or AD), also called algorithmic differentiation, computational differentiation,^{[1] [2]} is a set of techniques to evaluate the partial derivative of a function specified by a computer program.

Automatic differentiation exploits the fact that every computer calculation, no matter how complicated, executes a sequence of elementary arithmetic operations (addition, subtraction, multiplication, division, etc.) and elementary functions (exp, log, sin, cos, etc.). By applying the chain rule repeatedly to these operations, partial derivatives of arbitrary order can be computed automatically, accurately to working precision, and using at most a small constant factor of more arithmetic operations than the original program.

Difference from other differentiation methods

Automatic differentiation is distinct from symbolic differentiation and numerical differentiation. Symbolic differentiation faces the difficulty of converting a computer program into a single mathematical expression and can lead to inefficient code. Numerical differentiation (the method of finite differences) can introduce round-off errors in the discretization process and cancellation. Both of these classical methods have problems with calculating higher derivatives, where complexity and errors increase. Finally, both of these classical methods are slow at computing partial derivatives of a function with respect to many inputs, as is needed for gradient-based optimization algorithms. Automatic differentiation solves all of these problems.

Applications

Automatic differentiation is particularly important in the field of machine learning. For example, it allows one to implement backpropagation in a neural network without a manually-computed derivative.

Forward and reverse accumulation

Chain rule of partial derivatives of composite functions

Fundamental to automatic differentiation is the decomposition of differentials provided by the chain rule of partial derivatives of composite functions. For the simple compositionthe chain rule gives$$\backslash frac\; =\; \backslash frac\; \backslash frac\; \backslash frac\; =\; \backslash frac\; \backslash frac\; \backslash frac$$

Two types of automatic differentiation

Usually, two distinct modes of automatic differentiation are presented.

• forward accumulation (also called bottom-up, forward mode, or tangent mode)
• reverse accumulation (also called top-down, reverse mode, or adjoint mode)

Forward accumulation specifies that one traverses the chain rule from inside to outside (that is, first compute

\partial w _{1/} \partial x and then \partial w _{2/\partial} w _{1} and at last \partial y/\partial w _{2} ), while reverse accumulation has the traversal from outside to inside (first compute \partial y/\partial w _{2} and then \partial w _{2/\partial} w _{1} and at last \partial w _{1/\partial} x ). More succinctly,

• Forward accumulation computes the recursive relation:

(\partial w _{i})/(\partial x) = (\partial w _{i})/(\partial w _{i-1}) (\partial w _{i-1})/(\partial x) with w _{3} = y , and,

• Reverse accumulation computes the recursive relation:

(\partial y)/(\partial w _{i}) = (\partial y)/(\partial w _{i+1}) (\partial w _{i+1})/(\partial w _{i}) with w _{0} = x .

The value of the partial derivative, called seed, is propagated forward or backward and is initially

(\partial x)/(\partial x) =1 or (\partial y)/(\partial y) =1 . Forward accumulation evaluates the function and calculates the derivative with respect to one independent variable in one pass. For each independent variable x _{1,x} _{2,...,x} _{n} a separate pass is therefore necessary in which the derivative with respect to that independent variable is set to one ((\partial x _{1})/(\partial x _{1}) =1 ) and of all others to zero ((\partial x _{2})/(\partial x _{1}) = ... = (\partial x _{n})/(\partial x _{1}) = 0 ). In contrast, reverse accumulation requires the evaluated partial functions for the partial derivatives. Reverse accumulation therefore evaluates the function first and calculates the derivatives with respect to all independent variables in an additional pass.

Which of these two types should be used depends on the sweep count. The computational complexity of one sweep is proportional to the complexity of the original code.

• Forward accumulation is more efficient than reverse accumulation for functions with as only sweeps are necessary, compared to sweeps for reverse accumulation.
• Reverse accumulation is more efficient than forward accumulation for functions with as only sweeps are necessary, compared to sweeps for forward accumulation.

Backpropagation of errors in multilayer perceptrons, a technique used in machine learning, is a special case of reverse accumulation.

Forward accumulation was introduced by R.E. Wengert in 1964. According to Andreas Griewank, reverse accumulation has been suggested since the late 1960s, but the inventor is unknown.^[3] Seppo Linnainmaa published reverse accumulation in 1976.^[4]

Forward accumulation

In forward accumulation AD, one first fixes the independent variable with respect to which differentiation is performed and computes the derivative of each sub-expression recursively. In a pen-and-paper calculation, this involves repeatedly substituting the derivative of the inner functions in the chain rule:This can be generalized to multiple variables as a matrix product of Jacobians.

Compared to reverse accumulation, forward accumulation is natural and easy to implement as the flow of derivative information coincides with the order of evaluation. Each variable

w _{i} is augmented with its derivative • w _{i} (stored as a numerical value, not a symbolic expression),$$\backslash dot\; w\_i\; =\; \backslash frac$$as denoted by the dot. The derivatives are then computed in sync with the evaluation steps and combined with other derivatives via the chain rule.

Using the chain rule, if

w _{i} has predecessors in the computational graph:• w _{i} = \sum _{j} } \frac \dot w_j

As an example, consider the function:For clarity, the individual sub-expressions have been labeled with the variables

w _{i} .

The choice of the independent variable to which differentiation is performed affects the seed values and . Given interest in the derivative of this function with respect to, the seed values should be set to:$$\backslash begin\backslash dot\; w\_1\; =\; \backslash frac\; =\; \backslash frac\; =\; 1\; \backslash \backslash \backslash dot\; w\_2\; =\; \backslash frac\; =\; \backslash frac\; =\; 0\backslash end$$

With the seed values set, the values propagate using the chain rule as shown. Figure 2 shows a pictorial depiction of this process as a computational graph.

Operations to compute value	Operations to compute derivative
w _{1} = x _{1}	• w _{1} = 1 (seed)
w _{2} = x _{2}	• w _{2} = 0 (seed)
w _{3} = w _{1} ⋅ w _{2}	• w _{3} = w _{2} ⋅ • w _{1} + w _{1} ⋅ • w _{2}
w _{4} = \sin w _{1}	• w _{4} = \cos w _{1} ⋅ • w _{1}
w _{5} = w _{3} + w _{4}	• w _{5} = • w _{3} + • w _{4}

To compute the gradient of this example function, which requires not only

\tfrac{\partial y}{\partial x _{1}} but also \tfrac{\partial y}{\partial x _{2}} , an additional sweep is performed over the computational graph using the seed values • w _{1} = 0 ; • w _{2} = 1 .

Implementation

Pseudocode

Forward accumulation calculates the function and the derivative (but only for one independent variable each) in one pass. The associated method call expects the expression Z to be derived with regard to a variable V. The method returns a pair of the evaluated function and its derivation. The method traverses the expression tree recursively until a variable is reached. If the derivative with respect to this variable is requested, its derivative is 1, 0 otherwise. Then the partial function as well as the partial derivative are evaluated.^[5] tuple evaluateAndDerive(Expression Z, Variable V)

C++

1. include

struct ValueAndPartial ;struct Variable;struct Expression ;struct Variable: public Expression ;struct Plus: public Expression ;struct Multiply: public Expression ;int main

Reverse accumulation

In reverse accumulation AD, the dependent variable to be differentiated is fixed and the derivative is computed with respect to each sub-expression recursively. In a pen-and-paper calculation, the derivative of the outer functions is repeatedly substituted in the chain rule:

In reverse accumulation, the quantity of interest is the adjoint, denoted with a bar

\bar w _{i} ; it is a derivative of a chosen dependent variable with respect to a subexpression w _{i} :$$\backslash bar\; w\_i\; =\; \backslash frac$$

Using the chain rule, if

w _{i} has successors in the computational graph:\bar w _{i} = \sum _{j} } \bar w_j \frac

Reverse accumulation traverses the chain rule from outside to inside, or in the case of the computational graph in Figure 3, from top to bottom. The example function is scalar-valued, and thus there is only one seed for the derivative computation, and only one sweep of the computational graph is needed to calculate the (two-component) gradient. This is only half the work when compared to forward accumulation, but reverse accumulation requires the storage of the intermediate variables as well as the instructions that produced them in a data structure known as a "tape" or a Wengert list^[6] (however, Wengert published forward accumulation, not reverse accumulation^[7]), which may consume significant memory if the computational graph is large. This can be mitigated to some extent by storing only a subset of the intermediate variables and then reconstructing the necessary work variables by repeating the evaluations, a technique known as rematerialization. Checkpointing is also used to save intermediary states.

The operations to compute the derivative using reverse accumulation are shown in the table below (note the reversed order):The data flow graph of a computation can be manipulated to calculate the gradient of its original calculation. This is done by adding an adjoint node for each primal node, connected by adjoint edges which parallel the primal edges but flow in the opposite direction. The nodes in the adjoint graph represent multiplication by the derivatives of the functions calculated by the nodes in the primal. For instance, addition in the primal causes fanout in the adjoint; fanout in the primal causes addition in the adjoint; a unary function in the primal causes in the adjoint; etc.

Implementation

Pseudo code

Reverse accumulation requires two passes: In the forward pass, the function is evaluated first and the partial results are cached. In the reverse pass, the partial derivatives are calculated and the previously derived value is backpropagated. The corresponding method call expects the expression Z to be derived and seed with the derived value of the parent expression. For the top expression, Z derived with regard to Z, this is 1. The method traverses the expression tree recursively until a variable is reached and adds the current seed value to the derivative expression.^{[8] [9]} void derive(Expression Z, float seed)

C++

1. include

struct Expression ;struct Variable: public Expression ;struct Plus: public Expression ;struct Multiply: public Expression ;int main

Beyond forward and reverse accumulation

Forward and reverse accumulation are just two (extreme) ways of traversing the chain rule. The problem of computing a full Jacobian of with a minimum number of arithmetic operations is known as the optimal Jacobian accumulation (OJA) problem, which is NP-complete.^[10] Central to this proof is the idea that algebraic dependencies may exist between the local partials that label the edges of the graph. In particular, two or more edge labels may be recognized as equal. The complexity of the problem is still open if it is assumed that all edge labels are unique and algebraically independent.

Automatic differentiation using dual numbers

Forward mode automatic differentiation is accomplished by augmenting the algebra of real numbers and obtaining a new arithmetic. An additional component is added to every number to represent the derivative of a function at the number, and all arithmetic operators are extended for the augmented algebra. The augmented algebra is the algebra of dual numbers.

Replace every number

x with the number x + x'\varepsilon , where x' is a real number, but \varepsilon is an abstract number with the property \varepsilon ^{2=0} (an infinitesimal; see Smooth infinitesimal analysis). Using only this, regular arithmetic givesusing ( 1 + y'\varepsilon/y) ⋅ ( 1 - y'\varepsilon/y) = 1 .

Now, polynomials can be calculated in this augmented arithmetic. If

P(x) = p _{0} + p _{1} x + p ^{2} _{2 x} + … + p _{n} x ^{n} , thenwhere P ^{(1)} denotes the derivative of P with respect to its first argument, and x' , called a seed, can be chosen arbitrarily.

The new arithmetic consists of ordered pairs, elements written

\langle x, x' \rangle , with ordinary arithmetics on the first component, and first order differentiation arithmetic on the second component, as described above. Extending the above results on polynomials to analytic functions gives a list of the basic arithmetic and some standard functions for the new arithmetic:and in general for the primitive function g ,$$g(\backslash langle\; u,u\text{'}\; \backslash rangle,\; \backslash langle\; v,v\text{'}\; \backslash rangle)\; =\; \backslash langle\; g(u,v),\; g\_u(u,v)\; u\text{'}\; +\; g\_v(u,v)\; v\text{'}\; \backslash rangle$$where g _{u} and g _{v} are the derivatives of g with respect to its first and second arguments, respectively.

When a binary basic arithmetic operation is applied to mixed arguments—the pair

\langle u, u' \rangle and the real number c —the real number is first lifted to \langle c, 0 \rangle . The derivative of a function f : \R\to\R at the point x _{0} is now found by calculating f(\langle x _{0,} 1 \rangle) using the above arithmetic, which gives \langle f ( x _{0} ) , f' ( x _{0} ) \rangle as the result.

Implementation

An example implementation based on the dual number approach follows.

C++

1. include

struct Dual ;// Example: Finding the partials of z = x * (x + y) + y * y at (x, y) = (2, 3)Dual f(Dual x, Dual y) int main

Vector arguments and functions

Multivariate functions can be handled with the same efficiency and mechanisms as univariate functions by adopting a directional derivative operator. That is, if it is sufficient to compute

y' = \nabla f(x) ⋅ x' , the directional derivative y' \in \R ^{m} of f:\R ^{n\to\R} ^{m} at x \in \R ^{n} in the direction x' \in \R ^{n} may be calculated as (\langle y _{1,y'} _{1\rangle,} \ldots, \langle y _{m,y'} _{m\rangle)} = f(\langle x _{1,x'} _{1\rangle,} \ldots, \langle x _{n,x'} _{n\rangle)} using the same arithmetic as above. If all the elements of \nabla f are desired, then n function evaluations are required. Note that in many optimization applications, the directional derivative is indeed sufficient.

High order and many variables

The above arithmetic can be generalized to calculate second order and higher derivatives of multivariate functions. However, the arithmetic rules quickly grow complicated: complexity is quadratic in the highest derivative degree. Instead, truncated Taylor polynomial algebra can be used. The resulting arithmetic, defined on generalized dual numbers, allows efficient computation using functions as if they were a data type. Once the Taylor polynomial of a function is known, the derivatives are easily extracted.

Implementation

Forward-mode AD is implemented by a nonstandard interpretation of the program in which real numbers are replaced by dual numbers, constants are lifted to dual numbers with a zero epsilon coefficient, and the numeric primitives are lifted to operate on dual numbers. This nonstandard interpretation is generally implemented using one of two strategies: source code transformation or operator overloading.

Source code transformation (SCT)

The source code for a function is replaced by an automatically generated source code that includes statements for calculating the derivatives interleaved with the original instructions.

Source code transformation can be implemented for all programming languages, and it is also easier for the compiler to do compile time optimizations. However, the implementation of the AD tool itself is more difficult and the build system is more complex.

Operator overloading (OO)

Operator overloading is a possibility for source code written in a language supporting it. Objects for real numbers and elementary mathematical operations must be overloaded to cater for the augmented arithmetic depicted above. This requires no change in the form or sequence of operations in the original source code for the function to be differentiated, but often requires changes in basic data types for numbers and vectors to support overloading and often also involves the insertion of special flagging operations. Due to the inherent operator overloading overhead on each loop, this approach usually demonstrates weaker speed performance.

Operator overloading and source code transformation

Overloaded Operators can be used to extract the valuation graph, followed by automatic generation of the AD-version of the primal function at run-time. Unlike the classic OO AAD, such AD-function does not change from one iteration to the next one. Hence there is any OO or tape interpretation run-time overhead per Xi sample.

With the AD-function being generated at runtime, it can be optimised to take into account the current state of the program and precompute certain values. In addition, it can be generated in a way to consistently utilize native CPU vectorization to process 4(8)-double chunks of user data (AVX2\AVX512 speed up x4-x8). With multithreading added into account, such approach can lead to a final acceleration of order 8 × #Cores compared to the traditional AAD tools. A reference implementation is available on GitHub.^[11]

See also

• Differentiable programming

Further reading

• Book: Rall , Louis B. . Automatic Differentiation: Techniques and Applications . . Lecture Notes in Computer Science . 120 . 1981 . 978-3-540-10861-0.
• Book: Griewank . Andreas . Walther . Andrea . Andrea Walther . Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation . 2nd . . Other Titles in Applied Mathematics . 105 . 2008 . 10.1137/1.9780898717761 . 978-0-89871-659-7 . 2009-10-21 . https://web.archive.org/web/20100323035649/http://www.ec-securehost.com/SIAM/OT105.html . 2010-03-23 . dead-->.
• Neidinger . Richard . Introduction to Automatic Differentiation and MATLAB Object-Oriented Programming . SIAM Review . 2010. 52 . 3 . 545–563 . 10.1137/080743627 . 2013-03-15. 10.1.1.362.6580 . 17134969 .
• Book: Naumann , Uwe . The Art of Differentiating Computer Programs . . Software-Environments-tools . 2012 . 978-1-611972-06-1.
• Book: Henrard , Marc . Algorithmic Differentiation in Finance Explained . . Financial Engineering Explained . 2017 . 978-3-319-53978-2.

External links

• www.autodiff.org, An "entry site to everything you want to know about automatic differentiation"
• Automatic Differentiation of Parallel OpenMP Programs
• Automatic Differentiation, C++ Templates and Photogrammetry
• Automatic Differentiation, Operator Overloading Approach
• Compute analytic derivatives of any Fortran77, Fortran95, or C program through a web-based interface Automatic Differentiation of Fortran programs
• Description and example code for forward Automatic Differentiation in Scala
• finmath-lib stochastic automatic differentiation, Automatic differentiation for random variables (Java implementation of the stochastic automatic differentiation).
• Adjoint Algorithmic Differentiation: Calibration and Implicit Function Theorem
• C++ Template-based automatic differentiation article and implementation
• Tangent Source-to-Source Debuggable Derivatives
• Exact First- and Second-Order Greeks by Algorithmic Differentiation
• Adjoint Algorithmic Differentiation of a GPU Accelerated Application
• Adjoint Methods in Computational Finance Software Tool Support for Algorithmic Differentiationop
• More than a Thousand Fold Speed Up for xVA Pricing Calculations with Intel Xeon Scalable Processors

Notes and References

1. Neidinger. Richard D.. Introduction to Automatic Differentiation and MATLAB Object-Oriented Programming. SIAM Review. 2010. 52. 3. 545–563. 10.1137/080743627. 10.1.1.362.6580. 17134969 .
2. Baydin. Atilim Gunes. Pearlmutter. Barak. Radul. Alexey Andreyevich. Siskind. Jeffrey. Automatic differentiation in machine learning: a survey. Journal of Machine Learning Research. 2018. 18. 1–43.
3. Griewank . Andreas . 2012 . Who Invented the Reverse Mode of Differentiation? . Optimization Stories, Documenta Matematica . Extra Volume ISMP . 389–400 . 10.4171/dms/6/38 . 978-3-936609-58-5 .
4. Linnainmaa . Seppo . 1976 . Taylor Expansion of the Accumulated Rounding Error . BIT Numerical Mathematics . 16 . 2 . 146–160 . 10.1007/BF01931367 . 122357351 .
5. Book: . Proceedings of the Sixth Workshop on Data Management for End-To-End Machine Learning . LLVM code optimisation for automatic differentiation . 2022. 1–4 . 10.1145/3533028.3533302. 9781450393751 . 248853034 . English.
6. Bartholomew-Biggs. Michael. Brown. Steven. Christianson. Bruce. Dixon. Laurence. 2000. Automatic differentiation of algorithms. Journal of Computational and Applied Mathematics. 124. 1–2. 171–190. 10.1016/S0377-0427(00)00422-2. 2000JCoAM.124..171B. 2299/3010. free.
7. R.E. Wengert. A simple automatic derivative evaluation program. Comm. ACM. 7. 8. 1964. 463–464. 10.1145/355586.364791. 24039274. free.
8. Book: Maximilian E. Schüle, Harald Lang, Maximilian Springer, Alfons Kemper, Thomas Neumann, Stephan Günnemann. 33rd International Conference on Scientific and Statistical Database Management . In-Database Machine Learning with SQL on GPUs . 2021. 25–36 . 10.1145/3468791.3468840. 9781450384131 . 235386969 . English.
9. Maximilian E. Schüle, Harald Lang, Maximilian Springer, Alfons Kemper, Thomas Neumann, Stephan Günnemann. Recursive SQL and GPU-support for in-database machine learning. Distributed and Parallel Databases. 2022. 40 . 2–3 . 205–259 . 10.1007/s10619-022-07417-7. 250412395 . English. free.
10. Uwe. Naumann. Mathematical Programming. 112. 2. 427–441. April 2008. 10.1007/s10107-006-0042-z. Optimal Jacobian accumulation is NP-complete. 10.1.1.320.5665. 30219572.
11. Web site: AADC Prototype Library. June 22, 2022. GitHub.