REVIEW 1 cited by
Accelerated Stochastic Algorithms for Convex-Concave Saddle-Point Problems
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
Accelerated Stochastic Algorithms for Convex-Concave Saddle-Point Problems
read the original abstract
We develop stochastic first-order primal-dual algorithms to solve a class of convex-concave saddle-point problems. When the saddle function is strongly convex in the primal variable, we develop the first stochastic restart scheme for this problem. When the gradient noises obey sub-Gaussian distributions, the oracle complexity of our restart scheme is strictly better than any of the existing methods, even in the deterministic case. Furthermore, for each problem parameter of interest, whenever the lower bound exists, the oracle complexity of our restart scheme is either optimal or nearly optimal (up to a log factor). The subroutine used in this scheme is itself a new stochastic algorithm developed for the problem where the saddle function is non-strongly convex in the primal variable. This new algorithm, which is based on the primal-dual hybrid gradient framework, achieves the state-of-the-art oracle complexity and may be of independent interest.
Forward citations
Cited by 1 Pith paper
-
Domain Adaptation of Mismatched Proximal Denoiser for Plug-and-Play Image Reconstruction
For PnP-PGD, residual reconstruction error is bounded by average squared mismatch between the deployed denoiser and the target proximal map, motivating proximal-matching few-shot adaptation that outperforms MSE adapta...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.