Potential-function proofs for gradient methods

43Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This note discusses proofs of convergence for gradient methods (also called “first-order methods”) based on simple potential-function arguments. We cover methods like gradient descent (for both smooth and non-smooth settings), mirror descent, and some accelerated variants. We hope the structure and presentation of these amortized-analysis proofs will be useful as a guiding principle in learning and using these proofs.

Cite

CITATION STYLE

APA

Bansal, N., & Gupta, A. (2019). Potential-function proofs for gradient methods. Theory of Computing, 15. https://doi.org/10.4086/toc.2019.v015a004

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free