Research map / Learning theory and algorithms / Submodular and game algorithms
Fast Constrained Submodular Maximization: Personalized Data Summarization
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 FANTOM instead of Greedy and Density Greedy, varying knapsack limit c | constrained submodular maximization · MovieLens movie recommendation (Eq. 2) | solution value | Helped |
| use FANTOM instead of Greedy and Density Greedy, varying matroid limit m | constrained submodular maximization · MovieLens movie recommendation (Eq. 2) | solution value | Helped |
| use FANTOM with the Eq. 3 utility, varying c and m | constrained submodular maximization · MovieLens movie recommendation (Eq. 3) | solution value | Helped |
| use Eq. 3 utility instead of Eq. 2 for recommendations (ablation) | FANTOM · MovieLens movie recommendation | genre match of recommended movies | Helped |
| use FANTOM instead of benchmarks, varying budget c | FANTOM · YouTube revenue maximization | revenue | Helped |
| use FANTOM instead of benchmarks, varying matroid limit m, user limit u and items x | FANTOM · YouTube revenue maximization | revenue | Helped |
| use FANTOM instead of benchmarks, varying knapsack limit c | FANTOM · Tiny Images personalized summarization | solution value | Helped |
| use FANTOM instead of benchmarks, varying matroid limit m | FANTOM · Tiny Images personalized summarization | solution value | Helped |
Closest papers by meaning
- Fast Distributed Submodular Cover: Public-Private Data Summarization (NeurIPS 2016 · similarity 0.90)
- Streaming Non-Monotone Submodular Maximization: Personalized Video Summarization on the Fly (AAAI 2018 · similarity 0.90)
- Deletion-Robust Submodular Maximization with Knapsack Constraints (AAAI 2024 · similarity 0.88)
- Online and Streaming Algorithms for Constrained k-Submodular Maximization (AAAI 2025 · similarity 0.87)
- Practical $0.385$-Approximation for Submodular Maximization Subject to a Cardinality Constraint (NeurIPS 2024 · similarity 0.87)
- Streaming Stochastic Submodular Maximization with On-Demand User Requests (NeurIPS 2025 · similarity 0.86)
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.