REVIEW 2 cited by
Stochastic Proximal Point Methods for Monotone Inclusions under Expected Similarity
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
Signed reviews
read the original abstract
Monotone inclusions have a wide range of applications, including minimization, saddle-point, and equilibria problems. We introduce new stochastic algorithms, with or without variance reduction, to estimate a root of the expectation of possibly set-valued monotone operators, using at every iteration one call to the resolvent of a randomly sampled operator. We also introduce a notion of similarity between the operators, which holds even for discontinuous operators. We leverage it to derive linear convergence results in the strongly monotone setting.
Forward citations
Cited by 2 Pith papers
-
The Stochastic Multi-Proximal Method for Nonsmooth Optimization
SMPM is a stochastic multi-proximal method that recovers several existing algorithms as special cases and provides new linear and accelerated sublinear convergence guarantees for nonsmooth convex problems.
-
Variance-Reduced Fast Operator Splitting Methods for Generalized Equations
A new class of accelerated forward-backward and backward-forward splitting methods with variance-reduced estimators achieves O(1/k^2) and o(1/k^2) expected residual convergence for generalized equations under co-coerc...
Discussion (0). Continue with ORCID to comment.