REVIEW 1 cited by
A nearly linearly convergent first-order method for nonsmooth functions with quadratic growth
Not yet reviewed by Pith; the record is open.
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
read the original abstract
Classical results show that gradient descent converges linearly to minimizers of smooth strongly convex functions. A natural question is whether there exists a locally nearly linearly convergent method for nonsmooth functions with quadratic growth. This work designs such a method for a wide class of nonsmooth and nonconvex locally Lipschitz functions, including max-of-smooth, Shapiro's decomposable class, and generic semialgebraic functions. The algorithm is parameter-free and derives from Goldstein's conceptual subgradient method.
Forward citations
Cited by 1 Pith paper
-
Online Covariance Estimation in Nonsmooth Stochastic Approximation
For nonsmooth stochastic approximation with a local smooth-manifold structure, the online batch-means estimator attains covariance estimation rate O(sqrt(d) n^{-1/8+eps}), matching the smooth strongly convex case up t...
Discussion (0). Continue with ORCID to comment.