AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

On Frank-Wolfe and Equilibrium Computation

Jacob D. Abernethy, Jun-Kun Wang

NeurIPS 2017 · Optimization › Nonconvex and smooth optimization · approach: Stochastic Frank-Wolfe methods · 23 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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
Cumulative-gradient linear oracle (Algorithm 3) instead of last-gradient oracle in Frank-WolfeFrank-Wolfe · smooth convex constrained optimization (theoretical)approximation error rateNo clear effect
Stochastic smoothing of objective via random perturbation (FTPL-style, as in Mokhtari et al.)Frank-Wolfe on non-smooth objectives · constrained convex optimization (theoretical)approximation error rateNo clear effect
Boundary Frank-Wolfe: swap roles so x-player is prescient, using FTL on strongly convex decision set, no smoothness of f requiredFrank-Wolfe on non-smooth objectives over strongly convex sets · strongly convex constraint set (theoretical)convergence rateImproved
Adding random perturbation (Gaussian-like) to gradient in boundary FW to guarantee nonzero cumulative gradientBoundary Frank-Wolfe · strongly convex constraint set (theoretical)convergence rateHurt

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