REVIEW 1 cited by
On the Equivalence of Automatic and Symbolic Differentiation
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We show that reverse 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.
Forward citations
Cited by 1 Pith paper
-
Information Preserving Line Search via Bayesian Optimization
A Bayesian-optimization-based line search that keeps all past evaluations chooses step lengths and is claimed to converge with fewer function evaluations on CUTEst benchmarks.
Discussion (0). Continue with ORCID to comment.