REVIEW 1 cited by
Linear Convergence of Stochastic Frank Wolfe Variants
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
In this paper, we show that the Away-step Stochastic Frank-Wolfe Algorithm (ASFW) and Pairwise Stochastic Frank-Wolfe algorithm (PSFW) converge linearly in expectation. We also show that if an algorithm convergences linearly in expectation then it converges linearly almost surely. In order to prove these results, we develop a novel proof technique based on concepts of empirical processes and concentration inequalities. Such a technique has rarely been used to derive the convergence rates of stochastic optimization algorithms. In large-scale numerical experiments, ASFW and PSFW perform as well as or better than their stochastic competitors in actual CPU time.
Forward citations
Cited by 1 Pith paper
-
A Data Efficient and Feasible Level Set Method for Stochastic Convex Optimization with Expectation Constraints
A stochastic feasible level-set method maintains a high-probability feasible solution path for convex optimization with expectation constraints, with iteration complexity comparable to stochastic subgradient methods.
Discussion (0). Continue with ORCID to comment.