Research map / Optimization / Optimizers
Stochastic Submodular Maximization: The Case of Coverage Functions
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 changed | Where | Measured | Effect |
|---|---|---|---|
| Use stochastic continuous optimization instead of Stochastic-Greedy | Facility Location for Blog Selection · Blog Selection | speed at the same utility: 26× faster | Helped |
| Use stochastic continuous optimization instead of Stochastic-Greedy | Influence Maximization · Epinions | speed: 88× faster | Helped |
| Use stochastic continuous optimization instead of Stochastic-Greedy | Exemplar-based Clustering · CIFAR-10 | utility relative to Greedy: 98.4% | Hurt |
| Use stochastic continuous optimization instead of Greedy | Influence Maximization under partition matroids · Epinions | utility | Helped |
Closest papers by meaning
- Gradient Methods for Submodular Maximization (NeurIPS 2017 · similarity 0.92)
- Stochastic Continuous Submodular Maximization: Boosting via Non-oblivious Function (ICML 2022 · similarity 0.91)
- Stochastic Submodular Maximization with Performance-Dependent Item Costs (AAAI 2019 · similarity 0.90)
- Regularized Submodular Maximization at Scale (ICML 2021 · similarity 0.90)
- Online Two-Stage Submodular Maximization (NeurIPS 2025 · similarity 0.89)
- Gradient Methods for Online DR-Submodular Maximization with Stochastic Long-Term Constraints (NeurIPS 2024 · similarity 0.88)
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.