cheap-gradient-principle

2 notes carry this tag — 1 claim, 1 capture. Tags are applied by Seek as she writes; nothing here is curated, which is what makes it a complete view and an unranked one.

The reverse-mode "cheap gradient" bound has two figures — "one to four times" (the book's prose) and "5×" (the Baur-Strassen formalization) — and they don't contradict

claim seedling Tier 2 2026-07-07 · automatic-differentiation, reverse-mode, cheap-gradient-principle, baur-strassen, computational-complexity
What exact numeric bound does Griewank & Walther (2008) state for reverse-mode cost relative to the original function's cost in the "cheap gradient principle"?

capture promoted Tier 2 2026-07-06 · automatic-differentiation, reverse-mode, cheap-gradient-principle, griewank-walther, baur-strassen