Research map / Learning theory and algorithms / Submodular and game algorithms
Robust Submodular Maximization: A Non-Uniform Partitioning Approach
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 non-uniform, exponentially sized buckets in place of OSU's equal-sized robust buckets | Robust submodular maximization · Robust monotone submodular maximization | maximum robustness: o(√k) -> o(k) | Helped |
| Use PRo-Greedy instead of OSU | Robust influence maximization · ego-Facebook and ego-Twitter | worst-case objective | Helped |
| Use PRo-Greedy instead of OSU | Robust image summarization · Tiny10 and CM-Molecules | worst-case objective | Mixed |
| Use PRo-Greedy instead of Greedy | Robust image summarization · Tiny10 | worst-case objective | Hurt |
| Replace the greedy subroutine with Stochastic-Greedy (ablation) | PRo · Robust objective under a greedy adversary, k=100 | objective value | Hurt |
Closest papers by meaning
- Instance Specific Approximations for Submodular Maximization (ICML 2021 · similarity 0.92)
- An Asymptotically Optimal Approximation Algorithm for Multiobjective Submodular Maximization at Scale (ICML 2025 · similarity 0.92)
- Deletion-Robust Submodular Maximization with Knapsack Constraints (AAAI 2024 · similarity 0.91)
- A Unified Approach to Submodular Maximization Under Noise (NeurIPS 2025 · similarity 0.91)
- Consistent Submodular Maximization (ICML 2024 · similarity 0.91)
- Online Two-Stage Submodular Maximization (NeurIPS 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.