atlas

Research map / Optimization / Nonconvex and smooth optimization

Stochastic Frank-Wolfe for Constrained Finite-Sum Minimization

ICML 2020 · Optimization › Nonconvex and smooth optimization · approach: Stochastic Frank-Wolfe methods · 10 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use constant batch size stochastic Frank-Wolfe with per-sample dual update (one scalar per sample) instead of Mokhtari et al. (2018) estimatorStochastic Frank-Wolfe (SFW) · BREAST CANCER, RCV1, CALIFORNIA HOUSING (l1-constrained)relative suboptimality vs number of sampled gradientsHelped
Replace the averaged-iterate scheme of Lu & Freund (2018) with SFW's last-iterate updatesStochastic Frank-Wolfe (SFW) · RCV1 and other l1 tasksrelative suboptimality vs number of sampled gradientsHelped
Stochastic Frank-Wolfe gap estimator used as stopping criterionStochastic Frank-Wolfe (SFW) · theorydistance to true FW gapNo clear effect
Use sparsity of data points to restrict per-iteration cost to support of datapoint (l1 ball)Stochastic Frank-Wolfe (SFW) · sparse datasetsper-iteration costHelped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy