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.
On the Equivalence of Automatic and Symbolic Differentiation
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
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.
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
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.