# Tensor Methods for Finding Approximate Stationary Points of Convex Functions

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

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 13 Jul 2019.

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

- [Higher-Order Newton Methods with Polynomial Work per Iteration](https://mlsanity.com/paper/2311.06374/) (2023)

## Abstract (arXiv)

In this paper we consider the problem of finding ε-approximate stationary points of convex functions that are p-times differentiable with nu-H"older continuous pth derivatives. We present tensor methods with and without acceleration. Specifically, we show that the non-accelerated schemes take at most Oleft(ε-1/(p+nu-1)right) iterations to reduce the norm of the gradient of the objective below a given ε∈ (0,1). For accelerated tensor schemes we establish improved complexity bounds of Oleft(ε-(p+nu)/[(p+nu-1)(p+nu+1)]right) and Oleft(|log(ε)|ε-1/(p+nu)right), when the H"older parameter nu∈ [0,1] is known. For the case in which nu is unknown, we obtain a bound of Oleft(ε-(p+1)/[(p+nu-1)(p+2)]right) for a universal accelerated scheme. Finally, we also obtain a lower complexity bound of Oleft(ε-2/[3(p+nu)-2]right) for finding ε-approximate stationary points using p-order tensor methods.