# Graphical Newton

arXiv: https://arxiv.org/abs/1508.00952 · HTML: https://mlsanity.com/paper/1508.00952/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 5 Aug 2015.

## Built on by (most cited first, 1 of 1)

- [Computing the Newton-step faster than Hessian accumulation](https://mlsanity.com/paper/2108.01219/) (2021)

## 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.