mlsanityData to 7 Oct 2026

A frequency-domain analysis of inexact gradient methods

arXiv 1912.13494 ↗First posted 31 Dec 2019math.OC cs.LG cs.NAcited by 7

Not on the map. Why?

Abstract (arXiv)

We study robustness properties of some iterative gradient-based methods for strongly convex functions, as well as for the larger class of functions with sector-bounded gradients, under a relative error model. Proofs of the corresponding convergence rates are based on frequency-domain criteria for the stability of nonlinear systems. Applications are given to inexact versions of gradient descent and the Triple Momentum Method. To further emphasize the usefulness of frequency-domain methods, we derive improved analytic bounds for the convergence rate of Nesterov's accelerated method (in the exact setting) on strongly convex functions.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). First posted on arXiv 31 Dec 2019.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 3; 2023: 1; 2024: 1; 2025: 1; 2026: 1.

7 papers.