Research map / Learning theory and algorithms / Submodular and game algorithms
Sparsification of Decomposable Submodular 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 a sparsifier with ε = 4 for greedy maximization | Facility-location maximization on Uber pickup · Uber pickup | solution quality relative to original greedy: more than 99.9% | Helped |
| Use a sparsifier with ε ≤ 1.0 for greedy maximization | Maximum-coverage maximization on Discogs · Discogs | solution quality relative to original greedy: more than 90% | Helped |
| Set ε = 1 and run greedy on the sparsifier | Uber pickup and Discogs, with k = 8 · Uber pickup and Discogs | sparsifier size and greedy runtime: factor of 30--50 | Helped |
Closest papers by meaning
- Minimizing a Submodular Function from Samples (NeurIPS 2017 · similarity 0.91)
- Approximate Decomposable Submodular Function Minimization for Cardinality-Based Components (NeurIPS 2021 · similarity 0.88)
- Non-Monotone DR-Submodular Function Maximization (AAAI 2017 · similarity 0.88)
- Weakly Submodular Maximization Beyond Cardinality Constraints: Does Randomization Help Greedy? (ICML 2018 · similarity 0.87)
- Decomposable Submodular Maximization in Federated Setting (ICML 2024 · similarity 0.85)
- Online Two-Stage Submodular Maximization (NeurIPS 2025 · similarity 0.85)
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.