Pith. sign in

REVIEW 1 cited by

Potential-Function Proofs for First-Order Methods

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1712.04581 v3 pith:HT5XDLPO submitted 2017-12-13 cs.LG cs.DSmath.OC

Nikhil Bansal , Anupam Gupta This is my paper · ORCID
classification cs.LGcs.DSmath.OC
keywords methodsdescentfirst-orderpotential-functionproofsacceleratedargumentsconvergence
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This note discusses proofs for convergence of 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Private Approximation of Graph Spectra and Cuts via Spectral Amplifiers

    cs.DS 2026-07 conditional novelty 8.0 of 10

    An edge-differentially-private algorithm approximates every cut of any unweighted n-vertex graph with error γ·cut + Õ(n^(13/12+o(1))), beating the previous polynomial-time bound of n^(5/4+o(1)).

Pith tools