AI Paper Atlas

Research map / Bandits and online learning / Online convex optimization and games

Online Continuous Submodular Maximization: From Full-Information to Bandit Feedback

Mingrui Zhang, Lin Chen, Hamed Hassani, Amin Karbasi

NeurIPS 2019 · Bandits and online learning › Online convex optimization and games · approach: Best-of-both-worlds bandit algorithms · 20 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
Use blocking and random permutations to obtain one stochastic gradient evaluation per functionMono-FW for OCSM · OCSM# of gradient evaluations per function: T^{3/2} -> 1Improved
Require a function-independent unbiased rounding scheme whose outputs always satisfy the matroid constraintVanilla bandit submodular maximization · BSM with matroid constraintsExistence of an unbiased feasible rounding schemeHurt

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