Adaptation to Inexactness for some Gradient-type Methods
Fedor S. Stonyakin

TL;DR
This paper introduces an adaptive gradient method that handles inexact function and gradient evaluations, providing optimal convergence rates for smooth and nonsmooth convex problems with errors, and extends to functions with relaxed Lipschitz conditions.
Contribution
It proposes a novel adaptive gradient method accommodating inexactness in function and gradient evaluations, with proven convergence rates for various convex problem classes.
Findings
Method achieves nearly optimal convergence rates for smooth convex problems with errors.
Extension to nonsmooth convex problems via artificial error introduction.
Linear convergence up to an error-dependent bound.
Abstract
We introduce a notion of inexact model of a convex objective function, which allows for errors both in the function and in its gradient. For this situation, a gradient method with an adaptive adjustment of some parameters of the model is proposed and an estimate for the convergence rate is found. This estimate is optimal on a class of sufficiently smooth problems in the presence of errors. We consider a special class of convex nonsmooth optimization problems. In order to apply the proposed technique to this class, an artificial error should be introduced. We show that the method can be modified for such problems to guarantee a convergence in the function with a nearly optimal rate on the class of convex nonsmooth optimization problems. An adaptive gradient method is proposed for objective functions with some relaxation of the Lipschitz condition for the gradient that satisfy the…
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.
