Local Convergence of Adaptively Regularized Tensor Methods
Karl Welzel, Yang Liu, Raphael A. Hauser, Coralia Cartis

TL;DR
This paper extends local convergence analysis of adaptively regularized tensor methods to locally uniformly convex functions, providing sharp local rates and discussing challenges in nonconvex settings.
Contribution
It introduces the first sharp local convergence rates for adaptive tensor methods on locally uniformly convex functions, including nonconvex cases, without requiring Lipschitz constant knowledge.
Findings
Adaptive methods achieve superlinear convergence under certain conditions.
Using the global minimizer of subproblems may not always lead to successful iterations.
Proper local model minimizers preserve higher-order convergence rates.
Abstract
Optimization methods that make use of derivatives of the objective function up to order are called tensor methods. Among them, ones that minimize a regularized th-order Taylor expansion at each step have been shown to possess optimal global complexity, which improves as increases. The local convergence of such optimization algorithms on functions that have Lipschitz continuous th derivatives and are uniformly convex of order has been studied by Doikov and Nesterov [Math. Program., 193 (2022), pp. 315--336]. We extend these local convergence results to locally uniformly convex functions and fully adaptive methods, which do not need knowledge of the Lipschitz constant, thus providing the first sharp local rates for AR. We discuss the surprising new challenges encountered by nonconvex local models and non-unique model minimizers. For , our examples show that…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
