Research map / Learning theory and algorithms / Submodular and game algorithms
Probabilistic Submodular Maximization in Sub-Linear Time
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 |
|---|---|---|---|
| Replace greedy-with-local-swap (ReplacementGreedy) instead of LocalSearch for two-stage maximization | two-stage submodular maximization · Wikipedia and VOC2012 summarization | objective value and running time | Mixed |
| Use ReplacementGreedy on reduced ground set of size l instead of full ground set | sublinear movie recommendation · Movielens (k=3) | fraction of full-set utility preserved | Helped |
| Replace GreedyMerge-style full-set evaluation with ReplacementGreedy summary | sublinear movie recommendation · Movielens (k=3) | running time: about two orders of magnitude faster | Helped |
| Use ReplacementGreedy vs GreedySum for reduced ground set selection | sublinear movie recommendation · Movielens (k=3) | fraction of utility preserved | Helped |
| Random selection of reduced ground set instead of ReplacementGreedy | sublinear movie recommendation · Movielens (k=3) | fraction of utility preserved | Hurt |
| Complete rating matrix before optimization (vs. missing entries) (ablation) | sublinear movie recommendation with ReplacementGreedy · Movielens Completed | trends in loss vs size | No clear effect |
Closest papers by meaning
- Submodular Maximization in Clean Linear Time (NeurIPS 2022 · similarity 0.91)
- Online Two-Stage Submodular Maximization (NeurIPS 2025 · similarity 0.91)
- Practical $0.385$-Approximation for Submodular Maximization Subject to a Cardinality Constraint (NeurIPS 2024 · similarity 0.91)
- Randomized Algorithms for Submodular Function Maximization with a $k$-System Constraint (ICML 2021 · similarity 0.91)
- Non-monotone Sequential Submodular Maximization (AAAI 2024 · similarity 0.90)
- Online and Streaming Algorithms for Constrained k-Submodular Maximization (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.