On the Equivalence of Forward Mode Automatic Differentiation and Symbolic Differentiation

04/05/2019
by   Soeren Laue, et al.
0

We show that forward mode automatic differentiation and symbolic differentiation are equivalent in the sense that they both perform the same operations when computing derivatives. This is in stark contrast to the common claim that they are substantially different. The difference is often illustrated by claiming that symbolic differentiation suffers from "expression swell" whereas automatic differentiation does not. Here, we show that this statement is not true. "Expression swell" refers to the phenomenon of a much larger representation of the derivative as opposed to the representation of the original function.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/02/2022

Combinatory Adjoints and Differentiation

We develop a compositional approach for automatic and symbolic different...
research
03/10/2020

Graded Automatic Differentiation

Based on a class of associative algebras with zero-divisors which are ca...
research
05/04/2017

Compile-Time Symbolic Differentiation Using C++ Expression Templates

Template metaprogramming is a popular technique for implementing compile...
research
06/01/2017

Automatic Differentiation using Constraint Handling Rules in Prolog

Automatic differentiation is a technique which allows a programmer to de...
research
10/05/2021

Coarsening Optimization for Differentiable Programming

This paper presents a novel optimization for differentiable programming ...
research
06/08/2020

AutoMat – Automatic Differentiation for Generalized Standard Materials on GPUs

We propose a universal method for the evaluation of generalized standard...
research
08/28/2019

Forward-Mode Differentiation of Maxwell's Equations

We present a previously unexplored forward-mode differentiation method f...

Please sign up or login with your details

Forgot password? Click here to reset