atlas

Research map / Optimization / Nonconvex and smooth optimization

Can Stochastic Zeroth-Order Frank-Wolfe Method Converge Faster for Non-Convex Problems?

ICML 2020 · Optimization › Nonconvex and smooth optimization · approach: Stochastic Frank-Wolfe methods

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
Replace ZSCG's averaged Gaussian gradient estimator with coordinate-wise estimator plus variance reduction (FZFW)zeroth-order Frank-Wolfe · Synthetic MCCR (Syn-1, Syn-2)objective value vs iterationsHelped
Add conditional gradient sliding (acceleration) to FZFW (FZCGS) (ablation)zeroth-order Frank-Wolfe · Synthetic MCCR (Syn-1, Syn-2)objective value vs iterationsHelped
Add conditional gradient sliding (acceleration) to FZFW (FZCGS) (ablation)zeroth-order Frank-Wolfe · Low-rank matrix completion (MovieLens100k)loss value vs iterationsHelped
Add conditional gradient sliding (acceleration) to FZFW (FZCGS) (ablation)zeroth-order Frank-Wolfe · Adversarial examples on black-box DNN (MNIST)objective value vs iterationsHelped
Use variance-reduced first-order conditional gradient sliding (FCGS) instead of NCGS-VRfirst-order conditional gradient sliding · Synthetic MCCR (Syn-1, Syn-2)objective value vs number of function queriesHelped

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