Research map / Learning theory and algorithms / Submodular and game algorithms
Streaming Submodular Maximization under a k-Set System Constraint
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 the non-monotone version instead of the monotone version | Proposed streaming algorithm · Non-monotone graph-cut objective on random graphs | objective value | Helped |
| Use the non-monotone version instead of the monotone version | Proposed streaming algorithm · Non-monotone movie-diversity objective | utility | Helped |
| Add more knapsack constraints | Proposed streaming algorithm · Yelp location summarization | utility | Hurt |
| Use the proposed algorithm instead of baseline streaming algorithms | Streaming algorithms · Independent set on random graphs, linear objective | objective value | Helped |
| Use the proposed algorithm instead of baseline streaming algorithms | Streaming algorithms · Independent set on random graphs, graph-cut objective | objective value | Helped |
| Use the proposed algorithm instead of baseline streaming algorithms | Streaming algorithms · Movie recommendation, monotone objective | utility | Helped |
| Use the proposed algorithm instead of baseline streaming algorithms | Streaming algorithms · Movie recommendation, non-monotone objective | utility | Helped |
| Use the proposed algorithm instead of other streaming algorithms | Streaming algorithms · Yelp location summarization | utility | Helped |
| Use the proposed algorithm instead of the baseline streaming algorithm | Streaming algorithms · Twitter summarization | utility | Helped |
Closest papers by meaning
- Do Less, Get More: Streaming Submodular Maximization with Subsampling (NeurIPS 2018 · similarity 0.94)
- Online and Streaming Algorithms for Constrained k-Submodular Maximization (AAAI 2025 · similarity 0.94)
- Streaming k-Submodular Maximization under Noise subject to Size Constraint (ICML 2020 · similarity 0.93)
- Deletion-Robust Submodular Maximization with Knapsack Constraints (AAAI 2024 · similarity 0.92)
- Streaming Stochastic Submodular Maximization with On-Demand User Requests (NeurIPS 2025 · similarity 0.92)
- Consistent Submodular Maximization (ICML 2024 · 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.