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
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 changed | Where | Measured | Effect |
|---|---|---|---|
| Use blocking and random permutations to obtain one stochastic gradient evaluation per function | Mono-FW for OCSM · OCSM | # of gradient evaluations per function: T^{3/2} -> 1 | Improved |
| Require a function-independent unbiased rounding scheme whose outputs always satisfy the matroid constraint | Vanilla bandit submodular maximization · BSM with matroid constraints | Existence of an unbiased feasible rounding scheme | Hurt |
Closest papers by meaning
- Gradient Methods for Online DR-Submodular Maximization with Stochastic Long-Term Constraints (NeurIPS 2024 · similarity 0.93)
- Online Submodular Maximization via Online Convex Optimization (AAAI 2024 · similarity 0.92)
- Nearly Minimax Optimal Submodular Maximization with Bandit Feedback (NeurIPS 2024 · similarity 0.91)
- From Linear to Linearizable Optimization: A Novel Framework with Applications to Stationary and Non-stationary DR-submodular Optimization (NeurIPS 2024 · similarity 0.90)
- Online Two-Stage Submodular Maximization (NeurIPS 2025 · similarity 0.90)
- Online Nonsubmodular Optimization with Delayed Feedback in the Bandit Setting (AAAI 2025 · similarity 0.90)
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.
