Graphical Newton
Not on the map. Why?
Abstract (arXiv)
Computing the Newton step for a generic function f: ℝN rightarrow ℝ takes O(N3) flops. In this paper, we explore avenues for reducing this bound, when the computational structure of f is known beforehand. It is shown that the Newton step can be computed in time, linear in the size of the computational-graph, and cubic in its tree-width.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 5 Aug 2015.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1.
1 paper.