atlas

Research map / Optimization / Nonconvex and smooth optimization

Gradient Methods for Submodular Maximization

NeurIPS 2017 · Optimization › Nonconvex and smooth optimization · approach: Stochastic convex optimization complexity · 27 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 stochastic projected gradient or mirror ascent instead of the Frank-Wolfe variantMovieLens facility location and concave-over-modular objectives · MovieLensutilityHelped
Use stochastic gradient or mirror ascent with batch size B=20MovieLens concave-over-modular objective · MovieLensutilityNo clear effect
Increase the Frank-Wolfe batch size relative to stochastic gradient methodsFrank-Wolfe variant · MovieLens facility location and concave-over-modular objectivesutilityHelped
Use stochastic projected gradient or mirror ascent rather than batch-mode greedyMovieLens facility location objective · MovieLenscomputational effort at comparable utilityNo clear effect

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