atlas

Research map / Optimization / Nonconvex and smooth optimization

Stochastic Continuous Submodular Maximization: Boosting via Non-oblivious Function

ICML 2022 · Optimization › Nonconvex and smooth optimization · approach: Stochastic convex optimization complexity · 3 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 the non-oblivious function F and its sampled stochastic gradient instead of the original objective gradientGradient ascent for weakly DR-submodular maximization · Offline stochastic continuous DR-submodular maximizationapproximation guarantee: $(\frac{\gamma^2}{1+\gamma^2})$ to $(1-e^{-\gamma}-\epsilon^{2})$Helped
Use the non-oblivious function F in online gradient ascentOnline stochastic continuous DR-submodular maximization · No-delay online settingapproximation ratio: $1/2$ to $1-1/e$Helped
Use delayed online boosting gradient ascent with FOnline stochastic continuous DR-submodular maximization · Adversarial delayed feedbackapproximation-regret: $O(\sqrt{D})$Helped
Replace deterministic Frank-Wolfe updates with stochastic projected gradient updates using FOffline continuous DR-submodular maximization · Monotone stochastic continuous DR-submodular functionsgradient oracle complexity: $O(1/\epsilon^3)$ to $O(1/\epsilon^2)$Helped

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