1 research outputs found
Graphical Newton
Computing the Newton step for a generic function takes flops. In this paper, we explore avenues for
reducing this bound, when the computational structure of 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