Graphical Newton

Computing the Newton step for a generic function f: ℝ^N →ℝ takes O(N^3) 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.